Neil Immerman

ORCID

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 26

Top Venues

ACM SIGLOG News

CoRR

POPL

Proc. ACM Program. Lang.

Publications

Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
On the Number of Quantifiers Needed to Define Boolean Functions. CoRR (2024)
Neil Immerman
What Juris Hartmanis taught me about Reductions. CoRR (2024)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
On the Number of Quantifiers Needed to Define Boolean Functions. MFCS (2024)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams
Parallel Play Saves Quantifiers. CoRR (2024)
Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
A Finer Analysis of Multi-Structural Games and Beyond. CoRR (2023)
Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
Summing Up Smart Transitions. CoRR (2021)
Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
Summing up Smart Transitions. CAV (1) (2021)
Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. PODS (2020)
Jason R. Koenig, Oded Padon, Neil Immerman, Alex Aiken
First-order quantified separators. PLDI (2020)
Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham
Complexity and information in invariant inference. Proc. ACM Program. Lang. 4 (POPL) (2020)
Neil Immerman
Complexity column. ACM SIGLOG News 7 (1) (2020)
Neil Immerman
Complexity column. ACM SIGLOG News 7 (3) (2020)
Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
Bounded Quantifier Instantiation for Checking Inductive Invariants. Log. Methods Comput. Sci. 15 (3) (2019)
Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham
Complexity and Information in Invariant Inference. CoRR (2019)
Neil Immerman, Rik Sengupta
The k-Dimensional Weisfeiler-Leman Algorithm. CoRR (2019)
Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. CoRR (2019)
Neil Immerman
Complexity column. ACM SIGLOG News 5 (3) (2018)
Neil Immerman
Complexity column. ACM SIGLOG News 5 (4) (2018)
Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
Bounded Quantifier Instantiation for Checking Inductive Invariants. TACAS (1) (2017)
Neil Immerman
Complexity column. ACM SIGLOG News 4 (2) (2017)
Neil Immerman
Complexity column. ACM SIGLOG News 4 (3) (2017)
Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
Bounded Quantifier Instantiation for Checking Inductive Invariants. CoRR (2017)
Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv
Decidability of inferring inductive invariants. POPL (2016)
Neil Immerman
Complexity column. ACM SIGLOG News 3 (1) (2016)
Neil Immerman
Complexity column. ACM SIGLOG News 3 (2) (2016)
Neil Immerman
Complexity column. ACM SIGLOG News 3 (3) (2016)
Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries. Proc. VLDB Endow. 9 (3) (2015)
Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
A Characterization of the Complexity of Resilience and Responsibility for Self-join-free Conjunctive Queries. CoRR (2015)
Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham
Decentralizing SDN Policies. POPL (2015)
Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv
Modular reasoning about heap paths via effectively propositional formulas. POPL (2014)
Neil Immerman
Complexity column. ACM SIGLOG News 1 (1) (2014)
Haopeng Zhang, Yanlei Diao, Neil Immerman
On complexity and optimization of expensive queries in complex event processing. SIGMOD Conference (2014)
Haopeng Zhang, Yanlei Diao, Neil Immerman
Recognizing patterns in streams with imprecise timestamps. Inf. Syst. 38 (8) (2013)
Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv
Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV (2013)
Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman
The Complexity of Decentralized Control of Markov Decision Processes CoRR (2013)
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv
Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. LPAR (2013)
Wentian Lu, Gerome Miklau, Neil Immerman
Auditing a database under retention policies. VLDB J. 22 (2) (2013)
Marco Carmosino, Neil Immerman, Charles Jordan
Experimental Descriptive Complexity. Logic and Program Semantics (2012)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Applicability conditions for plans with loops: Computability results and algorithms. Artif. Intell. (2012)
Christoph Reichenbach, Yannis Smaragdakis, Neil Immerman
PQL: A Purely-Declarative Java Extension for Parallel Programming. ECOOP (2012)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang
Directed Search for Generalized Plans Using Classical Planners. ICAPS (2011)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
A new representation and associated algorithms for generalized planning. Artif. Intell. 175 (2) (2011)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Termination and Correctness Analysis of Cyclic Control. AAAI (2011)
Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner
Qualitative Numeric Planning. AAAI (2011)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Merging example plans into generalized plans for non-deterministic environments. AAMAS (2010)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Computing Applicability Conditions for Plans with Loops. ICAPS (2010)
Michael Crouch, Neil Immerman, J. Eliot B. Moss
Finding Reductions Automatically. Fields of Logic and Computation (2010)
Haopeng Zhang, Yanlei Diao, Neil Immerman
Recognizing Patterns in Streams with Imprecise Timestamps. Proc. VLDB Endow. 3 (1) (2010)
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv
A simple inductive synthesis methodology and its applications. OOPSLA (2010)
Christoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer
What can the GC compute efficiently?: a language for heap assertions at GC time. OOPSLA (2010)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Abstract Planning with Unknown Object Quantities and Properties. SARA (2009)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75 (4) (2009)
Philipp Weis, Neil Immerman
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words Log. Methods Comput. Sci. 5 (3) (2009)
Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh
Simulating reachability using first-order logic with applications to verification of linked data structures Log. Methods Comput. Sci. 5 (2) (2009)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Using Abstraction for Generalized Planning. ISAIM (2008)
Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Learning Generalized Plans Using Abstract Counting. AAAI (2008)
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman
Efficient pattern matching over event streams. SIGMOD Conference (2008)
Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman
On Supporting Kleene Closure over Event Streams. ICDE (2008)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words CoRR (2008)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words. Log. Methods Comput. Sci. 4 (4) (2008)
Philipp Weis, Neil Immerman
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Electron. Colloquium Comput. Complex. 14 (008) (2007)
Philipp Weis, Neil Immerman
on Words. CSL (2007)
Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
First-Order and Temporal Logics for Nested Words. LICS (2007)
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps
Constructing Specialized Shape Analyses for Uniform Change. VMCAI (2007)
Philipp Weis, Neil Immerman
on Words. Circuits, Logic, and Games (2006)
Tal Lev-Ami, Neil Immerman, Shmuel Sagiv
Abstraction for Shape Analysis with Fast and Precise Transformers. CAV (2006)
David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci. 70 (2) (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS (2005)
Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE (2005)
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electron. Colloquium Comput. Complex. (100) (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL (2004)
Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
Verification via Structure Simulation. CAV (2004)
Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley
Leader Election Algorithms for Wireless Ad Hoc Networks. DISCEX (1) (2003)
Micah Adler, Neil Immerman
lower bound on formula size. ACM Trans. Comput. Log. 4 (3) (2003)
Matthew Hertz, Neil Immerman, J. Eliot B. Moss
Framework for Analyzing Garbage Collection. IFIP TCS (2002)
William Hesse, Neil Immerman
Complete Problems for Dynamic Complexity Classes. LICS (2002)
Susan Landau, Neil Immerman
Embedding Linkages on an Integer Lattice. Algorithmica 32 (3) (2002)
Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein
The Complexity of Decentralized Control of Markov Decision Processes. Math. Oper. Res. 27 (4) (2002)
Micah Adler, Neil Immerman
An n! Lower Bound on Formula Size. LICS (2001)
Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu
On the unusual effectiveness of logic in computer science. Bull. Symb. Log. 7 (2) (2001)
Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
Number of Variables Is Equivalent to Space. J. Symb. Log. 66 (3) (2001)
David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
The Crane Beach Conjecture. LICS (2001)
Kousha Etessami, Neil Immerman
Tree Canonization and Transitive Closure. Inf. Comput. 157 (1-2) (2000)
Natasha Alechina, Neil Immerman
Reachability Logic: An Efficient Fragment of Transitive Closure Logic. Log. J. IGPL 8 (3) (2000)
Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman
The Complexity of Decentralized Control of Markov Decision Processes. UAI (2000)
Neil Immerman
Progress in Descriptive Complexity. Bull. EATCS 67 (1999)
Neil Immerman
Descriptive Complexity and Model Checking. FSTTCS (1998)
Neil Immerman, Moshe Y. Vardi
Model Checking and Transitive-Closure Logic. CAV (1997)
Sushant Patnaik, Neil Immerman
Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci. 55 (2) (1997)
Eric Allender, José L. Balcázar, Neil Immerman
A First-Order Isomorphism Theorem. SIAM J. Comput. 26 (2) (1997)
J. Antonio Medina, Neil Immerman
A Generalization of Fagin's Theorem. LICS (1996)
Neil Immerman, Sushant Patnaik, David W. Stemple
The Expressiveness of a Family of Finite Set Languages. Theor. Comput. Sci. 155 (1) (1996)
Kousha Etessami, Neil Immerman
Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148 (2) (1995)
Neil Immerman, Susan Landau
The Complexity of Iterated Multiplication Inf. Comput. 116 (1) (1995)
Kousha Etessami, Neil Immerman
Tree Canonization and Transitive Closure LICS (1995)
David A. Mix Barrington, Neil Immerman
Time, Hardware, and Uniformity. Computational Complexity Conference (1994)
Sushant Patnaik, Neil Immerman
Dyn-FO: A Parallel, Dynamic Complexity Class. PODS (1994)
J. Antonio Medina, Neil Immerman
A Syntactic Characterization of NP-Completeness LICS (1994)
Yuri Gurevich, Neil Immerman, Saharon Shelah
McColm's Conjecture LICS (1994)
Yuri Gurevich, Neil Immerman, Saharon Shelah
McColm conjecture. CoRR (1994)

Neil Immerman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Neil Immerman