Michael Fredric Sipser (born September 17, 1954) is a theoretical computer scientist who has made early contributions to computational complexityâ€¦Â (More)

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)

Is this relevant?

2007

2007

- Andrew V. Sutherland, Michael Sipser, Alar Toomre
- 2007

We consider the problem of computing the order of an element in a generic group. The two standard algorithms, Pollardâ€™s rhoâ€¦Â (More)

Is this relevant?

2003

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

- Lance Fortnow, Michael Sipser
- STOC
- 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

- Ming-Yang Kao, John H. Reif, Stephen R. Tate
- SODA
- 1993

Searching for a goal is a central and extensively studied problem in computer science. In classical searching problems, the costâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1983

Highly Cited

1983

- Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
- STOC
- 1983

Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by “crossingâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Clemens Lautemann
- Inf. Process. Lett.
- 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

- Michael Sipser
- STOC
- 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?