Michael Sipser

Professor of Applied Mathematics and Head of Mathematics Department. Founder of modern complexity theory as it is pursued today. Work includes lower bounds on the complexity of Boolean functions in restricted computational models, derandomization methods to establish the relationship between deterministic and randomized complexity classes, the use of expander graphs for randomness enhancement and error correcting codes analysis, the complexity of interactive proofs in single-prover and multi-prover models, and quantum computation by adiabatic evolution.