American theoretical computer scientist (born 1954)
Michael Sipser
Born
Michael Fredric Sipser
(1954-09-17) September 17, 1954 (age 69)
Brooklyn, New York
Nationality
American
Alma mater
Cornell University
University of California at Berkeley
Awards
Fellow, American Academy of Arts and Sciences
Fellow, American Mathematical Society
Fellow, Association for Computing Machinery
Scientific career
Fields
Mathematics
Computer Science
Institutions
MIT
Thesis
Nondeterminism and the Size of Two-Way Finite Automata (1980)
Doctoral advisor
Manuel Blum
Doctoral students
Lance Fortnow
Sofya Raskhodnikova
Leonard Schulman
Daniel Spielman
Andrew Sutherland
Yiqun Lisa Yin
Website
math.mit.edu/~sipser/
Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the dean of science at the Massachusetts Institute of Technology.
Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity...
(ISBN 0-534-95097-3) is a textbook in theoretical computer science, written by MichaelSipser and first published by PWS Publishing in 1997. Introduction to Automata...
generate; in such a way to the Chomsky hierarchy of languages is obtained. MichaelSipser (2013). Introduction to the Theory of Computation 3rd. Cengage Learning...
by Håstad (1998). In the early 1980s, Merrick Furst, James Saxe and MichaelSipser and independently Miklós Ajtai established super-polynomial lower bounds...
Computer Algorithms. Reading/MA: Addison-Wesley. ISBN 0-201-00029-6. MichaelSipser (1997). Introduction to the Theory of Computation. Boston/MA: PWS Publishing...
Wisconsin-Madison. Archived (PDF) from the original on 2021-07-19. Sipser, Michael (2006). Introduction to the theory of computation (2nd ed.). Boston:...
a doctorate in applied mathematics from MIT in 1989, supervised by MichaelSipser. Since graduation, he has been on the faculty of the University of Chicago...
1137/0218012. ISSN 1095-7111. Extended abstract Shafi Goldwasser and MichaelSipser. Private coins versus public coins in interactive proof systems. Proceedings...
Impagliazzo, Silvio Micali, Gary Miller, Moni Naor, Steven Rudich, MichaelSipser, Ronitt Rubinfeld, Umesh Vazirani, Vijay Vazirani, Luis von Ahn, and...
PCP cannot be decidable either. The following discussion is based on MichaelSipser's textbook Introduction to the Theory of Computation. In more detail...
and Computation (2nd ed.). Pearson Education. ISBN 978-0-201-44124-6. MichaelSipser (1997). Introduction to the Theory of Computation. PWS Publishing....
complement. Recursively enumerable language Computable set Recursion MichaelSipser (1997). "Decidability". Introduction to the Theory of Computation. PWS...
1007/978-3-642-20712-9_27. ISBN 978-3-642-20711-2. ISSN 0302-9743. MichaelSipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 0-534-94728-X...
1987, original McGraw-Hill edition 1967, ISBN 0-262-68052-1 (pbk.) MichaelSipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 0-534-94728-X...
Computer Science. 11 (1): 71–77. doi:10.1016/0304-3975(80)90037-7. MichaelSipser (1997). Introduction to the Theory of Computation. PWS Publishing. ISBN 0-534-94728-X...
computational learning theory and online algorithms; it was supervised by MichaelSipser. She worked as a researcher at RSA Laboratories from 1994 to 1999, and...
undecidable. MichaelSipser (1997). Introduction to the Theory of Computation. PWS Publishing. p. 102. ISBN 0-534-94728-X. Soltys-kulinicz, Michael (2018)....
1995, Florence Italy), Computability and Recursion), on the web at ??. MichaelSipser, (2006), Introduction to the Theory of Computation: Second Edition,...
distribution of the primes] (in German). Leipzig: B.G. Teubner. p. 31. MichaelSipser (1997). Introduction to the Theory of Computation. Boston/MA: PWS Publishing...
depth-first search. The following proof is due to David Lichtenstein and MichaelSipser. To establish the PSPACE-hardness of GG, we can reduce the FORMULA-GAME...
Global Information