Michael Sipser
- Computational Theory and Mathematics top 0.1%
- semigroups and automata theory 16
- Computability, Logic, AI Algorithms 14
- Complexity and Algorithms in Graphs 9
- Artificial Intelligence top 0.5%
- Algorithms and Data Compression 10
- Logic, programming, and type systems 6
- Cryptography and Data Security 4
- Logic, Reasoning, and Knowledge 3
- Software top 5%
-
- Optimization and Search Problems 5
- Co-authors
- James B. SaxeMerrick L. FurstSam GutmannEdward FarhiJeffrey GoldstoneChristos H. PapadimitriouLance FortnowDavid Lichtenstein
- Journals
- Journal of Computer and System Sciences (3 papers)Theoretical Computer Science (3 papers)Theory of Computing Systems (1 paper)
- Partner nations
- United StatesMexicoIsrael
In The Last Decade
Michael Sipser
40 papers receiving 3.3k citations
Hit Papers
Peers
Comparison fields: 5 of 116
- Computational Theory and Mathematics 2.4k
- Artificial Intelligence 2.3k
- Software 116
- Computer Networks and Communications 505
- 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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | Introduction to The Theory of Computation, International Edition, 3/E | 2021 | 0 |
| 2 | Introduction to the Theory of Computation: Preliminary Edition | 1996 | 28 |
| 3 | 1996 | 1 | |
| 4 | 1994 | 11 | |
| 5 | 1994 | 94 | |
| 6 | 1992 | 50 | |
| 7 | Monotone Separation of Logspace from NC. | 1991 | 7 |
| 8 | Structure in monotone complexity | 1991 | 6 |
| 9 | Errata for On the Power of Multi-Prover Interactive Protocols. | 1990 | 9 |
| 10 | 1989 | 50 | |
| 11 | 1988 | 85 | |
| 12 | Dynamic Networks are as fast as static networks (Preliminary Version) | 1988 | 5 |
| 13 | 1987 | 24 | |
| 14 | 1984 | 59 | |
| 15 | 1983 | 243 | |
| 16 | 1983 | 111 | |
| 17 | 1981 | 1 | |
| 18 | 1980 | 56 | |
| 19 | 1980 | 47 | |
| 20 | 1978 | 5 |
About Michael Sipser
Michael Sipser is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Industrial and Manufacturing Engineering and Hardware and Architecture, 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 Logic, Reasoning, and Knowledge (3 papers). The work is most often cited by research in Computational Theory and Mathematics (2.4k citations), Artificial Intelligence (2.3k citations), Software (116 citations), Computer Networks and Communications (505 citations) and Discrete Mathematics and Combinatorics (67 citations). Michael Sipser has collaborated with scholars based in United States, Mexico and Israel. Frequent 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. Their work appears in journals such as Journal of Computer and System Sciences, Theoretical Computer Science, Theory of Computing Systems, 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.