Lane Hemaspaandra, PhD

Lane Hemaspaandra is professor of Computer Science at the University of Rochester, where his research focuses on computational complexity theory and the study of the difficulty of computational problems. Hemaspaandra earned his undergraduate degree from Yale University before completing his Ph.D. in computer science at Cornell University, where his fellowship began in 1982. His research has produced foundational results in complexity theory, including contributions to the theory of #P-completeness, NP-search, and the structural properties of counting complexity classes. He is a prolific author whose monographs and textbooks have shaped the field.