Michael Sipser

Known as: Michael Fredric Sipser, Sipser 
Michael Fredric Sipser (born September 17, 1954) is a theoretical computer scientist who has made early contributions to computational complexity… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2018
05101519792018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
We present computationally efficient error-correcting codes and holographic proofs. Our error-correcting codes are asymptotically… (More)
  • figure 1-1
  • figure 2-1
  • figure 2-3
  • figure 2-4
  • figure 3-1
Is this relevant?
2007
2007
We consider the problem of computing the order of an element in a generic group. The two standard algorithms, Pollard’s rho… (More)
  • table 4.1
  • table 4.2
  • table 4.3
  • table 6.1
  • table 7.1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Fortnow, L., J. Rompel, M. Sipser, On the power of multi-prover interactive protocols, Theoretical Computer Science 134 (1994… (More)
Is this relevant?
1997
1997
However technical problems have developed in the details of the proof. After unsuccessful attempts to repair the construction, we… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Searching for a goal is a central and extensively studied problem in computer science. In classical searching problems, the cost… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
 
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by “crossing… (More)
  • figure 2
  • figure 1
  • figure 4
Is this relevant?
Highly Cited
1983
Highly Cited
1983
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Establishing good lower bounds on the complexity of languages is an important area of current research in the theory of… (More)
Is this relevant?