M. Sipser
-
- semigroups and automata theory 4
- Complexity and Algorithms in Graphs 3
- Computability, Logic, AI Algorithms 3
- Advanced Graph Theory Research 2
-
- Interconnection Networks and Systems 3
- Error Correcting Code Techniques 2
- Cooperative Communication and Network Coding 2
- Artificial Intelligence top 2%
- Hardware and Architecture top 10%
-
- VLSI and FPGA Design Techniques 2
- Co-authors
- Daniel A. SpielmanS. GoldwasserS.K. ChaudhuriRichard M. KarpThanh‐Tung BuiLance FortnowJohn RompelBaruch Awerbuch
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsDiscrete Mathematics and Combinatorics
- Journals
- Journal of Computer and System Sciences (1 paper)IEEE Transactions on Information Theory (1 paper)COMBINATORICA (1 paper)
- Partner nations
- United StatesFrance
In The Last Decade
M. Sipser
12 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 52
- Computational Theory and Mathematics 545
- Computer Networks and Communications 569
- Discrete Mathematics and Combinatorics 68
- Artificial Intelligence 556
- Hardware and Architecture 75
Countries citing papers authored by M. Sipser
This map shows the geographic impact of M. 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 M. Sipser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Sipser more than expected).
Fields of papers citing papers by M. Sipser
This network shows the impact of papers produced by M. 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 M. Sipser. The network helps show where M. Sipser may publish in the future.
Co-authorship network
The 11 scholars most cited alongside M. 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 | 2002 | 1 | |
| 2 | 2002 | 16 | |
| 3 | 1996 | 499 | |
| 4 | 1995 | 18 | |
| 5 | 1989 | 11 | |
| 6 | 1988 | 41 | |
| 7 | 1988 | 77 | |
| 8 | 1987 | 204 | |
| 9 | 1986 | 202 | |
| 10 | 1985 | 31 | |
| 11 | 1984 | 29 | |
| 12 | 1981 | 105 |
About M. Sipser
M. Sipser is a scholar working on Computational Theory and Mathematics, Hardware and Architecture, Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Artificial Intelligence, having authored 12 papers that have together received 1.2k indexed citations. Recurring topics across this work include semigroups and automata theory (4 papers), Interconnection Networks and Systems (3 papers), Complexity and Algorithms in Graphs (3 papers), Computability, Logic, AI Algorithms (3 papers), VLSI and FPGA Design Techniques (2 papers), Advanced Graph Theory Research (2 papers), Error Correcting Code Techniques (2 papers) and Cooperative Communication and Network Coding (2 papers). The work is most often cited by research in Computational Theory and Mathematics (545 citations), Computer Networks and Communications (569 citations), Discrete Mathematics and Combinatorics (68 citations), Artificial Intelligence (556 citations) and Hardware and Architecture (75 citations). M. Sipser has collaborated with scholars based in United States and France. Frequent co-authors include Daniel A. Spielman, S. Goldwasser, S.K. Chaudhuri, Richard M. Karp, Thanh‐Tung Bui, Lance Fortnow, John Rompel, Baruch Awerbuch, Andrew V. Goldberg and Michelangelo Grigni. Their work appears in journals such as Journal of Computer and System Sciences, IEEE Transactions on Information Theory and COMBINATORICA.
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.