2026 Neil Immerman: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	50	5512	5358	2516	2431	144	13656

Research.com Recognitions

2003 - Fellow of John Simon Guggenheim Memorial Foundation
2002 - ACM Fellow For contributions to complexity theory, descriptive complexity, and database theory.

Overview

Neil Immerman is affiliated with the University of Massachusetts Amherst in the United States. Their research is primarily situated within the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Software, and Philosophy.

Their work spans across multiple topics such as AI-based Problem Solving and Planning, Logic, Reasoning, and Knowledge, Model-Driven Software Engineering Techniques, Natural Language Processing Techniques, Linguistics and Discourse Analysis, Advanced Algebra and Logic, and Logic, Programming, and Type Systems.

Recent papers by Neil Immerman include the following:

Computing Applicability Conditions for Plans with Loops, 2021, Proceedings of the International Conference on Automated Planning and Scheduling
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus, 2020, RWTH Publications (RWTH Aachen)
Multi-Structural Games and Beyond, 2023, arXiv (Cornell University)
Summing up Smart Transitions, 2021, Lecture notes in computer science
Artifact for Article: First-Order Quantified Separators, 2020, Artifact Digital Object Group

Frequent co-authors who have collaborated with Neil Immerman include:

Phokion G. Kolaitis
Jonathan Lenchner
Rik Sengupta
Marco Carmosino
Ronald Fagin

The scientist has published regularly in various venues, with repeated contributions to:

arXiv (Cornell University)
ACM SIGLOG News
Proceedings of the International Conference on Automated Planning and Scheduling
Lecture notes in computer science
RWTH Publications (RWTH Aachen)

Among their recognitions, Neil Immerman was named a Fellow of the John Simon Guggenheim Memorial Foundation in 2003. They were also honored as an ACM Fellow in 2002 for contributions to complexity theory, descriptive complexity, and database theory.

Best Publications

The Complexity of Decentralized Control of Markov Decision Processes

Daniel S. Bernstein;Robert Givan;Neil Immerman;Shlomo Zilberstein

1814
Citations
Nondeterministic space is closed under complementation

N. Immerman

1082
Citations
Relational queries computable in polynomial time

Neil Immerman

961
Citations
Languages that capture complexity classes

Neil Immerman

851
Citations
An optimal lower bound on the number of variables for graph identification

Jin Yi Cai;Martin Fürer;Neil Immerman

794
Citations
On uniformity within NC 1

David A. Mix-Barrington;Neil Immerman;Howard Straubing

691
Citations
Efficient pattern matching over event streams

Jagrati Agrawal;Yanlei Diao;Daniel Gyllstrom;Neil Immerman

567
Citations
The complexity of decentralized control of Markov decision processes

Daniel S. Bernstein;Shlomo Zilberstein;Neil Immerman

351
Citations
Upper and lower bounds for first order expressibility

Neil Immerman;Neil Immerman

337
Citations
Describing Graphs: A First-Order Approach to Graph Canonization

Neil Immerman;Eric Lander;Eric Lander

310
Citations
Number of quantifiers is better than number of tape cells

Neil Immerman;Neil Immerman

231
Citations
Definability with bounded number of bound variables

N. Immerman;D. Kozen

213
Citations
Sparse sets in NP-P: EXPTIME versus NEXPTIME*

Juris Hartmanis;Neil Immerman;Vivian Sewelson

202
Citations
On complexity and optimization of expensive queries in complex event processing

Haopeng Zhang;Yanlei Diao;Neil Immerman

198
Citations
Expressibility and parallel complexity

Neil Immerman

171
Citations
Descriptive and Computational Complexity

Neil Immerman

170
Citations
On the unusual effectiveness of logic in computer science

Joseph Y. Halpern;Robert Harper;Neil Immerman;Phokion G. Kolaitis

168
Citations
Expressibility as a complexity measure: results and directions.

Neil Immerman

156
Citations
Languages which capture complexity classes

Neil Immerman

152
Citations
Leader election algorithms for wireless ad hoc networks

S. Vasudevan;B. DeCleene;N. Immerman;J. Kurose

145
Citations
On uniformity within NC 1 .

David A. Mix Barrington;Neil Immerman;Howard Straubing

68
Citations

Frequent Co-Authors

Mooly Sagiv Tel Aviv University

Shlomo Zilberstein University of Massachusetts Amherst

Kousha Etessami University of Edinburgh

Eric Allender Rutgers, The State University of New Jersey

Thomas Reps University of Wisconsin–Madison

Juris Hartmanis Cornell University

Phokion G. Kolaitis University of California, Santa Cruz

Leonid Libkin University of Edinburgh

Rajeev Alur University of Pennsylvania

Saharon Shelah Hebrew University of Jerusalem

External Links

Wikipedia of Neil Immerman Personal website of Neil Immerman Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring a Computer Science degree in the USA can open doors to a wide range of online education opportunities and promising career paths. Many students leverage flexible online programs to develop core technical skills and pursue roles in fast-growing industries.

For those interested in public service or cybersecurity, a criminal justice degree online can be a strong alternative, combining technology with legal studies. Similarly, for individuals keen on financial technology, an accounting degree offers foundational skills in both business and analytics.

Those aiming for high-level data roles may consider an online masters in data science, which focuses on advanced data analytics and big data technologies. For students interested in combining computing with project leadership in the built environment, the best online construction management degree programs offer pathways to manage technology-driven construction projects.

Choosing the right online degree program can significantly influence your skill set and career trajectory—so review your options carefully, considering affordability, flexibility, and alignment with your career goals.