Ph.D. Students of Richard E. Ladner

Current Students

• Sangyun Hahn, Natural Language Processing and Machine Learning (co-supervised with Mari Ostendorf)
• Neva Cherniavsky MobileASL Project (co-supervised with Eve Riskin)
• Anna Cavender MobileASL and DHH Cyber-Community Projects
• Jeff Bigham WebInSight Project
• Chadrika Jayant Math and Image Accessibility
• Rahul Vanam MobileASL Project (co-supervised with Eve Riskin)

Former Students

• Tammy VanDeGrift, Scheduling Protocols for Media-on-Demand Systems, June 2005 (University of Portland, Portland, Oregon)
• Justin Goshi, Efficient and Secure Media Delivery, September 2004 (Microsoft)
• James Fix, Analysis of Cache Performance, March 2002 (Reed College, Portland, Oregon)
• Ed Hong, Group Testing for Image Compression, December 2001, (University of Washington, Tacoma Branch)
• Suzanne Bunton, On-Line Stochastic Processes in Data Compression, December 1996 (Co-supervised with Gaetano Borriello)
• Anthony LaMarca , Caches and Algorithms, June 1996 (Intel Labs, Seattle)
• David Cohn , Separating Formal Bounds from Practical Performance in Learning Systems, June 1992 (Google)
• H.K. Dai, Complexity Issues in Strictly Non-Blocking Networks, January, 1991 (Oklahoma State University)
• Soma Chaudhuri, Topics in the Theory of Distributed Computing, September, 1990 (Iowa State University)
• Ewan Tempero, Network Protocols for non-FIFO Channels, August, 1990 (University of Auckland, New Zealand)
• Anne Condon, Computational Models of Games, July, 1987 (University of British Columbia)
• Robert J. Fowler , Decentralized Object Finding Using Forwarding Addresses, October 1985 (Rice University)
• Garret Swart, Efficient Algorithms for Computing Geometric Intersections, January 1985 (IBM Research, Almaden)
• Albert Greenberg, Efficient Algorithms for Multiple Access Channels, August 1983 (Co-supervised with Martin Tompa) (Microsoft Research)
• Glenn Brooks, Complexity of Finite Languages, June 1983
• Udi Manber, Concurrency Control for Dynamic Data Structures, August 1982 (Google)
• Paul Frank, Bounded Nondeterminism and the Parallel Parsing of Context-Free Languages, August 1979 (Information Storage Industry Consortium)