Ph.D. students
Current students: Christopher Sumnicht
- Dylan Lusi, Ph.D., Access Balancing in Storage Systems by Labelling Steiner Systems, Computer Science, Arizona State University, 2021.
- Ryan E. Dougherty, Ph.D., Hash Families and Applications to t-Restrictions, Computer Science, Arizona State University, 2019.
- Erin Lanus, Ph.D., Interaction Testing, Fault Location, and Anonymous Attribute-Based Authorization, Computer Science, Arizona State University, 2019.
- Kaushik Sarkar, Ph.D., Covering Arrays: Algorithms and Asymptotics, Computer Science, Arizona State University, 2016.
- Jonathan Lutz, Ph.D., Scheduled Medium Access Control in Mobile Ad Hoc Networks, Computer Science, Arizona State University, 2013 (co-supervised with Violet R. Syrotiuk).
- Maurice M. Carey, Ph.D., The Classification of Domain Concepts in Object-Oriented Systems, Computer Science, Arizona State University, 2013 (co-supervised with James Collofello).
- Peyman Nayeri, Ph.D., Post-Optimization: Necessity analysis for combinatorial arrays, Computer Science, Arizona State University, 2011.
(co-supervised with Goran Konjevod)
- Toni R. Farley, Ph.D., Network Reliability and Resilience, Computer Science, Arizona State University, 2009.
- Dean S. Hoskins, Ph.D., Covering Arrays and Optimal Designs, Computer Science, Arizona State University, 2006.
-
Renee C. Bryce, Ph.D. Algorithms for Covering Arrays, Computer Science, Arizona State University, 2006.
- Robert A. Walker II, Ph.D., Covering arrays and perfect hash families, Computer Science, Arizona State University, 2005.
-
Robert P. Gallant, Ph.D., Tight orthogonal main effect plans, Combinatorics and Optimization,
University of Waterloo, 1997.
-
Alan C.H. Ling,
Ph.D., Pairwise balanced designs and related codes, Combinatorics and Optimization,
University of Waterloo, 1996.
-
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]
- Zhike Jiang, Ph.D., Rotational Steiner triple systems,
Combinatorics and Optimization, University of Waterloo, 1995.
-
Heidi J. Strayer, Ph.D., Bounding flows, distances and reliability in probabilistic networks, Computer Science, University of
Waterloo, 1995.
-
Doreen L. Erickson, Ph.D., Conflict-free access to parallel memory modules, Computer Science, University of Waterloo, 1993.
-
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).
-
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).
-
David C. Bigelow, Ph.D., Enclosings of latin squares and triple systems,
Pure Mathematics, University of Waterloo, 1990.
-
Anthony J. Gahlinger, Ph.D., Coherence and satisfiability of waveform
timing specifications, Computer Science,
University of Waterloo, 1990.
-
Louis D. Nel,
Ph.D., Network reliability and facility location in unreliable networks,
Computer Science, University of Waterloo, 1988.
-
Hosam M. F. AboElFotoh,
Ph.D., Reliability of radio broadcast networks: a
graph theoretic approach, Computer Science, University of
Waterloo, 1988.
-
Wendy J. Myrvold,
Ph.D., The ally and adversary reconstruction problems,
Computer Science, University of Waterloo, 1988.
-
Ehab S. El Mallah,
Ph.D., Decomposition and embedding problems for restricted
networks, Computer Science, University of Waterloo,
1987.
-
Aparna Ramanathan, Ph.D., Improving bounds for all-terminal network reliability,
Computer Science, University of Waterloo, 1986.
Master's students
- Rushang Karia, M.S. (CS),
Covering Arrays: Generation and Post-Optimization,
Computer Science and Engineering, Arizona State University, 2015.
- Devon J. O'Brien, M.S. (CS),
The Design and Analysis of Hash Families for Use in Broadcast Encryption,
Computer Science and Engineering, Arizona State University, 2012.
- Kumaraguru Paramasivam, M.S. (CS),
Correlation Based Tools for Analysis of Dynamic Networks,
Computer Science and Engineering, Arizona State University, 2011.
- Deepa R. Iyer, M.S. (CS),
Identification of Network Communities using Cocitation Analysis and Bibliographic Coupling,
Computer Science and Engineering, Arizona State University, 2008.
- Jamieson French, M.S. (CS),
A Parallel Approach for k-Nearest Neighbor Search in Metric Space,
Computer Science and Engineering, Arizona State University, 2008.
- Akhila Avirneni, M.S. (CS),
Feasibility of interaction testing for web-based forms,
Computer Science and Engineering, Arizona State University, 2007.
- 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.
- Kylan N. Johnson, M.S. (CS), Selecting reliable connections in mobile ad hoc networks, Computer Science and Engineering, Arizona State University, 2005.
- Sandhya Durvasula, M.S. (CS), Lower bounds for multiple sequence alignment, Computer Science and Engineering, Arizona State University, 2004.
- Kaushik Srinivasan, M.S. (CS), Disk recovery in double erasure RAID disk arrays, Computer Science and Engineering, Arizona State University, 2004.
- Xunshan Ma, M.S. (CS), Computational method to construct erasure resilient codes, Computer Science, University of Vermont, 1999.
- Shanon D. Place, M.S. (CS), Application of bipartite graph matching algorithms for physical therapy student internship assignments, Computer Science, University of Vermont, 1999.
- Myra B. Cohen, M.S. (CS), Performance analysis of triple erasure codes in large disk arrays, Computer Science, University of Vermont, 1999.
- Lise Arseneau,
M.Math., Optimal testing strategies for s,t-series parallel systems,
Combinatorics and Optimization, University of Waterloo, 1996.
-
Alan Ling,
M.Math., Pairwise balanced designs with consecutive
block sizes, Combinatorics and Optimization, University of Waterloo, 1995.
[Outstanding Achievement in Graduate Studies honour]
- Doreen L. Erickson, M.Math., Threshold schemes, Department of
Computer Science, University of Waterloo, 1990.
-
Yeow Meng Chee, M.Math., The basis reduction algorithm and the existence
of combinatorial designs, Computer Science,
University of Waterloo, 1989.
- H.M. Kenneth Warkentyne, M.Math., $\Delta$-Y-$\Delta$ reducible graphs,
Computer Science, University of Waterloo, 1988.
- 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).
- Brent N. Clark, M.Math. Unit disk graphs,
Computer Science, University of Waterloo, 1985.
- Timothy B. Brecht, M.Math. Lower bounds for two-terminal network reliability,
Computer Science, University of Waterloo, 1985.
- Ehab S. El-Mallah, M.Sc. Recursive graph structure and the optimum
communication spanning tree problem, Computational Science,
University of Saskatchewan, 1983.
- Daryl D. Harms, M.Sc. An investigation into bounds on network reliability,
Computational Science, University of Saskatchewan, 1983.
- Eric M. Neufeld, M.Sc. Construction of reliable series-parallel networks:
a combinatorial approach,
Computational Science, University of Saskatchewan, 1983.
- Judith B. Peachey, M.Sc. The Bradford-Zipf Distribution and Program
Behaviour, Computational Science, University of Saskatchewan,
1981 (co-supervised with R.B. Bunt).
- Adithya Raghavendra, MCS, Interaction Testing of Web Services,
Computer Science and Engineering, Arizona State University, 2006.
- Robin L. Wilcox, MCS, In Parameter Order Test Generation Strategies,
Computer Science and Engineering, Arizona State University, 2006.
- 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.
- F. David Fracchia, M.Math., F-Factors and Single Processor Scheduling,
Computer Science, University of Waterloo, 1987.
- 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.
- Katherine E. Stewart, M.Math., Computing the all-terminal reliability
exactly,
Computer Science, University of Waterloo, 1987.
- Andrea R. Chappell, M.Math. The terminal layout problem,
Computer Science, University of Waterloo, 1986.
- Louis D. Nel, M.Math. The Design and Complexity of VideoTex Cycles,
Computer Science, University of Waterloo, 1985.
- Eddy H. Carrasco, M.Math., An Implementation of a First Order and Second Order
Method for Network Reliability, Computer Science,
University of Waterloo, 1984.