Lane A. Hemaspaandra

Lane A. Hemaspaandra

  • Professor of Computer Science

PhD, Cornell University, 1987

2317 Wegmans Hall
lane "at"



Education (Details)
Editorial Positions
Research Projects
Other Items (e.g., Adirondack 46er!


  • 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.
  • SIGACT Distinguished Service Prize, 2013.

Research Overview

Lane A. Hemaspaandra (BS Yale, MS Stanford, PhD Cornell) is the recipient of an NSF Presidential Young Investigator Award and the Alexander von Humboldt Foundation's Bessel Research Award, and is an ACM Distinguished Scientist. Lane's research interests include computational social choice theory, complexity, and algorithms. He and his collaborators have collapsed the strong exponential-time hierarchy, found the exact complexity of Lewis Carroll's 1876 election system, and constructed election systems that computationally resist all standard attacks. Lane has coauthored the books The Complexity Theory Companion and Theory of Semi-Feasible Algorithms and over one hundred book chapters and refereed journal papers, and holds many editorial positions.

Research Interests

  • Computational social choice (elections, preference aggregation, power indices, etc.)
  • Computational complexity theory (counting-based computation, probabilistic computation, unambiguous computation, the importance of query order when accessing databases, the study of efficient algorithms for complex sets, complexity-theoretic aspects of security, fault-tolerance, and data compression, etc.)