Some Current and Recent Graduate Students Supervised or Cosupervised by me

Name

Degree/Years

Present Position

Title of Thesis or Essay (MMath essay designated by *)

Erik Demaine

Ph.D. 1997-

Ph.D. Student

Adaptive Algorithms for Database Queries (tentative title)

Adam Storm

MMath 1998-

MMath Student

Dynamic and Succinct Tree Representations (tentative title)

Andrew Ford

MMath 1998-

MMath Student

Online Graph Algorithms (tentative title)

Darin Ohashi

MMath 1998-

MMath Student

Graph Representations (tentative title)

David Benoit

MMath 1997-98

Senior Developer, InfoInteractive, Halifax

Compact Tree Representations

Daniel Frank

MMath 1997-99

President, WoodenChair Computing, Toronto

A Lower Bound for Optimal hashing with Open Addressing

Weiye Zhang (co-supervised with P.A. Larson)

Ph. D. 1996-97

Research Scientist, Microsoft, Redmond, WA

Improving the performance of Concurrent Sorts in Database Systems

Kenneth Chupa

MMath 1996-97

IBM Lab, Toronto

Implementing Trees Succinctly*

Edwin Chung

MMath 1996-97

Hong Kong

Efficiency of Agents on the Internet*

David R. Clark

Ph.D.1993-96

Research Scientist Waterloo Maple Software, Waterloo

Efficient Pat Trees

K.-Y. Yeung

MMath:1995-96

PhD student, Univ. Washington

Finding the Loneliest Point

A.T. Lu

MMath:1994-96

City Bank, New York

Approximation Algorithms: Bin-packing, Knapsack, Vertex and Set-Covering*

A. Brodnik

PhD:1990-95

Res. Sci., J.Stefan Inst. Ljubljana, Slovenia

Searching in Constant Time and Minimum Space

Richard X. Ji

MMath:1993-95

Nortel, Calgary

On Quicksort and Heapsort*

Jing Xie

MMath:1993-95

Hypercube Inc. Waterloo

Security and Cryptography Issues in Database Systems*

Tom Papadakis

PhD:1988-93

SoftwareDevelop., Legato,Burlington, ON

Skip Lists and Probablistic Analysis of Algorithms

Alfredo Viola (co-supervised with P.V. Poblete)

PhD:1992-95

Asst. Prof., Univ. Rep. Montevideo, Uruguay

Analysis of Hashing Algorithms and a New Mathematical Transform