The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Neil Immerman" ( http://dblp.L3S.de/Authors/Neil_Immerman )

URL (Homepage):  http://www.cs.umass.edu/~immerman/  Author page on DBLP  Author page in RDF  Community of Neil Immerman in ASPL-2

Publication years (Num. hits)
1978-1987 (16) 1988-1994 (20) 1995-2000 (15) 2001-2005 (17) 2006-2009 (16) 2010-2013 (18) 2014-2018 (16) 2019 (4)
Publication types (Num. hits)
article(55) book(1) incollection(1) inproceedings(64) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 16 occurrences of 15 keywords

Results
Found 123 publication records. Showing 122 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Neil Immerman, Rik Sengupta The k-Dimensional Weisfeiler-Leman Algorithm. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham Complexity and Information in Invariant Inference. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham Bounded Quantifier Instantiation for Checking Inductive Invariants. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2019 DBLP  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2018 DBLP  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2017 DBLP  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2017 DBLP  BibTeX  RDF
1Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham Bounded Quantifier Instantiation for Checking Inductive Invariants. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham Bounded Quantifier Instantiation for Checking Inductive Invariants. Search on Bibsonomy TACAS (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2016 DBLP  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2016 DBLP  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2016 DBLP  BibTeX  RDF
1Oded Padon, Neil Immerman, Sharon Shoham, Aleksandr Karbyshev, Mooly Sagiv Decidability of inferring inductive invariants. Search on Bibsonomy POPL The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou A Characterization of the Complexity of Resilience and Responsibility for Self-join-free Conjunctive Queries. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Cibele Freire, Wolfgang Gatterbauer, Neil Immerman, Alexandra Meliou The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries. (PDF / PS) Search on Bibsonomy PVLDB The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oded Padon, Neil Immerman, Aleksandr Karbyshev, Ori Lahav, Mooly Sagiv, Sharon Shoham Decentralizing SDN Policies. Search on Bibsonomy POPL The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Neil Immerman Complexity column. Search on Bibsonomy SIGLOG News The full citation details ... 2014 DBLP  BibTeX  RDF
1Shachar Itzhaky, Anindya Banerjee 0001, Neil Immerman, Ori Lahav, Aleksandar Nanevski, Mooly Sagiv Modular reasoning about heap paths via effectively propositional formulas. Search on Bibsonomy POPL The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Haopeng Zhang 0003, Yanlei Diao, Neil Immerman On complexity and optimization of expensive queries in complex event processing. Search on Bibsonomy SIGMOD Conference The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman The Complexity of Decentralized Control of Markov Decision Processes Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Haopeng Zhang 0003, Yanlei Diao, Neil Immerman Recognizing patterns in streams with imprecise timestamps. Search on Bibsonomy Inf. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Wentian Lu, Gerome Miklau, Neil Immerman Auditing a database under retention policies. Search on Bibsonomy VLDB J. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning. Search on Bibsonomy LPAR The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Shachar Itzhaky, Anindya Banerjee 0001, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv Effectively-Propositional Reasoning about Reachability in Linked Data Structures. Search on Bibsonomy CAV The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Applicability conditions for plans with loops: Computability results and algorithms. Search on Bibsonomy Artif. Intell. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marco Carmosino, Neil Immerman, Charles Jordan Experimental Descriptive Complexity. Search on Bibsonomy Logic and Program Semantics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christoph Reichenbach, Yannis Smaragdakis, Neil Immerman PQL: A Purely-Declarative Java Extension for Parallel Programming. Search on Bibsonomy ECOOP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein A new representation and associated algorithms for generalized planning. Search on Bibsonomy Artif. Intell. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Termination and Correctness Analysis of Cyclic Control. Search on Bibsonomy AAAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner Qualitative Numeric Planning. Search on Bibsonomy AAAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang Directed Search for Generalized Plans Using Classical Planners. Search on Bibsonomy ICAPS The full citation details ... 2011 DBLP  BibTeX  RDF
1Haopeng Zhang 0003, Yanlei Diao, Neil Immerman Recognizing Patterns in Streams with Imprecise Timestamps. (PDF / PS) Search on Bibsonomy PVLDB The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv A simple inductive synthesis methodology and its applications. Search on Bibsonomy OOPSLA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer What can the GC compute efficiently?: a language for heap assertions at GC time. Search on Bibsonomy OOPSLA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Crouch, Neil Immerman, J. Eliot B. Moss Finding Reductions Automatically. Search on Bibsonomy Fields of Logic and Computation The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Computing Applicability Conditions for Plans with Loops. Search on Bibsonomy ICAPS The full citation details ... 2010 DBLP  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Merging example plans into generalized plans for non-deterministic environments. Search on Bibsonomy AAMAS The full citation details ... 2010 DBLP  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The complexity of satisfiability problems: Refining Schaefer's theorem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Philipp Weis, Neil Immerman Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Tal 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 Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2009 DBLP  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Abstract Planning with Unknown Object Quantities and Properties. Search on Bibsonomy SARA The full citation details ... 2009 DBLP  BibTeX  RDF
1Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin First-Order and Temporal Logics for Nested Words Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin First-Order and Temporal Logics for Nested Words. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman On Supporting Kleene Closure over Event Streams. Search on Bibsonomy ICDE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman Efficient pattern matching over event streams. Search on Bibsonomy SIGMOD Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF pattern matching, query optimization, event streams
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Learning Generalized Plans Using Abstract Counting. Search on Bibsonomy AAAI The full citation details ... 2008 DBLP  BibTeX  RDF
1Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein Using Abstraction for Generalized Planning. Search on Bibsonomy ISAIM The full citation details ... 2008 DBLP  BibTeX  RDF
1Philipp Weis, Neil Immerman Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin First-Order and Temporal Logics for Nested Words. Search on Bibsonomy LICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps Constructing Specialized Shape Analyses for Uniform Change. Search on Bibsonomy VMCAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Philipp Weis, Neil Immerman Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tal Lev-Ami, Neil Immerman, Shmuel Sagiv Abstraction for Shape Analysis with Fast and Precise Transformers. Search on Bibsonomy CAV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Philipp Weis, Neil Immerman Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. Search on Bibsonomy Circuits, Logic, and Games The full citation details ... 2006 DBLP  BibTeX  RDF
1David 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. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tal 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. Search on Bibsonomy CADE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh Verification via Structure Simulation. Search on Bibsonomy CAV The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. Search on Bibsonomy CSL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Micah Adler, Neil Immerman An n! lower bound on formula size. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bounds, temporal logic, Descriptive complexity
1Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley Leader Election Algorithms for Wireless Ad Hoc Networks. Search on Bibsonomy DISCEX (1) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF secure leader election, wireless ad hoc networks, self-stabilization, network protocols, formal specification and verification
1Susan Landau 0001, Neil Immerman Embedding Linkages on an Integer Lattice. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF NP-complete, Embedding, Lattice, Linkage
1Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein The Complexity of Decentralized Control of Markov Decision Processes. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1William Hesse, Neil Immerman Complete Problems for Dynamic Complexity Classes. Search on Bibsonomy LICS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Matthew Hertz, Neil Immerman, J. Eliot B. Moss Framework for Analyzing Garbage Collection. Search on Bibsonomy IFIP TCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Jonathan F. Buss, David A. Mix Barrington Number of Variables Is Equivalent to Space. Search on Bibsonomy J. Symb. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Joseph Y. Halpern, Robert Harper 0001, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu On the unusual effectiveness of logic in computer science. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Neil Immerman Progress in Descriptive Complexity. Search on Bibsonomy Current Trends in Theoretical Computer Science The full citation details ... 2001 DBLP  BibTeX  RDF
1Micah Adler, Neil Immerman An n! Lower Bound on Formula Size. Search on Bibsonomy LICS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien The Crane Beach Conjecture. Search on Bibsonomy LICS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Natasha Alechina, Neil Immerman Reachability Logic: An Efficient Fragment of Transitive Closure Logic. Search on Bibsonomy Logic Journal of the IGPL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Neil Immerman Tree Canonization and Transitive Closure. Search on Bibsonomy Inf. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman The Complexity of Decentralized Control of Markov Decision Processes. Search on Bibsonomy UAI The full citation details ... 2000 DBLP  BibTeX  RDF
1Neil Immerman Progress in Descriptive Complexity. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1999 DBLP  BibTeX  RDF
1Neil Immerman Descriptive complexity. Search on Bibsonomy 1999   DOI  RDF
1Neil Immerman Descriptive Complexity and Model Checking. Search on Bibsonomy FSTTCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Sushant Patnaik, Neil Immerman Dyn-FO: A Parallel, Dynamic Complexity Class. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Eric Allender, José L. Balcázar, Neil Immerman A First-Order Isomorphism Theorem. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Moshe Y. Vardi Model Checking and Transitive-Closure Logic. Search on Bibsonomy CAV The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Sushant Patnaik, David W. Stemple The Expressiveness of a Family of Finite Set Languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1J. Antonio Medina, Neil Immerman A Generalization of Fagin's Theorem. Search on Bibsonomy LICS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Phokion G. Kolaitis (eds.) Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996 Search on Bibsonomy Descriptive Complexity and Finite Models The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Neil Immerman Reachability and the Power of Local Ordering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Susan Landau 0001 The Complexity of Iterated Multiplication Search on Bibsonomy Inf. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Neil Immerman Tree Canonization and Transitive Closure Search on Bibsonomy LICS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Yuri Gurevich, Neil Immerman, Saharon Shelah McColm conjecture. Search on Bibsonomy CoRR The full citation details ... 1994 DBLP  BibTeX  RDF
1J. Antonio Medina, Neil Immerman A Syntactic Characterization of NP-Completeness Search on Bibsonomy LICS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Yuri Gurevich, Neil Immerman, Saharon Shelah McColm's Conjecture Search on Bibsonomy LICS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Sushant Patnaik, Neil Immerman Dyn-FO: A Parallel, Dynamic Complexity Class. Search on Bibsonomy PODS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Kousha Etessami, Neil Immerman Reachability and the Power of Local Ordering. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman Time, Hardware, and Uniformity. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Eric Allender, José L. Balcázar, Neil Immerman A First-Order Isomorphism Theorem. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Jin-yi Cai, Martin Fürer, Neil Immerman An optimal lower bound on the number of variables for graph identifications. Search on Bibsonomy Combinatorica The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Sushant Patnaik, David W. Stemple The Expressiveness of a Family of Finite Set Languages. Search on Bibsonomy PODS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Neil Immerman DSPACE[nk] = VAR[k+1]. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman, Howard Straubing On Uniformity within NC¹. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Stephen R. Mahaney Relativizing Relativized Computations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Neil Immerman, Dexter Kozen Definability with Bounded Number of Bound Variables Search on Bibsonomy Inf. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Neil Immerman Expressibility and Parallel Complexity. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 122 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license