Go home now Header Background Image
Submission Procedure
share: |
Follow us

Lane A. Hemaspaandra

Referee for: F.1, F.2.3, F.4.1
Institution: University of Rochester
Address: Department of Computer Science
University of Rochester
Rochester, NY 14627
Home Page: http://www.cs.rochester.edu/users/faculty/lane/

Curriculum Vitae:

Born in New York City, NY, USA. Ph.D. (Computer Science), Cornell University, 1987; M.S. (Computer Science), Stanford University, 1982; B.S. (Mathematics & Physics and Computer Science), Yale University, 1981. Lane Hemaspaandra first did research in computational complexity theory at Cornell, where he wrote his Ph.D. thesis under the direction of Professor Juris Hartmanis. In 1987, he joined the faculty of Columbia University as an assistant professor. In 1988 he was awarded an NSF Research Initiation Award and in 1989 he was named an NSF Presidential Young Investigator. In 1989, he moved to the University of Rochester, where he now is a professor of computer science. He is a member of the editorial boards of Computational Complexity, Information Processing Letters, and the Journal for Universal Computer Science, and is a founding editor of the Journal of Computing and Information.

Lane A. Hemaspaandra is the author of over one hundred and fifty books, book chapters, journal papers, and reviews. He has contributed invited papers and invited talks to numerous international conferences, and has contributed to over ninety conferences and workshops. He has served as a referee for a wide range of journals and publishing companies, and as a program committees member for many international conferences. He regularly reviews theoretical computer science articles and books for Mathematical Reviews and for ACM Computing Reviews. He is currently the complexity theory columnist for SIGACT News and the computational complexity area moderator for the ACM Computing Research Repository.

Research visitors from China, Germany, Italy, Japan, the Netherlands, Russia, and Spain have visited Lane Hemaspaandra in Rochester, supported by grants from the NSF, the National Academy of Sciences, the JSPS, the CIES (Fulbright Scholar Program), the NWO, the DAAD, the DFG, the Ministero della Pubblica Istruzione, and the Chinese government.

Main Research Interests:

  • computational complexity theory
  • quantum computing
  • probabilistic computation
  • approximate computation
  • heuristic algorithms
  • algorithms from complexity
  • simulated annealing algorithms
  • fault-tolerance
  • data compression
  • cryptography
  • circuit theory
  • query order
  • inherent complexity of inverse problems
  • overhead-free computation on large objects
  • complexity of network structure recovery problems
  • security
  • semi-feasible computation
  • computational politics