| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marco Carmosino, Neil Immerman, Charles Jordan |
Experimental Descriptive Complexity.  |
Logic and Program Semantics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
A new representation and associated algorithms for generalized planning. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang |
Directed Search for Generalized Plans Using Classical Planners. |
ICAPS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Termination and Correctness Analysis of Cyclic Control. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner |
Qualitative Numeric Planning. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Haopeng Zhang, Yanlei Diao, Neil Immerman |
Recognizing Patterns in Streams with Imprecise Timestamps. |
PVLDB |
2010 |
DBLP BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Computing Applicability Conditions for Plans with Loops. |
ICAPS |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv |
A simple inductive synthesis methodology and its applications. |
OOPSLA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Crouch, Neil Immerman, J. Eliot B. Moss |
Finding Reductions Automatically. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Merging example plans into generalized plans for non-deterministic environments. |
AAMAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Weis, Neil Immerman |
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The complexity of satisfiability problems: Refining Schaefer's theorem. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Abstract Planning with Unknown Object Quantities and Properties. |
SARA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin |
First-Order and Temporal Logics for Nested Words. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin |
First-Order and Temporal Logics for Nested Words |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman |
On Supporting Kleene Closure over Event Streams. |
ICDE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Using Abstraction for Generalized Planning. |
ISAIM |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman |
Efficient pattern matching over event streams. |
SIGMOD Conference |
2008 |
DBLP DOI BibTeX RDF |
pattern matching, query optimization, event streams |
| 1 | Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein |
Learning Generalized Plans Using Abstract Counting. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Philipp Weis, Neil Immerman |
Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin |
First-Order and Temporal Logics for Nested Words. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps |
Constructing Specialized Shape Analyses for Uniform Change. |
VMCAI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Weis, Neil Immerman |
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philipp Weis, Neil Immerman |
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. |
Circuits, Logic, and Games |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tal Lev-Ami, Neil Immerman, Shmuel Sagiv |
Abstraction for Shape Analysis with Fast and Precise Transformers. |
CAV |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh |
Verification via Structure Simulation. |
CAV |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh |
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Neil Immerman |
An n! lower bound on formula size. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, temporal logic, Descriptive complexity |
| 1 | Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley |
Leader Election Algorithms for Wireless Ad Hoc Networks. |
DISCEX |
2003 |
DBLP DOI BibTeX RDF |
secure leader election, wireless ad hoc networks, self-stabilization, network protocols, formal specification and verification |
| 1 | Susan Landau, Neil Immerman |
Embedding Linkages on an Integer Lattice. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
NP-complete, Embedding, Lattice, Linkage |
| 1 | Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein |
The Complexity of Decentralized Control of Markov Decision Processes. |
Math. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hertz, Neil Immerman, J. Eliot B. Moss |
Framework for Analyzing Garbage Collection. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | William Hesse, Neil Immerman |
Complete Problems for Dynamic Complexity Classes. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Jonathan F. Buss, David A. Mix Barrington |
Number of Variables Is Equivalent to Space. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu |
On the unusual effectiveness of logic in computer science. |
Bulletin of Symbolic Logic |
2001 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman |
Progress in Descriptive Complexity. |
Current Trends in Theoretical Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien |
The Crane Beach Conjecture. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Neil Immerman |
An n! Lower Bound on Formula Size. |
LICS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Natasha Alechina, Neil Immerman |
Reachability Logic: An Efficient Fragment of Transitive Closure Logic. |
Logic Journal of the IGPL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Neil Immerman |
Tree Canonization and Transitive Closure. |
Inf. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman |
The Complexity of Decentralized Control of Markov Decision Processes. |
UAI |
2000 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman |
Progress in Descriptive Complexity. |
Bulletin of the EATCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman |
Descriptive complexity. |
|
1999 |
RDF |
|
| 1 | Neil Immerman |
Descriptive Complexity and Model Checking. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushant Patnaik, Neil Immerman |
Dyn-FO: A Parallel, Dynamic Complexity Class. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, José L. Balcázar, Neil Immerman |
A First-Order Isomorphism Theorem. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Moshe Y. Vardi |
Model Checking and Transitive-Closure Logic. |
CAV |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Sushant Patnaik, David W. Stemple |
The Expressiveness of a Family of Finite Set Languages. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Antonio Medina, Neil Immerman |
A Generalization of Fagin's Theorem. |
LICS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Phokion G. Kolaitis (eds.) |
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University |
Descriptive Complexity and Finite Models |
1996 |
DBLP BibTeX RDF |
|
| 1 | Kousha Etessami, Neil Immerman |
Reachability and the Power of Local Ordering. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Susan Landau |
The Complexity of Iterated Multiplication |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Neil Immerman |
Tree Canonization and Transitive Closure |
LICS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Neil Immerman |
Reachability and the Power of Local Ordering. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Antonio Medina, Neil Immerman |
A Syntactic Characterization of NP-Completeness |
LICS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Gurevich, Neil Immerman, Saharon Shelah |
McColm's Conjecture |
LICS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushant Patnaik, Neil Immerman |
Dyn-FO: A Parallel, Dynamic Complexity Class. |
PODS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman |
Time, Hardware, and Uniformity. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, José L. Balcázar, Neil Immerman |
A First-Order Isomorphism Theorem. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Martin Fürer, Neil Immerman |
An optimal lower bound on the number of variables for graph identifications. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Sushant Patnaik, David W. Stemple |
The Expressiveness of a Family of Finite Set Languages. |
PODS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
DSPACE[nk] = VAR[k+1]. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | David A. Mix Barrington, Neil Immerman, Howard Straubing |
On Uniformity within NC¹. |
J. Comput. Syst. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Stephen R. Mahaney |
Relativizing Relativized Computations. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Dexter Kozen |
Definability with Bounded Number of Bound Variables |
Inf. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Expressibility and Parallel Complexity. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Descriptive and Computational Complexity. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Jin-yi Cai, Martin Fürer, Neil Immerman |
An Optimal Lower Bound on the Number of Variables for Graph Identification |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
optimal lower bound, graph identification, lower bound, first-order logic |
| 1 | Neil Immerman, Susan Landau |
The Complexity of Iterated Multiplication. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman |
Nondeterministic Space is Closed Under Complementation. |
SIAM J. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Fischer, Neil Immerman |
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Languages that Capture Complexity Classes. |
SIAM J. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman, Dexter Kozen |
Definability with Bounded Number of Bound Variables |
LICS |
1987 |
DBLP BibTeX RDF |
|
| 1 | Neil Immerman |
Relational Queries Computable in Polynomial Time |
Information and Control |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Fischer, Neil Immerman |
Foundations of Knowledge for Distributed Systems. |
TARK |
1986 |
DBLP BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman, Vivian Sewelson |
Sparse Sets in NP-P: EXPTIME versus NEXPTIME |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman |
On Complete Problems for NP$\cap$CoNP. |
ICALP |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Vivian Sewelson, Neil Immerman |
Sparse Sets in NP-P: EXPTIME versus NEXPTIME |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Languages Which Capture Complexity Classes (Preliminary Report) |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Upper and Lower Bounds for First Order Expressibility. |
J. Comput. Syst. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Relational Queries Computable in Polynomial Time (Extended Abstract) |
STOC |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Number of Quantifiers is Better Than Number of Tape Cells. |
J. Comput. Syst. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Upper and Lower Bounds for First Order Expressibility |
FOCS |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Length of Predicate Calculus Formulas as a New Complexity Measure |
FOCS |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Juris Hartmanis, Neil Immerman, Stephen R. Mahaney |
One-Way Log-Tape Reductions |
FOCS |
1978 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")