Michael Sipser

Q: What Schools Are Affiliated With Michael Sipser

Michael Sipser is affiliated with the following schools: University of California, Berkeley, Massachusetts Institute of Technology, Cornell University

Michael Sipser's AcademicInfluence.com Rankings

Michael Sipser

Mathematics

#448

World Rank

#888

Historical Rank

#202

USA Rank

Measure Theory

#2473

World Rank

#2973

Historical Rank

#698

USA Rank

mathematics Degrees

Download Badge

Mathematics

Michael Sipser's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics Cornell University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Michael Sipser Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael Fredric Sipser 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.

(See a Problem?)

Michael Sipser's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to the Theory of Computation (1996) (1758)
Quantum Computation by Adiabatic Evolution (2000) (1223)
Parity, circuits, and the polynomial-time hierarchy (1981) (1155)
Expander codes (1994) (933)
Private coins versus public coins in interactive proof systems (1986) (548)
A complexity theoretic approach to randomness (1983) (482)
Graph bisection algorithms with good average case behavior (1984) (390)
The Complexity of Finite Functions (1991) (333)
On the Power of Multi-Prover Interactive Protocols (1994) (249)
Maximum Matchings in Sparse Random Graphs (1981) (222)
Borel sets and circuit complexity (1983) (217)
The history and status of the P versus NP question (1992) (183)
GO Is Polynomial-Space Hard (1980) (169)
Nondeterminism and the size of two way finite automata (1978) (164)
Maximum matching in sparse random graphs (1981) (158)
Limit on the Speed of Quantum Computation in Determining Parity (1998) (154)
Expanders, Randomness, or Time versus Space (1988) (140)
On the power of multi-power interactive protocols (1988) (123)
Halting space-bounded computations (1978) (120)
Compression and ranking (1985) (110)
On Completeness and Soundness in Interactive Proof Systems (1989) (104)
Lower bounds on the size of sweeping automata (1979) (99)
Are There Interactive Protocols for CO-NP Languages? (1988) (89)
Dynamic networks are as fast as static networks (1988) (82)
On Relativization and the Existence of Complete Sets (1982) (80)
Optimal constructions of hybrid algorithms (1994) (78)
Computationally efficient error-correcting codes and holographic proofs (1995) (66)
Communication complexity (1982) (65)
Interactive proof systems: Provers that never fail and random selection (1987) (63)
Introduction to the Theory of Computation: Preliminary Edition (1996) (54)
Monotone complexity (1992) (45)
Invariant quantum algorithms for insertion into an ordered list (1999) (44)
Monotone Separation of Logarithmic Space from Logarithmic Depth (1995) (39)
GO is pspace hard (1978) (30)
Monotone Separation of Logspace from NC. (1991) (29)
A Topological View of Some Problems in Complexity Theory (1984) (29)
Inference and minimization of hidden Markov chains (1994) (28)
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals (1984) (28)
Bound on the number of functions that can be distinguished with k quantum queries (1999) (26)
A Limit on the Speed of Quantum Computation for Insertion into an Ordered List (1998) (24)
Probabilistically checkable proofs and the testing of hadamard-like codes (1996) (17)
Probabilistic computation and linear time (1989) (17)
Boolean Function Complexity: Monotone Complexity (1992) (12)
Structure in monotone complexity (1991) (10)
Several results in program size complexity (1977) (9)
The future of computational complexity theory: part I (1996) (7)
Teaching, learning and exploration (1994) (6)
Monotone separation of logspace from NC/sup 1/ (1991) (6)
Retraction of probabilistic computation and linear time (1997) (6)
Frequency of dizygotic twinning (1986) (3)
AC0 Pseudorandomness of Natural Operations (2013) (0)
Teaching , Learning , and Exploration by Yiqun Yin (0)
Grigni: [4] Monotone Complexity (1990) (0)
Standard Fm Mbc Rw-st Benchmark Size Areas Net Cut Areas Net Cut (0)
Table 1: Output from Ig-match Algorithm, Com- Pared with Results from the Rcut1.0 Program of Wei and Cheng. 5 Conclusions (1992) (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : January 1 , 2001 – June 30 , 2001 (2000) (0)
Editor's ForewordEDITOR'S FOREWORD (1997) (0)
VLSI Design, Parallel Computation and Distributed Computing (1991) (0)
International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS-08, Orlando, Florida, USA, July 7-10, 2008 (2008) (0)
Graph Bisection AlgoriLhrns With Good A-veragc Case Behavior (1984) (0)
Introduction To The Theory Of Computation By Michael Sipser (2004) (0)
18.404J / 6.840J Theory of Computation, Fall 2002 (2002) (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 2000 — December 31 , 2000 (1999) (0)
Complexity Theory and Elementary Mathematics. (1980) (0)
lJ.AXIMUMMATCHINGS IN SPARSE RANDOM GRAPHS (1981) (0)
J an 2 00 0 Quantum Computation by Adiabatic Evolution (2000) (0)
Research in Cryptography , Information Security and Algorithm Development 9807-12 & 26 Progress Report : July 1 , 1999 — December 31 , 1999 (2000) (0)
9807-12 & 26 Research in Cryptography , Information Security and Algorithm Development (2000) (0)

This paper list is powered by the following services:

Other Resources About Michael Sipser

What Schools Are Affiliated With Michael Sipser?

Michael Sipser is affiliated with the following schools:

Michael Sipser's Academic­Influence.com Rankings