Neil Immerman - RankMe

137 papers A* 34A 8B 8Misc 1Journal 65Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Who Wins the Multi-Structural Game? CoRR Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024	J	`jnl`	Multi-Structural Games and Beyond. Log. Methods Comput. Sci. Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024	B	`conf`	On the Number of Quantifiers Needed to Define Boolean Functions. MFCS Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024	J	`jnl`	On the Number of Quantifiers Needed to Define Boolean Functions. CoRR Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2024	J	`jnl`	Parallel Play Saves Quantifiers. CoRR Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta, R. Ryan Williams
2024	J	`jnl`	What Juris Hartmanis taught me about Reductions. CoRR Neil Immerman
2023	J	`jnl`	A Finer Analysis of Multi-Structural Games and Beyond. CoRR Marco Carmosino, Ronald Fagin, Neil Immerman, Phokion G. Kolaitis, Jonathan Lenchner, Rik Sengupta
2021	J	`jnl`	Summing Up Smart Transitions. CoRR Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
2021	—	`conf`	Summing up Smart Transitions. CAV (1) Neta Elad, Sophie Rain, Neil Immerman, Laura Kovács, Mooly Sagiv
2020	J	`jnl`	Complexity and information in invariant inference. Proc. ACM Program. Lang. Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham
2020	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2020	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2020	A*	`conf`	First-order quantified separators. PLDI Jason R. Koenig, Oded Padon, Neil Immerman, Alex Aiken
2020	A*	`conf`	New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. PODS Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
2019	J	`jnl`	Bounded Quantifier Instantiation for Checking Inductive Invariants. Log. Methods Comput. Sci. Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
2019	J	`jnl`	Complexity and Information in Invariant Inference. CoRR Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham
2019	J	`jnl`	New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. CoRR Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
2019	J	`jnl`	The k-Dimensional Weisfeiler-Leman Algorithm. CoRR Neil Immerman, Rik Sengupta
2018	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2018	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2017	—	`conf`	Bounded Quantifier Instantiation for Checking Inductive Invariants. TACAS (1) Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
2017	J	`jnl`	Bounded Quantifier Instantiation for Checking Inductive Invariants. CoRR Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
2017	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2017	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2016	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2016	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2016	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2016	A*	`conf`	Decidability of inferring inductive invariants. POPL Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv
2015	J	`jnl`	A Characterization of the Complexity of Resilience and Responsibility for Self-join-free Conjunctive Queries. CoRR Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
2015	A*	`conf`	Decentralizing SDN Policies. POPL Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham
2015	J	`jnl`	The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries. Proc. VLDB Endow. Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou
2014	J	`jnl`	Complexity column. ACM SIGLOG News Neil Immerman
2014	A*	`conf`	Modular reasoning about heap paths via effectively propositional formulas. POPL Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv
2014	—	`conf`	On complexity and optimization of expensive queries in complex event processing. SIGMOD Conference Haopeng Zhang, Yanlei Diao, Neil Immerman
2013	J	`jnl`	Auditing a database under retention policies. VLDB J. Wentian Lu, Gerome Miklau, Neil Immerman
2013	A*	`conf`	Effectively-Propositional Reasoning about Reachability in Linked Data Structures. CAV Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv
2013	J	`jnl`	Recognizing patterns in streams with imprecise timestamps. Inf. Syst. Haopeng Zhang, Yanlei Diao, Neil Immerman
2013	B	`conf`	Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. LPAR Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv
2013	J	`jnl`	The Complexity of Decentralized Control of Markov Decision Processes CoRR Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman
2012	J	`jnl`	Applicability conditions for plans with loops: Computability results and algorithms. Artif. Intell. Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2012	—	`conf`	Experimental Descriptive Complexity. Logic and Program Semantics Marco Carmosino, Neil Immerman, Charles Jordan
2012	A	`conf`	PQL: A Purely-Declarative Java Extension for Parallel Programming. ECOOP Christoph Reichenbach, Yannis Smaragdakis, Neil Immerman
2011	J	`jnl`	A new representation and associated algorithms for generalized planning. Artif. Intell. Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2011	A*	`conf`	Directed Search for Generalized Plans Using Classical Planners. ICAPS Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang
2011	A*	`conf`	Qualitative Numeric Planning. AAAI Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner
2011	A*	`conf`	Termination and Correctness Analysis of Cyclic Control. AAAI Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2010	A	`conf`	A simple inductive synthesis methodology and its applications. OOPSLA Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv
2010	A*	`conf`	Computing Applicability Conditions for Plans with Loops. ICAPS Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2010	—	`conf`	Finding Reductions Automatically. Fields of Logic and Computation Michael S. Crouch, Neil Immerman, J. Eliot B. Moss
2010	A	`conf`	Merging example plans into generalized plans for non-deterministic environments. AAMAS Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2010	J	`jnl`	Recognizing Patterns in Streams with Imprecise Timestamps. Proc. VLDB Endow. Haopeng Zhang, Yanlei Diao, Neil Immerman
2010	A	`conf`	What can the GC compute efficiently?: a language for heap assertions at GC time. OOPSLA Christoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer
2009	—	`conf`	Abstract Planning with Unknown Object Quantities and Properties. SARA Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2009	J	`jnl`	Simulating reachability using first-order logic with applications to verification of linked data structures Log. Methods Comput. Sci. Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh
2009	J	`jnl`	Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words Log. Methods Comput. Sci. Philipp Weis, Neil Immerman
2009	J	`jnl`	The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2008	—	`conf`	Efficient pattern matching over event streams. SIGMOD Conference Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman
2008	J	`jnl`	First-Order and Temporal Logics for Nested Words CoRR Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
2008	J	`jnl`	First-Order and Temporal Logics for Nested Words. Log. Methods Comput. Sci. Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
2008	A*	`conf`	Learning Generalized Plans Using Abstract Counting. AAAI Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2008	A*	`conf`	On Supporting Kleene Closure over Event Streams. ICDE Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman
2008	Misc	`conf`	Using Abstraction for Generalized Planning. ISAIM Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
2007	B	`conf`	Constructing Specialized Shape Analyses for Uniform Change. VMCAI Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps
2007	A*	`conf`	First-Order and Temporal Logics for Nested Words. LICS Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin
2007	B	`conf`	Structure Theorem and Strict Alternation Hierarchy for FO CSL Philipp Weis, Neil Immerman
2007	J	`jnl`	Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Electron. Colloquium Comput. Complex. Philipp Weis, Neil Immerman
2006	A*	`conf`	Abstraction for Shape Analysis with Fast and Precise Transformers. CAV Tal Lev-Ami, Neil Immerman, Shmuel Sagiv
2006	—	`conf`	Structure Theorem and Strict Alternation Hierarchy for FO Circuits, Logic, and Games Philipp Weis, Neil Immerman
2005	J	`jnl`	First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2005	A	`conf`	Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh
2005	B	`conf`	The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2004	B	`conf`	The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
2004	J	`jnl`	The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electron. Colloquium Comput. Complex. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2004	A*	`conf`	Verification via Structure Simulation. CAV Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
2003	J	`jnl`	An ACM Trans. Comput. Log. Micah Adler, Neil Immerman
2003	—	`conf`	Leader Election Algorithms for Wireless Ad Hoc Networks. DISCEX (1) Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley
2002	A*	`conf`	Complete Problems for Dynamic Complexity Classes. LICS William Hesse, Neil Immerman
2002	J	`jnl`	Embedding Linkages on an Integer Lattice. Algorithmica Susan Landau, Neil Immerman
2002	—	`conf`	Framework for Analyzing Garbage Collection. IFIP TCS Matthew Hertz, Neil Immerman, J. Eliot B. Moss
2002	J	`jnl`	The Complexity of Decentralized Control of Markov Decision Processes. Math. Oper. Res. Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein
2001	A*	`conf`	An n! Lower Bound on Formula Size. LICS Micah Adler, Neil Immerman
2001	J	`jnl`	Number of Variables Is Equivalent to Space. J. Symb. Log. Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
2001	J	`jnl`	On the unusual effectiveness of logic in computer science. Bull. Symb. Log. Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu
2001	—	`ch.`	Progress in Descriptive Complexity. Current Trends in Theoretical Computer Science Neil Immerman
2001	A*	`conf`	The Crane Beach Conjecture. LICS David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2000	J	`jnl`	Reachability Logic: An Efficient Fragment of Transitive Closure Logic. Log. J. IGPL Natasha Alechina, Neil Immerman
2000	A	`conf`	The Complexity of Decentralized Control of Markov Decision Processes. UAI Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman
2000	J	`jnl`	Tree Canonization and Transitive Closure. Inf. Comput. Kousha Etessami, Neil Immerman
1999	—	`book`	Descriptive complexity. Neil Immerman
1999	J	`jnl`	Progress in Descriptive Complexity. Bull. EATCS Neil Immerman
1998	—	`conf`	Descriptive Complexity and Model Checking. FSTTCS Neil Immerman
1997	J	`jnl`	A First-Order Isomorphism Theorem. SIAM J. Comput. Eric Allender, José L. Balcázar, Neil Immerman
1997	J	`jnl`	Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci. Sushant Patnaik, Neil Immerman
1997	A*	`conf`	Model Checking and Transitive-Closure Logic. CAV Neil Immerman, Moshe Y. Vardi
1996	A*	`conf`	A Generalization of Fagin's Theorem. LICS J. Antonio Medina, Neil Immerman
1996	—	`ed.`	Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996 Descriptive Complexity and Finite Models Neil Immerman, Phokion G. Kolaitis
1996	J	`jnl`	The Expressiveness of a Family of Finite Set Languages. Theor. Comput. Sci. Neil Immerman, Sushant Patnaik, David W. Stemple
1995	J	`jnl`	Reachability and the Power of Local Ordering. Theor. Comput. Sci. Kousha Etessami, Neil Immerman
1995	J	`jnl`	The Complexity of Iterated Multiplication Inf. Comput. Neil Immerman, Susan Landau
1995	A*	`conf`	Tree Canonization and Transitive Closure LICS Kousha Etessami, Neil Immerman
1994	A*	`conf`	A Syntactic Characterization of NP-Completeness LICS J. Antonio Medina, Neil Immerman
1994	A*	`conf`	Dyn-FO: A Parallel, Dynamic Complexity Class. PODS Sushant Patnaik, Neil Immerman
1994	J	`jnl`	McColm conjecture. CoRR Yuri Gurevich, Neil Immerman, Saharon Shelah
1994	A*	`conf`	McColm's Conjecture LICS Yuri Gurevich, Neil Immerman, Saharon Shelah
1994	A	`conf`	Reachability and the Power of Local Ordering. STACS Kousha Etessami, Neil Immerman
1994	—	`conf`	Time, Hardware, and Uniformity. SCT David A. Mix Barrington, Neil Immerman
1993	A	`conf`	A First-Order Isomorphism Theorem. STACS Eric Allender, José L. Balcázar, Neil Immerman
1992	J	`jnl`	An optimal lower bound on the number of variables for graph identification. Comb. Jin-Yi Cai, Martin Fürer, Neil Immerman
1991	—	`conf`	DSPACE[n SCT Neil Immerman
1991	A*	`conf`	The Expressiveness of a Family of Finite Set Languages. PODS Neil Immerman, Sushant Patnaik, David W. Stemple
1990	J	`jnl`	On Uniformity within NC¹. J. Comput. Syst. Sci. David A. Mix Barrington, Neil Immerman, Howard Straubing
1989	A*	`conf`	An Optimal Lower Bound on the Number of Variables for Graph Identification FOCS Jin-Yi Cai, Martin Fürer, Neil Immerman
1989	J	`jnl`	Definability with Bounded Number of Bound Variables Inf. Comput. Neil Immerman, Dexter Kozen
1989	B	`conf`	Descriptive and Computational Complexity. FCT Neil Immerman
1989	J	`jnl`	Expressibility and Parallel Complexity. SIAM J. Comput. Neil Immerman
1989	J	`jnl`	Relativizing Relativized Computations. Theor. Comput. Sci. Neil Immerman, Stephen R. Mahaney
1989	—	`conf`	The Complexity of Iterated Multiplication. SCT Neil Immerman, Susan Landau
1988	J	`jnl`	Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. Neil Immerman
1988	—	`conf`	Nondeterministic space is closed under complementation. SCT Neil Immerman
1988	—	`conf`	On uniformity within NC SCT David A. Mix Barrington, Neil Immerman, Howard Straubing
1987	A*	`conf`	Definability with Bounded Number of Bound Variables LICS Neil Immerman, Dexter Kozen
1987	—	`conf`	Expressibility as a complexity measure: results and directions. SCT Neil Immerman
1987	J	`jnl`	Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. Michael J. Fischer, Neil Immerman
1987	J	`jnl`	Languages that Capture Complexity Classes. SIAM J. Comput. Neil Immerman
1986	B	`conf`	Foundations of Knowledge for Distributed Systems. TARK Michael J. Fischer, Neil Immerman
1986	J	`jnl`	Relational Queries Computable in Polynomial Time Inf. Control. Neil Immerman
1985	A*	`conf`	On Complete Problems for NP$\cap$CoNP. ICALP Juris Hartmanis, Neil Immerman
1985	J	`jnl`	Sparse Sets in NP-P: EXPTIME versus NEXPTIME Inf. Control. Juris Hartmanis, Neil Immerman, Vivian Sewelson
1983	A*	`conf`	Languages Which Capture Complexity Classes (Preliminary Report) STOC Neil Immerman
1983	A*	`conf`	Sparse Sets in NP-P: EXPTIME versus NEXPTIME STOC Juris Hartmanis, Vivian Sewelson, Neil Immerman
1982	A*	`conf`	Relational Queries Computable in Polynomial Time (Extended Abstract) STOC Neil Immerman
1982	J	`jnl`	Upper and Lower Bounds for First Order Expressibility. J. Comput. Syst. Sci. Neil Immerman
1981	J	`jnl`	Number of Quantifiers is Better Than Number of Tape Cells. J. Comput. Syst. Sci. Neil Immerman
1980	—	`—`	First Order Expressibility as a New Complexity Measure. Neil Immerman
1980	A*	`conf`	Upper and Lower Bounds for First Order Expressibility FOCS Neil Immerman
1979	A*	`conf`	Length of Predicate Calculus Formulas as a New Complexity Measure FOCS Neil Immerman
1978	A*	`conf`	One-Way Log-Tape Reductions FOCS Juris Hartmanis, Neil Immerman, Stephen R. Mahaney