| 1997 | STOC | Retraction of Probabilistic Computation and Linear Time. | Lance Fortnow, Michael Sipser |
| 1994 | COLT | Inference and Minimization of Hidden Markov Chains. | David Gillman, Michael Sipser |
| 1994 | FOCS | Expander Codes | Michael Sipser, Daniel A. Spielman |
| 1994 | SODA | Optimal Constructions of Hybrid Algorithms. | Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin |
| 1992 | STOC | The History and Status of the P versus NP Question | Michael Sipser |
| 1988 | FOCS | Dynamic Networks Are as Fast as Static Networks (Preliminary Version) | Baruch Awerbuch, Michael Sipser |
| 1987 | FOCS | Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) | Oded Goldreich, Yishay Mansour, Michael Sipser |
| 1986 | STOC | Private Coins versus Public Coins in Interactive Proof Systems | Shafi Goldwasser, Michael Sipser |
| 1985 | STOC | Compression and Ranking | Andrew V. Goldberg, Michael Sipser |
| 1984 | FOCS | Graph Bisection Algorithms with Good Average Case Behavior | Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser |
| 1984 | MFCS | A Topological View of Some Problems in Complexity Theory. | Michael Sipser |
| 1983 | STOC | Borel Sets and Circuit Complexity | Michael Sipser |
| 1983 | STOC | A Complexity Theoretic Approach to Randomness | Michael Sipser |
| 1982 | ICALP | On Relativization and the Existence of Complete Sets. | Michael Sipser |
| 1982 | STOC | Communication Complexity | Christos H. Papadimitriou, Michael Sipser |
| 1981 | FOCS | Parity, Circuits, and the Polynomial-Time Hierarchy | Merrick L. Furst, James B. Saxe, Michael Sipser |
| 1981 | FOCS | Maximum Matchings in Sparse Random Graphs | Richard M. Karp, Michael Sipser |
| 1979 | STOC | Lower Bounds on the Size of Sweeping Automata | Michael Sipser |
| 1978 | FOCS | GO Is PSPACE Hard | David Lichtenstein, Michael Sipser |
| 1978 | FOCS | Halting Space-Bounded Computations | Michael Sipser |
| 1978 | STOC | Nondeterminism and the Size of Two Way Finite Automata | William J. Sakoda, Michael Sipser |
| 1977 | FOCS | Several Results in Program Size Complexity | Howard P. Katseff, Michael Sipser |