 The professors Hemaspaandra
(Edith of RIT-CS, left; Lane of URCS, right) in the Stratford Shakespeare Festival's costume warehouse
|
|
Lane A. Hemaspaandra
Note: Pre-marriage name = Lane A. Hemachandra.
Professor
Computer Science Department
University of Rochester
Rochester, NY 14627-0226
Email: ID = lane DOMAIN = cs.rochester.edu
Phone +1-585-275-1203 Fax +1-585-273-4556
|
B.S. (summa cum laude),
Yale University, Computer Science and Mathematics & Physics, 1981.
M.S.,
Stanford University, Computer Science, 1982.
Ph.D.,
Cornell University, Computer Science, 1987.
Lane's
interests include
computational social choice theory, algorithms and complexity theory, and
algorithmic game theory.
- Fannie and John Hertz Foundation Fellowship, 1982-1987.
-
NSF
Research Initiation Award, 1988-1990.
-
NSF
Presidential Young Investigator, 1989-1995.
-
Bridging Fellow (Political Science), University of Rochester, 1994.
-
JSPS (Japan Society for the Promotion of Science) Invitational Fellow, 2005.
-
Friedrich Wilhelm Bessel Research Award, Alexander von Humboldt Foundation, 2006. (Photo of Lane receiving the award from Humboldt Foundation president, Dr. Wolfgang Fruehwald, June, 2007.)
-
ACM Distinguished Scientist,
2007-... .
- Edward Peck Curtis Award for Excellence in Undergraduate
Teaching (University of Rochester's university-wide
award for undergraduate teaching), 2012.
Ph.D.s and Postdocs Advised:
- Lane is an
Adirondack 46er
; Lane
and his wife Edith
climbed all 46 together.
-
Color
slides from Lane's Talk on Lewis Carroll's 1876 Election System
-
Color
presentation (powerpoint) made by Christopher Homan on his paper with Lane on Heuristics for Lewis Carroll's 1876 Election System
-
Web
presentation made by Christopher Homan about the paper
"Power Balance and Apportionment Algorithms for the United States Congress,"
L. Hemaspaandra, K. Rajasethupathy,
P. Sethupathy, and M. Zimand,
ACM Journal of Experimental Algorithmics,
V. 3,
#1, August 1998.
-
TheoryCanal: The Rochester-Area Theory Seminar Series
- Posters describing research done by the Lane and his students/collaborators:
- The Complexity of Bribery in Elections: view it
as powerpoint.
- Guarantees for the Success Frequency of an Algorithm
for Finding Dodgson-Election Winners: view it
as powerpoint.
-
Politics Good, Computation Bad
(by Chris Homan about our group's Power Index work): view it
as pdf.
- One-Way Functions and Cryptography: view it
as powerpoint.
- Rice-Style Theorems in Complexity Theory: view it
as powerpoint.
-
Theoretical Computer Science Research at URCS
-
A wonderful picture, taken by Yuan Sun in October 2002, of the waterfalls and leaves at
Letchworth State Park near Rochester.
-
My student Mayur Thakur's March 15, 2004 Hour-Long Job Talk at University of Missouri at Rolla, Where He Became an Assistant Professor (Warnings: This is a .rm video, and seems to (on my mac) only work if one has RealOne Player and puts it into Theatre or Full-Screen mode; otherwise one doesn't seem to get the
picture at all. Also, though the sound starts right away, the
picture of Mayur starts only 66 seconds into this one hour video.)
-
Carlson Library CS Resources Page
-
Numbers Are Magic and Fun
- The Wisdom of Juris Hartmanis (from Upson's Familiar Quotations,
4th Ed.), pages:
1,
2, and
3; special bonus: see
a great man and a statue
- The Wisdom of John Hopcroft (from Upson's
Familiar Quotations, 4th Ed.).
- The Wisdom of George Polya.
Back
to URCS Faculty directory
Back
to URCS Home Page
Last modified:
April 25, 2013.
|