Neil Immerman
Impact in
- Computational Theory and Mathematics top 0.1%
- semigroups and automata theory
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
- Computability, Logic, AI Algorithms
- Artificial Intelligence top 0.2%
- Logic, Reasoning, and Knowledge
- Logic, programming, and type systems
Papers in
-
- semigroups and automata theory 32
- Formal Methods in Verification 26
- Complexity and Algorithms in Graphs 16
- Computability, Logic, AI Algorithms 16
- Software 9
- Co-authors
- Shlomo ZilbersteinDaniel S. BernsteinRobert GivanYanlei DiaoJin‐Yi CaiHoward StraubingDaniel GyllstromHaopeng Zhang
- Journals
- Journal of Computer and System Sciences (6 papers)ACM SIGPLAN Notices (5 papers)SIAM Journal on Computing (4 papers)Theoretical Computer Science (3 papers)Information and Computation (3 papers)
- Partner nations
- United StatesIsraelSpain
In The Last Decade
Neil Immerman
87 papers receiving 4.1k citations
Hit Papers
Peers
Comparison fields: 5 of 90
- Computational Theory and Mathematics 2.3k
- Artificial Intelligence 2.7k
- Computer Networks and Communications 1.4k
- Signal Processing 485
- Software 156
Countries citing papers authored by Neil Immerman
This map shows the geographic impact of Neil Immerman'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 Neil Immerman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neil Immerman more than expected).
Fields of papers citing papers by Neil Immerman
This network shows the impact of papers produced by Neil Immerman. 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 Neil Immerman. The network helps show where Neil Immerman may publish in the future.
Co-authors
The 25 scholars most cited alongside Neil Immerman, 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 | 2019 | 2 | |
| 2 | 2010 | 5 | |
| 3 | 2010 | 45 | |
| 4 | Abstract Planning with Unknown Object Quantities and Properties | 2009 | 3 |
| 5 | Abstraction for shape analysis with fast and precise transformers | 2006 | 5 |
| 6 | 2000 | 7 | |
| 7 | Progress in Descriptive Complexity. | 1999 | 0 |
| 8 | Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University | 1997 | 2 |
| 9 | 1997 | 33 | |
| 10 | 1997 | 16 | |
| 11 | 1995 | 15 | |
| 12 | 1995 | 33 | |
| 13 | McColm's Conjecture | 1994 | 6 |
| 14 | 1990 | 257 | |
| 15 | 1986 | 352 | |
| 16 | On Complete Problems for NP$\cap$CoNP | 1985 | 4 |
| 17 | 1985 | 73 | |
| 18 | 1982 | 152 | |
| 19 | 1981 | 106 | |
| 20 | First Order Expressibility as a New Complexity Measure | 1980 | 2 |
About Neil Immerman
Neil Immerman is a scholar working on Computational Theory and Mathematics, Software, Artificial Intelligence, Computational Mathematics and Computer Networks and Communications, having authored 88 papers that have together received 4.4k indexed citations. Recurring topics across this work include semigroups and automata theory (32 papers), Logic, programming, and type systems (28 papers), Formal Methods in Verification (26 papers), Logic, Reasoning, and Knowledge (21 papers), Complexity and Algorithms in Graphs (16 papers), Computability, Logic, AI Algorithms (16 papers), Advanced Database Systems and Queries (12 papers) and Algorithms and Data Compression (10 papers). The work is most often cited by research in Computational Theory and Mathematics (2.3k citations), Artificial Intelligence (2.7k citations), Computer Networks and Communications (1.4k citations), Signal Processing (485 citations) and Software (156 citations). Neil Immerman has collaborated with scholars based in United States, Israel and Spain. Frequent co-authors include Shlomo Zilberstein, Daniel S. Bernstein, Robert Givan, Yanlei Diao, Jin‐Yi Cai, Howard Straubing, Daniel Gyllstrom, Haopeng Zhang, Vivian Sewelson and J. Hartmanis. Their work appears in journals such as Journal of Computer and System Sciences, ACM SIGPLAN Notices, SIAM Journal on Computing, Theoretical Computer Science and Information and Computation.
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.