Date: Tue, 10 Dec 1996 14:54:42 GMT
Server: NCSA/1.4.2
Content-type: text/html
Last-modified: Tue, 10 Sep 1996 20:06:50 GMT
Content-length: 2404
Ph.D. Students of Richard E. Ladner
Ph.D. Students of Richard E. Ladner
Current Students
-
Suzanne Bunton, On-Line Stochastic Processes in Data Compression
(Co-supervised with Gaetano Borriello)
-
James Fix, Multiresolution in Dynamic Programming
Former Students
-
Anthony LaMarca , Caches and Algorithms, June 1996
(Xerox PARC)
-
David Cohn , Separating Formal Bounds from Practical
Performance in Learning Systems, June 1992 (Harlequin, Cambridge, MA)
-
H.K. Dai, Complexity Issues in Strictly Non-Blocking Networks, January,
1991 (University of North Dakota)
-
Soma Chaudhuri,
Topics in the Theory of Distributed Computing, September,
1990 (Iowa State University)
-
Ewan Tempero, Network Protocols for non-FIFO Channels, August, 1990
(Victoria University of Wellington, New Zealand)
-
Anne Condon, Computational Models of Games,
July, 1987 (University of Wisconsin)
-
Robert J. Fowler , Decentralized Object Finding Using Forwarding
Addresses, October 1985 (Rice University)
-
Garret Swart, Efficient Algorithms for Computing
Geometric Intersections, January 1985
-
Albert Greenberg, Efficient Algorithms for
Multiple Access Channels, August 1983 (Co-supervised with Martin Tompa)
(AT&T Research)
-
Glenn Goodrich, Complexity of
Finite Languages, June 1983 (HP, Seattle)
-
Udi Manber,
Concurrency Control for Dynamic
Data Structures, August 1982 (University of Arizona)
-
Paul Frank, Bounded Nondeterminism and the
Parallel Parsing of Context-Free Languages, August 1979
(Applied Magnetics Corporation)