Michael Sipser is a Professor and Chairman of Applied Mathematics. He received his Ph.D. from the University of California/Berkeley in1979 under the guidance of Manuel Blum, and has been on the faculty of MIT in the department of mathematics since 1980. Sipser's research interests are in theoretical computer science. He is recognized for his work on complexity theory, automata and language theory, and algorithms. He is the author of the widely used textbook, Introduction to the Theory of Computation. His published research spans several areas, including efficient error correcting codes, combinatorial algorithms, interactive proof systems, and establishing the inherent computational difficulty of problems
- E. Farhi, J. Goldstone, J. Gutmann, M. Sipser, "A limit on the speed of quantum computation in determining parity," to appear.
- D. Spielman and M. Sipser, "Expander codes,"IEEE Transactions on Information Theory, vol 42, no 6, pp 1710--1722, 1996.
- M. Sipser, "The History and Status of the P versus NP Question," Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, invited paper