Michael Sipser

8.5k total citations · 2 hit papers
41 papers, 3.7k citations indexed

About

Michael Sipser is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Michael Sipser has authored 41 papers receiving a total of 3.7k indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 8 papers in Computer Networks and Communications. Recurrent topics in Michael Sipser's work include semigroups and automata theory (16 papers), Computability, Logic, AI Algorithms (14 papers) and Algorithms and Data Compression (10 papers). Michael Sipser is often cited by papers focused on semigroups and automata theory (16 papers), Computability, Logic, AI Algorithms (14 papers) and Algorithms and Data Compression (10 papers). Michael Sipser collaborates with scholars based in United States, Mexico and Israel. Michael Sipser's co-authors include James B. Saxe, Merrick L. Furst, Sam Gutmann, Edward Farhi, Jeffrey Goldstone, Christos H. Papadimitriou, Lance Fortnow, David Lichtenstein, Ravi B. Boppana and John Rompel and has published in prestigious journals such as Nature, Physical Review Letters and Physical Review A.

In The Last Decade

Michael Sipser

40 papers receiving 3.3k citations

Hit Papers

Introduction to the Theory of Computation 1984 2026 1998 2012 1996 1984 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Introduction to the Theory of Computation
    1996 1.3k citations Michael Sipser ACM SIGACT News profile →
  2. Parity, circuits, and the polynomial-time hierarchy
    1984 505 citations Michael Sipser et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Michael Sipser United States 24 2.4k 2.3k 505 288 268 41 3.7k
Lance Fortnow United States 31 2.9k 1.2× 2.9k 1.3× 511 1.0× 189 0.7× 181 0.7× 162 4.2k
Martin Davis United States 22 3.2k 1.4× 2.8k 1.2× 1.2k 2.4× 198 0.7× 258 1.0× 93 5.3k
Boaz Barak United States 26 1.8k 0.8× 2.5k 1.1× 710 1.4× 101 0.4× 364 1.4× 77 4.1k
J. W. Thatcher United States 16 2.2k 0.9× 1.8k 0.8× 851 1.7× 300 1.0× 281 1.0× 35 3.8k
Márió Szegedy United States 28 3.2k 1.4× 3.2k 1.4× 1.5k 3.0× 126 0.4× 355 1.3× 83 5.2k
Larry J. Stockmeyer United States 19 2.3k 1.0× 1.8k 0.8× 582 1.2× 249 0.9× 144 0.5× 37 3.1k
Friedrich L. Bauer Germany 27 1.4k 0.6× 1.2k 0.5× 358 0.7× 82 0.3× 156 0.6× 120 3.3k
Russell Impagliazzo United States 40 4.4k 1.9× 4.0k 1.7× 1.1k 2.1× 141 0.5× 441 1.6× 154 6.1k
László Babai United States 40 4.2k 1.8× 4.0k 1.7× 936 1.9× 185 0.6× 1.4k 5.0× 165 6.8k
David Zuckerman United States 31 1.7k 0.7× 1.8k 0.8× 1.2k 2.3× 272 0.9× 384 1.4× 96 3.5k

Countries citing papers authored by Michael Sipser

Since Specialization
Citations

This map shows the geographic impact of Michael Sipser's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Sipser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Sipser more than expected).

Fields of papers citing papers by Michael Sipser

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Sipser. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Sipser. The network helps show where Michael Sipser may publish in the future.

Co-authorship network of co-authors of Michael Sipser

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Sipser. A scholar is included among the top collaborators of Michael Sipser based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Sipser. Michael Sipser is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sipser, Michael. (2021). Introduction to The Theory of Computation, International Edition, 3/E.
2.
Sipser, Michael. (1996). Introduction to the Theory of Computation: Preliminary Edition. 28 indexed citations
3.
Papadimitriou, Christos H., Oded Goldreich, Avi Wigderson, Alexander Razborov, & Michael Sipser. (1996). The future of computational complexity theory: part I. ACM SIGACT News. 27(3). 6–12. 1 indexed citations
4.
Kao, Ming‐Yang, Yuan Ma, Michael Sipser, & Yiqun Lisa Yin. (1994). Optimal constructions of hybrid algorithms. Symposium on Discrete Algorithms. 372–381. 11 indexed citations
5.
Fortnow, Lance, John Rompel, & Michael Sipser. (1994). On the power of multi-prover interactive protocols. Theoretical Computer Science. 134(2). 545–557. 94 indexed citations
6.
Sipser, Michael. (1992). The history and status of the P versus NP question. 603–618. 50 indexed citations
7.
Grigni, Michelangelo & Michael Sipser. (1991). Monotone Separation of Logspace from NC.. 294–298. 7 indexed citations
8.
Grigni, Michelangelo & Michael Sipser. (1991). Structure in monotone complexity. 6 indexed citations
9.
Fortnow, Lance, John Rompel, & Michael Sipser. (1990). Errata for On the Power of Multi-Prover Interactive Protocols.. 318–319. 9 indexed citations
10.
Fürer, Martin, Oded Goldreich, Yishay Mansour, Michael Sipser, & Stathis Zachos. (1989). On Completeness and Soundness in Interactive Proof Systems.. 5(91). 429–442. 50 indexed citations
11.
Sipser, Michael. (1988). Expanders, randomness, or time versus space. Journal of Computer and System Sciences. 36(3). 379–383. 85 indexed citations
12.
Awerbuch, Baruch & Michael Sipser. (1988). Dynamic Networks are as fast as static networks (Preliminary Version). 5 indexed citations
13.
Goldreich, Oded, Yishay Mansour, & Michael Sipser. (1987). Interactive proof systems: Provers that never fail and random selection. 449–461. 24 indexed citations
14.
Papadimitriou, Christos H. & Michael Sipser. (1984). Communication complexity. Journal of Computer and System Sciences. 28(2). 260–269. 59 indexed citations
15.
Sipser, Michael. (1983). A complexity theoretic approach to randomness. 330–335. 243 indexed citations
16.
Sipser, Michael. (1983). Borel sets and circuit complexity. 61–69. 111 indexed citations
17.
Sipser, Michael, et al.. (1981). Several results in program size complexity. Theoretical Computer Science. 15(3). 291–309. 1 indexed citations
18.
Sipser, Michael. (1980). Halting space-bounded computations. Theoretical Computer Science. 10(3). 335–338. 56 indexed citations
19.
Sipser, Michael. (1980). Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences. 21(2). 195–202. 47 indexed citations
20.
Sipser, Michael. (1978). Halting space-bounded computations. 73–74. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Lance Fortnow Breakdown of academic impact, for papers by Martin Davis Breakdown of academic impact, for papers by Boaz Barak Breakdown of academic impact, for papers by J. W. Thatcher Breakdown of academic impact, for papers by Márió Szegedy Breakdown of academic impact, for papers by Larry J. Stockmeyer Breakdown of academic impact, for papers by Friedrich L. Bauer Breakdown of academic impact, for papers by Russell Impagliazzo Breakdown of academic impact, for papers by László Babai Breakdown of academic impact, for papers by David Zuckerman
Rankless by CCL
2026