Michael Sipser

8.2k citations
56 papers · 6.8k · 3 hit papers · h-index 31

Impact in

    • Complexity and Algorithms in Graphs
    • semigroups and automata theory
    • Computability, Logic, AI Algorithms
    • Advanced Graph Theory Research
    • Quantum Computing Algorithms and Architecture
    • Cryptography and Data Security
    • Coding theory and cryptography

Papers in

    • Complexity and Algorithms in Graphs 30
    • Computability, Logic, AI Algorithms 18
    • semigroups and automata theory 7
    • Advanced Graph Theory Research 2
    • Cryptography and Data Security 5
    • Quantum Computing Algorithms and Architecture 3
    • Coding theory and cryptography 3
    • Algorithms and Data Compression 2

Michael Sipser

55 papers receiving 6.2k citations

Michael Sipser's Hit Papers

Introduction to the Theory of Computation 1996 · 1.7k citations
1.7k0+14+28Years since publication5001k1.5k

Peers

Michael Sipser
Comparison fields: 5 of 101
  • Computational Theory and Mathematics 3.8k
  • Artificial Intelligence 2.1k
  • Discrete Mathematics and Combinatorics 240
  • Computer Networks and Communications 720
  • Software 81
Replace Umesh V. Vazirani with:
Umesh V. Vazirani United States
Richard Edwin Stearns United States
Jack Edmonds Canada
Stephen A Cook Canada
Shimon Even Israel
J. W. Thatcher United States
Don Coppersmith United States
Larry Stockmeyer United States
Michael O. Rabin United States
Zvi Galil United States
Michael Sipser relative to Umesh V. Vazirani United States Umesh V. Vazirani's profile →
Citations per field
00.5×1.5×
Umesh V. Vazirani · 1×
Citations per year

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-authors

The 25 scholars most cited alongside Michael Sipser, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michael Sipser Line = papers co-authored together Michael Sipser links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 56 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Introduction to the Theory of Computation
Hit paper breakdown →
19961674
2
Parity, circuits, and the polynomial-time hierarchy
Hit paper breakdown →
1984699
3
Expander codes
Hit paper breakdown →
1996624
4 1983343
5
Quantum Computation by Adiabatic Evolution
2000334
6 1986292
7 1987254
8 1990216
9 1981167
10 1983158
11 1981153
12 1978141
13 1994128
14 1980109
15 1982105
16 1988105
17 1988105
18 1998102
19 198094
20 198084

About Michael Sipser

Michael Sipser is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Industrial and Manufacturing Engineering, having authored 56 papers that have together received 6.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (30 papers), Computability, Logic, AI Algorithms (18 papers), semigroups and automata theory (7 papers), Cryptography and Data Security (5 papers), Quantum Computing Algorithms and Architecture (3 papers), Coding theory and cryptography (3 papers), Advanced Graph Theory Research (2 papers) and Algorithms and Data Compression (2 papers). The work is most often cited by research in Computational Theory and Mathematics (3.8k citations), Artificial Intelligence (2.1k citations), Discrete Mathematics and Combinatorics (240 citations), Computer Networks and Communications (720 citations) and Software (81 citations). Michael Sipser has collaborated with scholars based in United States, Israel and Greece. Frequent co-authors include Daniel A. Spielman, James B. Saxe, Shafi Goldwasser, Lance Fortnow, Edward Farhi, Sam Gutmann, Jeffrey Goldstone, Ravi B. Boppana, Christos H. Papadimitriou and John Rompel. Their work appears in journals such as Journal of Computer and System Sciences, Theoretical Computer Science, SIAM Journal on Computing, Nature and Physical Review Letters.

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