| 2008 |
|---|
| 43 | | Zoran Majkic,
Michael Sipser,
R. Radha,
Daming Wei:
International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS-08, Orlando, Florida, USA, July 7-10, 2008
ISRST 2008 |
| 2001 |
|---|
| 42 | EE | Ming-Yang Kao,
Yuan Ma,
Michael Sipser,
Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms
CoRR cs.DM/0101028: (2001) |
| 1998 |
|---|
| 41 | | Ming-Yang Kao,
Yuan Ma,
Michael Sipser,
Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms.
J. Algorithms 29(1): 142-164 (1998) |
| 1997 |
|---|
| 40 | EE | Lance Fortnow,
Michael Sipser:
Retraction of Probabilistic Computation and Linear Time.
STOC 1997: 750 |
| 1996 |
|---|
| 39 | | Michael Sipser,
Daniel A. Spielman:
Expander codes.
IEEE Transactions on Information Theory 42(6): 1710-1722 (1996) |
| 1995 |
|---|
| 38 | | Michelangelo Grigni,
Michael Sipser:
Monotone Separation of Logarithmic Space from Logarithmic Depth.
J. Comput. Syst. Sci. 50(3): 433-437 (1995) |
| 1994 |
|---|
| 37 | EE | David Gillman,
Michael Sipser:
Inference and Minimization of Hidden Markov Chains.
COLT 1994: 147-158 |
| 36 | | Michael Sipser,
Daniel A. Spielman:
Expander Codes
FOCS 1994: 566-576 |
| 35 | | Ming-Yang Kao,
Yuan Ma,
Michael Sipser,
Yiqun Lisa Yin:
Optimal Constructions of Hybrid Algorithms.
SODA 1994: 372-381 |
| 34 | | Lance Fortnow,
John Rompel,
Michael Sipser:
On the Power of Multi-Prover Interactive Protocols.
Theor. Comput. Sci. 134(2): 545-557 (1994) |
| 1992 |
|---|
| 33 | | Michael Sipser:
The History and Status of the P versus NP Question
STOC 1992: 603-618 |
| 1991 |
|---|
| 32 | | Michelangelo Grigni,
Michael Sipser:
Monotone Separation of Logspace from NC.
Structure in Complexity Theory Conference 1991: 294-298 |
| 31 | | Andrew V. Goldberg,
Michael Sipser:
Compression and Ranking.
SIAM J. Comput. 20(3): 524-536 (1991) |
| 1990 |
|---|
| 30 | | Lance Fortnow,
John Rompel,
Michael Sipser:
Errata for On the Power of Multi-Prover Interactive Protocols.
Structure in Complexity Theory Conference 1990: 318-319 |
| 29 | | Ravi B. Boppana,
Michael Sipser:
The Complexity of Finite Functions.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 757-804 |
| 1989 |
|---|
| 28 | | Lance Fortnow,
Michael Sipser:
Probabilistic Computation and Linear Time
STOC 1989: 148-156 |
| 1988 |
|---|
| 27 | | Baruch Awerbuch,
Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version)
FOCS 1988: 206-220 |
| 26 | | Lance Fortnow,
Michael Sipser:
Are There Interactive Protocols for CO-NP Languages?
Inf. Process. Lett. 28(5): 249-251 (1988) |
| 25 | | Michael Sipser:
Expanders, Randomness, or Time versus Space.
J. Comput. Syst. Sci. 36(3): 379-383 (1988) |
| 1987 |
|---|
| 24 | | Oded Goldreich,
Yishay Mansour,
Michael Sipser:
Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)
FOCS 1987: 449-461 |
| 23 | | Thang Nguyen Bui,
Soma Chaudhuri,
Frank Thomson Leighton,
Michael Sipser:
Graph bisection algorithms with good average case behavior.
Combinatorica 7(2): 171-191 (1987) |
| 1986 |
|---|
| 22 | | Shafi Goldwasser,
Michael Sipser:
Private Coins versus Public Coins in Interactive Proof Systems
STOC 1986: 59-68 |
| 21 | | Michael Sipser:
Expanders, Randomness, or Time versus Space.
Structure in Complexity Theory Conference 1986: 325-329 |
| 1985 |
|---|
| 20 | | Andrew V. Goldberg,
Michael Sipser:
Compression and Ranking
STOC 1985: 440-448 |
| 1984 |
|---|
| 19 | | Thang Nguyen Bui,
Soma Chaudhuri,
Frank Thomson Leighton,
Michael Sipser:
Graph Bisection Algorithms with Good Average Case Behavior
FOCS 1984: 181-192 |
| 18 | | Michael Sipser:
A Topological View of Some Problems in Complexity Theory.
MFCS 1984: 567-572 |
| 17 | | Christos H. Papadimitriou,
Michael Sipser:
Communication Complexity.
J. Comput. Syst. Sci. 28(2): 260-269 (1984) |
| 16 | | Merrick L. Furst,
James B. Saxe,
Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy.
Mathematical Systems Theory 17(1): 13-27 (1984) |
| 1983 |
|---|
| 15 | | Michael Sipser:
A Complexity Theoretic Approach to Randomness
STOC 1983: 330-335 |
| 14 | | Michael Sipser:
Borel Sets and Circuit Complexity
STOC 1983: 61-69 |
| 1982 |
|---|
| 13 | | Michael Sipser:
On Relativization and the Existence of Complete Sets.
ICALP 1982: 523-531 |
| 12 | | Christos H. Papadimitriou,
Michael Sipser:
Communication Complexity
STOC 1982: 196-200 |
| 1981 |
|---|
| 11 | | Merrick L. Furst,
James B. Saxe,
Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy
FOCS 1981: 260-270 |
| 10 | | Richard M. Karp,
Michael Sipser:
Maximum Matchings in Sparse Random Graphs
FOCS 1981: 364-375 |
| 9 | | Howard P. Katseff,
Michael Sipser:
Several Results in Program Size Complexity.
Theor. Comput. Sci. 15: 291-309 (1981) |
| 1980 |
|---|
| 8 | EE | David Lichtenstein,
Michael Sipser:
GO Is Polynomial-Space Hard.
J. ACM 27(2): 393-401 (1980) |
| 7 | | Michael Sipser:
Lower Bounds on the Size of Sweeping Automata.
J. Comput. Syst. Sci. 21(2): 195-202 (1980) |
| 6 | | Michael Sipser:
Halting Space-Bounded Computations.
Theor. Comput. Sci. 10: 335-338 (1980) |
| 1979 |
|---|
| 5 | | Michael Sipser:
Lower Bounds on the Size of Sweeping Automata
STOC 1979: 360-364 |
| 1978 |
|---|
| 4 | | David Lichtenstein,
Michael Sipser:
GO Is PSPACE Hard
FOCS 1978: 48-54 |
| 3 | | Michael Sipser:
Halting Space-Bounded Computations
FOCS 1978: 73-74 |
| 2 | | William J. Sakoda,
Michael Sipser:
Nondeterminism and the Size of Two Way Finite Automata
STOC 1978: 275-286 |
| 1977 |
|---|
| 1 | | Howard P. Katseff,
Michael Sipser:
Several Results in Program Size Complexity
FOCS 1977: 82-89 |
