Lane A. Hemaspaandra

Lane A. Hemaspaandra (formerly Hemachandra) is a Professor at the Department of Computer Science, University of Rochester, New York. His academic career spans over three decades, with research focusing on computational complexity theory (especially structural complexity) and computational social choice theory. He holds a Ph.D. in Computer Science from Cornell University (1987) and has been recognized with prestigious awards such as the Friedrich Wilhelm Bessel Research Award from the Alexander von Humboldt Foundation and NSF Presidential Young Investigator (1989–1995).

• Education:
  • B.S. in Computer Science and Mathematics & Physics, Yale University (1981)
  • M.S. in Computer Science, Stanford University (1982)
  • M.S. in Computer Science, Cornell University (1984)
  • Ph.D. in Computer Science, Cornell University (1987)

Hemaspaandra's research bridges theoretical computer science with political science and economics, particularly analyzing the computational complexity of election systems. His work includes foundational studies on Carroll/Dodgson voting, control complexity, and manipulative attacks in single-peaked societies. He has pioneered the use of complexity as a shield against election manipulation and control.

The 15 most recent articles (2021–2024) span topics like backbone opacity, electoral control dichotomies, iterative constant-setting for complexity, and online bribery in sequential elections. These works often intersect with parameterized complexity, multi-agent systems, and game-theoretic models.

Scientific Awards:

• AAAI Senior Member (2020–...)
• ACM Distinguished Scientist (2007–...)
• Alexander von Humboldt Foundation Renewed Research Stay (2018–2019)
• SIGACT Distinguished Service Prize (2013)
• Edward Peck Curtis Award for Undergraduate Teaching (2012)
• Hertz Foundation Fellowship (1982–1987)

He has advised 15 Ph.D. students and postdocs, including prominent researchers like Prof. Piotr Faliszewski (AGH University) and Dr. Curtis Menton (Google). His NSF-funded projects explore complexity-theoretic approaches to election systems, and he has collaborated with institutions in Germany, Japan, and Poland.