Michael Sipser
Impact in
- Computational Theory and Mathematics top 0.1%
- Complexity and Algorithms in Graphs
- semigroups and automata theory
- Computability, Logic, AI Algorithms
- Formal Methods in Verification
- Advanced Graph Theory Research
- Artificial Intelligence top 0.5%
- Quantum Computing Algorithms and Architecture
- Machine Learning and Algorithms
- Cryptography and Data Security
Papers in
-
- semigroups and automata theory 16
- Computability, Logic, AI Algorithms 14
- Complexity and Algorithms in Graphs 9
-
- Algorithms and Data Compression 10
- Logic, programming, and type systems 6
- Cryptography and Data Security 4
- Artificial Intelligence in Games 3
- Co-authors
- Merrick L. Furst (2 shared papers)James B. Saxe (2 shared papers)Edward Farhi (3 shared papers)Sam Gutmann (3 shared papers)Jeffrey Goldstone (3 shared papers)Christos H. Papadimitriou (3 shared papers)Lance Fortnow (4 shared papers)David Lichtenstein (2 shared papers)
- Journals
- Journal of Computer and System Sciences (3 papers)Theoretical Computer Science (3 papers)Operations Research (1 paper)Journal of the ACM (1 paper)Theory of Computing Systems (1 paper)
- Partner nations
- United StatesBelarusFrance
In The Last Decade
Michael Sipser
40 papers receiving 3.3k citations
Michael Sipser's Hit Papers
Peers
Comparison fields: 5 of 114
- Computational Theory and Mathematics 2.4k
- Artificial Intelligence 2.3k
- Software 117
- Computer Networks and Communications 504
- Discrete Mathematics and Combinatorics 67
Countries citing papers authored by Michael Sipser
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
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.
All Works
Showing the 20 most-cited of 41 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Introduction to the Theory of Computation Hit paper breakdown → | 1996 | 1315 |
| 2 | Parity, circuits, and the polynomial-time hierarchy Hit paper breakdown → | 1984 | 506 |
| 3 | Quantum Computation by Adiabatic Evolution | 2000 | 278 |
| 4 | 1983 | 245 | |
| 5 | 1981 | 120 | |
| 6 | 1983 | 111 | |
| 7 | 1994 | 94 | |
| 8 | The Complexity of Finite Functions. | 1990 | 86 |
| 9 | 1982 | 85 | |
| 10 | 1988 | 85 | |
| 11 | 1980 | 79 | |
| 12 | 1998 | 74 | |
| 13 | 1978 | 66 | |
| 14 | 1984 | 58 | |
| 15 | 1980 | 56 | |
| 16 | Private Coins versus Public Coins in Interactive Proof Systems. | 1989 | 54 |
| 17 | 1989 | 51 | |
| 18 | 1992 | 50 | |
| 19 | 1980 | 47 | |
| 20 | 1988 | 43 |
About Michael Sipser
Michael Sipser is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Molecular Biology and Industrial and Manufacturing Engineering, having authored 41 papers that have together received 3.7k indexed citations. Recurring topics across this work include semigroups and automata theory (16 papers), Computability, Logic, AI Algorithms (14 papers), Algorithms and Data Compression (10 papers), Complexity and Algorithms in Graphs (9 papers), Logic, programming, and type systems (6 papers), Optimization and Search Problems (5 papers), Cryptography and Data Security (4 papers) and Artificial Intelligence in Games (3 papers). The work is most often cited by research in Computational Theory and Mathematics (2.4k citations), Artificial Intelligence (2.3k citations), Software (117 citations), Computer Networks and Communications (504 citations) and Discrete Mathematics and Combinatorics (67 citations). Michael Sipser has collaborated with scholars based in United States, Belarus and France. Frequent co-authors include Merrick L. Furst, James B. Saxe, Edward Farhi, Sam Gutmann, Jeffrey Goldstone, Christos H. Papadimitriou, Lance Fortnow, David Lichtenstein, Ravi B. Boppana and John Rompel. Their work appears in journals such as Journal of Computer and System Sciences, Theoretical Computer Science, Operations Research, Journal of the ACM and Theory of Computing Systems.
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.