| 2024 | MFCS | On the Number of Quantifiers Needed to Define Boolean Functions. | Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta |
| 2021 | CAV | Summing up Smart Transitions. | Neta Elad, Sophie Rain, Neil Immerman, Laura Kovcs, Mooly Sagiv |
| 2020 | PLDI | First-order quantified separators. | Jason R. Koenig, Oded Padon, Neil Immerman, Alex Aiken |
| 2020 | PODS | New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. | Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou |
| 2017 | TACAS | Bounded Quantifier Instantiation for Checking Inductive Invariants. | Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham |
| 2016 | POPL | Decidability of inferring inductive invariants. | Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv |
| 2015 | POPL | Decentralizing SDN Policies. | Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham |
| 2014 | POPL | Modular reasoning about heap paths via effectively propositional formulas. | Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv |
| 2014 | SIGMOD | On complexity and optimization of expensive queries in complex event processing. | Haopeng Zhang, Yanlei Diao, Neil Immerman |
| 2013 | CAV | Effectively-Propositional Reasoning about Reachability in Linked Data Structures. | Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv |
| 2013 | LPAR | Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. | Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv |
| 2012 | ECOOP | PQL: A Purely-Declarative Java Extension for Parallel Programming. | Christoph Reichenbach, Yannis Smaragdakis, Neil Immerman |
| 2011 | AAAI | Termination and Correctness Analysis of Cyclic Control. | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
| 2011 | AAAI | Qualitative Numeric Planning. | Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner |
| 2010 | OOPSLA | A simple inductive synthesis methodology and its applications. | Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv |
| 2010 | OOPSLA | What can the GC compute efficiently?: a language for heap assertions at GC time. | Christoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer |
| 2008 | AAAI | Learning Generalized Plans Using Abstract Counting. | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
| 2008 | ICDE | On Supporting Kleene Closure over Event Streams. | Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman |
| 2008 | ISAIM | Using Abstraction for Generalized Planning. | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
| 2008 | SIGMOD | Efficient pattern matching over event streams. | Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman |
| 2007 | CSL | Structure Theorem and Strict Alternation Hierarchy for FO | Philipp Weis, Neil Immerman |
| 2007 | LICS | First-Order and Temporal Logics for Nested Words. | Rajeev Alur, Marcelo Arenas, Pablo Barcel, Kousha Etessami, Neil Immerman, Leonid Libkin |
| 2007 | VMCAI | Constructing Specialized Shape Analyses for Uniform Change. | Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps |
| 2006 | CAV | Abstraction for Shape Analysis with Fast and Precise Transformers. | Tal Lev-Ami, Neil Immerman, Shmuel Sagiv |
| 2005 | CADE | Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. | Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh |
| 2005 | MFCS | The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
| 2004 | CAV | Verification via Structure Simulation. | Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh |
| 2004 | CSL | The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. | Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh |
| 2002 | LICS | Complete Problems for Dynamic Complexity Classes. | William Hesse, Neil Immerman |
| 2001 | LICS | An n! Lower Bound on Formula Size. | Micah Adler, Neil Immerman |
| 2001 | LICS | The Crane Beach Conjecture. | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thrien |
| 2000 | UAI | The Complexity of Decentralized Control of Markov Decision Processes. | Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman |
| 1997 | CAV | Model Checking and Transitive-Closure Logic. | Neil Immerman, Moshe Y. Vardi |
| 1996 | LICS | A Generalization of Fagin's Theorem. | J. Antonio Medina, Neil Immerman |
| 1995 | LICS | Tree Canonization and Transitive Closure | Kousha Etessami, Neil Immerman |
| 1994 | LICS | McColm's Conjecture | Yuri Gurevich, Neil Immerman, Saharon Shelah |
| 1994 | LICS | A Syntactic Characterization of NP-Completeness | J. Antonio Medina, Neil Immerman |
| 1994 | PODS | Dyn-FO: A Parallel, Dynamic Complexity Class. | Sushant Patnaik, Neil Immerman |
| 1994 | STACS | Reachability and the Power of Local Ordering. | Kousha Etessami, Neil Immerman |
| 1993 | STACS | A First-Order Isomorphism Theorem. | Eric Allender, Jos L. Balczar, Neil Immerman |
| 1991 | PODS | The Expressiveness of a Family of Finite Set Languages. | Neil Immerman, Sushant Patnaik, David W. Stemple |
| 1989 | FCT | Descriptive and Computational Complexity. | Neil Immerman |
| 1989 | FOCS | An Optimal Lower Bound on the Number of Variables for Graph Identification | Jin-yi Cai, Martin Frer, Neil Immerman |
| 1987 | LICS | Definability with Bounded Number of Bound Variables | Neil Immerman, Dexter Kozen |
| 1986 | TARK | Foundations of Knowledge for Distributed Systems. | Michael J. Fischer, Neil Immerman |
| 1985 | ICALP | On Complete Problems for NP$\cap$CoNP. | Juris Hartmanis, Neil Immerman |
| 1983 | STOC | Sparse Sets in NP-P: EXPTIME versus NEXPTIME | Juris Hartmanis, Vivian Sewelson, Neil Immerman |
| 1983 | STOC | Languages Which Capture Complexity Classes (Preliminary Report) | Neil Immerman |
| 1982 | STOC | Relational Queries Computable in Polynomial Time (Extended Abstract) | Neil Immerman |
| 1980 | FOCS | Upper and Lower Bounds for First Order Expressibility | Neil Immerman |
| 1979 | FOCS | Length of Predicate Calculus Formulas as a New Complexity Measure | Neil Immerman |
| 1978 | FOCS | One-Way Log-Tape Reductions | Juris Hartmanis, Neil Immerman, Stephen R. Mahaney |