GO Is PSPACE Hard - David Lichtenstein; Michael Sipser (FOCS, 1978)

Nondeterminism and the Size of Two Way Finite Automata - William J. Sakoda; Michael Sipser (STOC, 1978)

GO Is Polynomial-Space Hard. - David Lichtenstein; Michael Sipser (J. ACM, 1980)

Lower Bounds on the Size of Sweeping Automata. - Michael Sipser (J. Comput. Syst. Sci., 1980)

Halting Space-Bounded Computations. - Michael Sipser (Theor. Comput. Sci., 1980)

Maximum Matchings in Sparse Random Graphs - Richard M. Karp; Michael Sipser (FOCS, 1981)

Several Results in Program Size Complexity. - Howard P. Katseff; Michael Sipser (Theor. Comput. Sci., 1981)

On Relativization and the Existence of Complete Sets. - Michael Sipser (ICALP, 1982)

Borel Sets and Circuit Complexity - Michael Sipser (STOC, 1983)

A Complexity Theoretic Approach to Randomness - Michael Sipser (STOC, 1983)

A Topological View of Some Problems in Complexity Theory. - Michael Sipser (MFCS, 1984)

On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals. - Barbara Simons; Michael Sipser (Oper. Res., 1984)

Communication Complexity. - Christos H. Papadimitriou; Michael Sipser (J. Comput. Syst. Sci., 1984)

Parity, Circuits, and the Polynomial-Time Hierarchy. - Merrick L. Furst; James B. Saxe; Michael Sipser (Math. Syst. Theory, 1984)

Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) - Oded Goldreich 001; Yishay Mansour; Michael Sipser (FOCS, 1987)

Graph bisection algorithms with good average case behavior. - Thang Nguyen Bui; Soma Chaudhuri; Frank Thomson Leighton; Michael Sipser (Comb., 1987)

On the power of multi-power interactive protocols. - Lance Fortnow; John Rompel; Michael Sipser (SCT, 1988)

Dynamic Networks Are as Fast as Static Networks (Preliminary Version) - Baruch Awerbuch; Michael Sipser (FOCS, 1988)

Are There Interactive Protocols for CO-NP Languages? - Lance Fortnow; Michael Sipser (Inf. Process. Lett., 1988)

Expanders, Randomness, or Time versus Space. - Michael Sipser (J. Comput. Syst. Sci., 1988)

On Completeness and Soundness in Interactive Proof Systems. - Martin Fürer; Oded Goldreich 001; Yishay Mansour; Michael Sipser; Stathis Zachos (Adv. Comput. Res., 1989)

Private Coins versus Public Coins in Interactive Proof Systems. - Shafi Goldwasser; Michael Sipser (Adv. Comput. Res., 1989)

The Complexity of Finite Functions. - Ravi B. Boppana; Michael Sipser (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

Errata for On the Power of Multi-Prover Interactive Protocols. - Lance Fortnow; John Rompel; Michael Sipser (SCT, 1990)

Monotone Separation of Logspace from NC. - Michelangelo Grigni; Michael Sipser (SCT, 1991)

Compression and Ranking. - Andrew V. Goldberg; Michael Sipser (SIAM J. Comput., 1991)

The History and Status of the P versus NP Question - Michael Sipser (STOC, 1992)

Inference and Minimization of Hidden Markov Chains. - David Gillman; Michael Sipser (COLT, 1994)

On the Power of Multi-Prover Interactive Protocols. - Lance Fortnow; John Rompel; Michael Sipser (Theor. Comput. Sci., 1994)

Monotone Separation of Logarithmic Space from Logarithmic Depth. - Michelangelo Grigni; Michael Sipser (J. Comput. Syst. Sci., 1995)

The future of computational complexity theory: part I. - Christos H. Papadimitriou; Oded Goldreich 001; Avi Wigderson; Alexander A. Razborov; Michael Sipser (SIGACT News, 1996)

Introduction to the Theory of Computation. - Michael Sipser (SIGACT News, 1996)

Expander codes. - Michael Sipser; Daniel A. Spielman (IEEE Trans. Inf. Theory, 1996)

Introduction to the theory of computation. - Michael Sipser (PWS Publishing Company, 1997)

Retraction of Probabilistic Computation and Linear Time. - Lance Fortnow; Michael Sipser (STOC, 1997)

Optimal Constructions of Hybrid Algorithms. - Ming-Yang Kao; Yuan Ma; Michael Sipser; Yiqun Lisa Yin (J. Algorithms, 1998)

AC0 Pseudorandomness of Natural Operations. - Zachary Remscrim; Michael Sipser (Electron. Colloquium Comput. Complex., 2013)