Ph.D. students

Current students: Toni Farley, Jonathan Lutz.

  1. Dean S. Hoskins, Ph.D., ``Covering Arrays and Optimal Designs'', Computer Science and Engineering, Arizona State University, 2006.
  2. Renee C. Bryce (Turban), Ph.D. ``Algorithms for Covering Arrays'', Computer Science and Engineering, Arizona State University, 2006.
  3. Robert A. Walker II, Ph.D., ``Covering arrays and perfect hash families'', Computer Science and Engineering, Arizona State University, 2005.
  4. Robert P. Gallant, Ph.D., ``Tight orthogonal main effect plans'', Combinatorics and Optimization, University of Waterloo, 1997.
  5. Alan C.H. Ling, Ph.D., ``Pairwise balanced designs and related codes'', Combinatorics and Optimization, University of Waterloo, 1996.
  6. Yeow Meng Chee, Ph.D., ``Turan-type problems in group testing, coding theory and cryptography'', Computer Science, University of Waterloo, 1996. [Outstanding Achievement in Graduate Studies honour]
  7. Zhike Jiang, Ph.D., ``Rotational Steiner triple systems'', Combinatorics and Optimization, University of Waterloo, 1995.
  8. Heidi J. Strayer, Ph.D., ``Bounding flows, distances and reliability in probabilistic networks'', Computer Science, University of Waterloo, 1995.
  9. Doreen L. Erickson, Ph.D., ``Conflict-free access to parallel memory modules'', Computer Science, University of Waterloo, 1993.
  10. Violet R. Syrotiuk, Ph.D., ``Wang tilings and distributed orientation on torus networks'', Computer Science, University of Waterloo, 1992 (co-supervised with J.K. Pachl).
  11. Daryl D. Harms, Ph.D., ``A Symbolic Algebra Environment for Research in Network Reliability'', School of Computing Science, Simon Fraser University, 1992 (co-supervised with A.L. Liestman).
  12. David C. Bigelow, Ph.D., ``Enclosings of latin squares and triple systems'', Pure Mathematics, University of Waterloo, 1990.
  13. Anthony J. Gahlinger, Ph.D., ``Coherence and satisfiability of waveform timing specifications'', Computer Science, University of Waterloo, 1990.
  14. Louis D. Nel, Ph.D., ``Network reliability and facility location in unreliable networks'', Computer Science, University of Waterloo, 1988.
  15. Hosam M. F. AboElFotoh, Ph.D., ``Reliability of radio broadcast networks: a graph theoretic approach'', Computer Science, University of Waterloo, 1988.
  16. Wendy J. Myrvold, Ph.D., ``The ally and adversary reconstruction problems'', Computer Science, University of Waterloo, 1988.
  17. Ehab S. El Mallah, Ph.D., ``Decomposition and embedding problems for restricted networks'', Computer Science, University of Waterloo, 1987.
  18. Aparna Ramanathan, Ph.D., ``Improving bounds for all-terminal network reliability'', Computer Science, University of Waterloo, 1986.

Master's students

  1. Andreas H. Ronneseth, M.S. (CS), ``The Building Block Algorithm: A New Method for Constructing Covering Arrays'', Computer Science and Engineering, Arizona State University, 2006.
  2. Kylan N. Johnson, M.S. (CS), ``Selecting reliable connections in mobile ad hoc networks'', Computer Science and Engineering, Arizona State University, 2005.
  3. Sandhya Durvasula, M.S. (CS), ``Lower bounds for multiple sequence alignment'', Computer Science and Engineering, Arizona State University, 2004.
  4. Kaushik Srinivasan, M.S. (CS), ``Disk recovery in double erasure RAID disk arrays'', Computer Science and Engineering, Arizona State University, 2004.
  5. Xunshan Ma, M.S. (CS), ``Computational method to construct erasure resilient codes'', Computer Science, University of Vermont, 1999.
  6. Shanon D. Place, M.S. (CS), ``Application of bipartite graph matching algorithms for physical therapy student internship assignments'', Computer Science, University of Vermont, 1999.
  7. Myra B. Cohen, M.S. (CS), ``Performance analysis of triple erasure codes in large disk arrays'', Computer Science, University of Vermont, 1999.
  8. Lise Arseneau, M.Math., ``Optimal testing strategies for s,t-series parallel systems'', Combinatorics and Optimization, University of Waterloo, 1996.
  9. Alan Ling, M.Math., ``Pairwise balanced designs with consecutive block sizes'', Combinatorics and Optimization, University of Waterloo, 1995. [Outstanding Achievement in Graduate Studies honour]
  10. Doreen L. Erickson, M.Math., ``Threshold schemes'', Department of Computer Science, University of Waterloo, 1990.
  11. Yeow Meng Chee, M.Math., ``The basis reduction algorithm and the existence of combinatorial designs'', Computer Science, University of Waterloo, 1989.
  12. H.M. Kenneth Warkentyne, M.Math., ``$\Delta$-Y-$\Delta$ reducible graphs'', Computer Science, University of Waterloo, 1988.
  13. Peter B. Channen, M.Math., ``A Performance Evaluation of Distributed Discrete Event Simulation'', Computer Science, University of Waterloo, 1988 (co-supervised with Jan K. Pachl).
  14. Brent N. Clark, M.Math. ``Unit disk graphs'', Computer Science, University of Waterloo, 1985.
  15. Timothy B. Brecht, M.Math. ``Lower bounds for two-terminal network reliability'', Computer Science, University of Waterloo, 1985.
  16. Ehab S. El-Mallah, M.Sc. ``Recursive graph structure and the optimum communication spanning tree problem'', Computational Science, University of Saskatchewan, 1983.
  17. Daryl D. Harms, M.Sc. ``An investigation into bounds on network reliability'', Computational Science, University of Saskatchewan, 1983.
  18. Eric M. Neufeld, M.Sc. ``Construction of reliable series-parallel networks: a combinatorial approach'', Computational Science, University of Saskatchewan, 1983.
  19. Judith B. Peachey, M.Sc. ``The Bradford-Zipf Distribution and Program Behaviour'', Computational Science, University of Saskatchewan, 1981 (co-supervised with R.B. Bunt).

  20. Adithya Raghavendra, MCS, ``Interaction Testing of Web Services'', Computer Science and Engineering, Arizona State University, 2006.
  21. Robin L. Wilcox, MCS, ``In Parameter Order Test Generation Strategies'', Computer Science and Engineering, Arizona State University, 2006.
  22. Ron Castelletto, M.Math., ``A Comparison and Implementation of Monte Carlo Methods for Estimating the Probability of Estimating $s,t$ Connectedness'', Computer Science, University of Waterloo, 1991.
  23. F. David Fracchia, M.Math., ``F-Factors and Single Processor Scheduling'', Computer Science, University of Waterloo, 1987.
  24. Bradley M. Debroni, M.Math., ``Monte Carlo Algorithms for Estimating the Coefficients of the Network Reliability Polynomial'', Department of Computer Science, University of Waterloo, 1987.
  25. Katherine E. Stewart, M.Math., ``Computing the all-terminal reliability exactly'', Computer Science, University of Waterloo, 1987.
  26. Andrea R. Chappell, M.Math. ``The terminal layout problem'', Computer Science, University of Waterloo, 1986.
  27. Louis D. Nel, M.Math. ``The Design and Complexity of VideoTex Cycles'', Computer Science, University of Waterloo, 1985.
  28. Eddy H. Carrasco, M.Math., ``An Implementation of a First Order and Second Order Method for Network Reliability'', Computer Science, University of Waterloo, 1984.