📄 http:^^www.cs.washington.edu^homes^ladner^students.html
字号:
Date: Tue, 10 Dec 1996 14:54:42 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Tue, 10 Sep 1996 20:06:50 GMTContent-length: 2404<html><head><TITLE>Ph.D. Students of Richard E. Ladner</TITLE></head><body><h2>Ph.D. Students of Richard E. Ladner</h2><h3>Current Students</h3><ul><li><b>Suzanne Bunton</b>, On-Line Stochastic Processes in Data Compression(Co-supervised with Gaetano Borriello)<li> <!WA0><a href="http://www.cs.washington.edu/homes/fix/"> <b> James Fix</b></a>, Multiresolution in Dynamic Programming</ul><h3> Former Students</h3><ul><li> <!WA1><a href="http://www.cs.washington.edu/homes/lamarca"> <b> Anthony LaMarca</b> </a>, Caches and Algorithms, June 1996 (Xerox PARC)<li><!WA2><a href="http://www.ai.mit.edu/people/cohn/cohn.html"><b> David Cohn</b> </a>, Separating Formal Bounds from PracticalPerformance in Learning Systems, June 1992 (Harlequin, Cambridge, MA)<li> <!WA3><a href ="http://www.cs.und.nodak.edu/Dai1.html"><b> H.K. Dai</b></a>, Complexity Issues in Strictly Non-Blocking Networks, January,1991 (University of North Dakota)<li><!WA4><a href="http://www.cs.iastate.edu:80/~chaudhur/homepage.html"> <b> Soma Chaudhuri</b></a>, Topics in the Theory of Distributed Computing, September,1990 (Iowa State University)<li> <!WA5><a href = "http://www.comp.vuw.ac.nz/Staff/Ewan-Tempero.html"><b> Ewan Tempero</b></a>, Network Protocols for non-FIFO Channels, August, 1990(Victoria University of Wellington, New Zealand)<li><!WA6><a href=" http://www.cs.wisc.edu/~pubs/faculty-info/condon.html"><b> Anne Condon</b></a>, Computational Models of Games,July, 1987 (University of Wisconsin)<li><!WA7><a href="http://www.cs.rice.edu/~rjf/"> <b> Robert J. Fowler</b> </a>, Decentralized Object Finding Using Forwarding Addresses, October 1985 (Rice University)<li> <b> Garret Swart</b>, Efficient Algorithms for ComputingGeometric Intersections, January 1985 <li> <!WA8><a href = "http://akpublic.research.att.com/cgi-bin/find_person"><b> Albert Greenberg</b></a>, Efficient Algorithms forMultiple Access Channels, August 1983 (Co-supervised with Martin Tompa)(AT&T Research)<li> <b> Glenn Goodrich</b>, Complexity ofFinite Languages, June 1983 (HP, Seattle)<li><!WA9><a href="http://glimpse.cs.arizona.edu/udi.html"> <b> Udi Manber</b></a>, Concurrency Control for Dynamic Data Structures, August 1982 (University of Arizona)<li> <b> Paul Frank</b>, Bounded Nondeterminism and theParallel Parsing of Context-Free Languages, August 1979(Applied Magnetics Corporation)</ul></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -