Neil Immerman

	2012
91		Marco Carmosino, Neil Immerman, Charles Jordan: Experimental Descriptive Complexity. Logic and Program Semantics 2012: 24-34
	2011
90		Siddharth Srivastava, Shlomo Zilberstein, Neil Immerman, Hector Geffner: Qualitative Numeric Planning. AAAI 2011
89		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Termination and Correctness Analysis of Cyclic Control. AAAI 2011
88		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein, Tianjiao Zhang: Directed Search for Generalized Plans Using Classical Planners. ICAPS 2011
87		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: A new representation and associated algorithms for generalized planning. Artif. Intell. 175(2): 615-647 (2011)
	2010
86		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Merging example plans into generalized plans for non-deterministic environments. AAMAS 2010: 1341-1348
85		Michael Crouch, Neil Immerman, J. Eliot B. Moss: Finding Reductions Automatically. Fields of Logic and Computation 2010: 181-200
84		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Computing Applicability Conditions for Plans with Loops. ICAPS 2010: 161-168
83		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: 256-269
82		Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv: A simple inductive synthesis methodology and its applications. OOPSLA 2010: 36-46
81		Haopeng Zhang, Yanlei Diao, Neil Immerman: Recognizing Patterns in Streams with Imprecise Timestamps. PVLDB 3(1): 244-255 (2010)
	2009
80		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Abstract Planning with Unknown Object Quantities and Properties. SARA 2009
79		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): 245-254 (2009)
78		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 5(2): (2009)
77		Philipp Weis, Neil Immerman: Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words Logical Methods in Computer Science 5(3): (2009)
	2008
76		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Learning Generalized Plans Using Abstract Counting. AAAI 2008: 991-997
75		Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman: On Supporting Kleene Closure over Event Streams. ICDE 2008: 1391-1393
74		Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein: Using Abstraction for Generalized Planning. ISAIM 2008
73		Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman: Efficient pattern matching over event streams. SIGMOD Conference 2008: 147-160
72		Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin: First-Order and Temporal Logics for Nested Words CoRR abs/0811.0537: (2008)
71		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 4(4): (2008)
	2007
70		Philipp Weis, Neil Immerman: Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. CSL 2007: 343-357
69		Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin: First-Order and Temporal Logics for Nested Words. LICS 2007: 151-160
68		Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps: Constructing Specialized Shape Analyses for Uniform Change. VMCAI 2007: 215-233
67		Philipp Weis, Neil Immerman: Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words. Electronic Colloquium on Computational Complexity (ECCC) 14(008): (2007)
	2006
66		Tal Lev-Ami, Neil Immerman, Shmuel Sagiv: Abstraction for Shape Analysis with Fast and Precise Transformers. CAV 2006: 547-561
65		Philipp Weis, Neil Immerman: Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. Circuits, Logic, and Games 2006
	2005
64		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: 99-115
63		Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
62		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): 101-127 (2005)
	2004
61		Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: Verification via Structure Simulation. CAV 2004: 281-294
60		Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174
59		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)(100): (2004)
	2003
58		Sudarshan Vasudevan, Brian DeCleene, Neil Immerman, James F. Kurose, Donald F. Towsley: Leader Election Algorithms for Wireless Ad Hoc Networks. DISCEX (1) 2003: 261-272
57		Micah Adler, Neil Immerman: An n! lower bound on formula size. ACM Trans. Comput. Log. 4(3): 296-314 (2003)
	2002
56		Matthew Hertz, Neil Immerman, J. Eliot B. Moss: Framework for Analyzing Garbage Collection. IFIP TCS 2002: 230-242
55		William Hesse, Neil Immerman: Complete Problems for Dynamic Complexity Classes. LICS 2002: 313-
54		Susan Landau, Neil Immerman: Embedding Linkages on an Integer Lattice. Algorithmica 32(3): 423-436 (2002)
53		Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein: The Complexity of Decentralized Control of Markov Decision Processes. Math. Oper. Res. 27(4): 819-840 (2002)
	2001
52		David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien: The Crane Beach Conjecture. LICS 2001: 187-196
51		Micah Adler, Neil Immerman: An n! Lower Bound on Formula Size. LICS 2001: 197-206
50		Neil Immerman: Progress in Descriptive Complexity. Current Trends in Theoretical Computer Science 2001: 71-82
49		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 7(2): 213-236 (2001)
48		Neil Immerman, Jonathan F. Buss, David A. Mix Barrington: Number of Variables Is Equivalent to Space. J. Symb. Log. 66(3): 1217-1230 (2001)
	2000
47		Daniel S. Bernstein, Shlomo Zilberstein, Neil Immerman: The Complexity of Decentralized Control of Markov Decision Processes. UAI 2000: 32-37
46		Kousha Etessami, Neil Immerman: Tree Canonization and Transitive Closure. Inf. Comput. 157(1-2): 2-24 (2000)
45		Natasha Alechina, Neil Immerman: Reachability Logic: An Efficient Fragment of Transitive Closure Logic. Logic Journal of the IGPL 8(3): 325-337 (2000)
	1999
44		Neil Immerman: Descriptive complexity. Springer 1999: I-XVI, 1-268
43		Neil Immerman: Progress in Descriptive Complexity. Bulletin of the EATCS 67: 72-81 (1999)
	1998
42		Neil Immerman: Descriptive Complexity and Model Checking. FSTTCS 1998: 1-5
	1997
41		Neil Immerman, Moshe Y. Vardi: Model Checking and Transitive-Closure Logic. CAV 1997: 291-302
40		Sushant Patnaik, Neil Immerman: Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci. 55(2): 199-209 (1997)
39		Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. SIAM J. Comput. 26(2): 557-567 (1997)
	1996
38		Neil Immerman, Phokion G. Kolaitis: Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University American Mathematical Society 1996
37		J. Antonio Medina, Neil Immerman: A Generalization of Fagin's Theorem. LICS 1996: 2-12
36		Neil Immerman, Sushant Patnaik, David W. Stemple: The Expressiveness of a Family of Finite Set Languages. Theor. Comput. Sci. 155(1): 111-140 (1996)
	1995
35		Kousha Etessami, Neil Immerman: Tree Canonization and Transitive Closure LICS 1995: 331-341
34		Neil Immerman, Susan Landau: The Complexity of Iterated Multiplication Inf. Comput. 116(1): 103-116 (1995)
33		Kousha Etessami, Neil Immerman: Reachability and the Power of Local Ordering. Theor. Comput. Sci. 148(2): 261-279 (1995)
	1994
32		Yuri Gurevich, Neil Immerman, Saharon Shelah: McColm's Conjecture LICS 1994: 10-19
31		J. Antonio Medina, Neil Immerman: A Syntactic Characterization of NP-Completeness LICS 1994: 241-250
30		Sushant Patnaik, Neil Immerman: Dyn-FO: A Parallel, Dynamic Complexity Class. PODS 1994: 210-221
29		Kousha Etessami, Neil Immerman: Reachability and the Power of Local Ordering. STACS 1994: 123-135
28		David A. Mix Barrington, Neil Immerman: Time, Hardware, and Uniformity. Structure in Complexity Theory Conference 1994: 176-185
	1993
27		Eric Allender, José L. Balcázar, Neil Immerman: A First-Order Isomorphism Theorem. STACS 1993: 163-174
	1992
26		Jin-yi Cai, Martin Fürer, Neil Immerman: An optimal lower bound on the number of variables for graph identifications. Combinatorica 12(4): 389-410 (1992)
	1991
25		Neil Immerman, Sushant Patnaik, David W. Stemple: The Expressiveness of a Family of Finite Set Languages. PODS 1991: 37-52
24		Neil Immerman: DSPACE[nk] = VAR[k+1]. Structure in Complexity Theory Conference 1991: 334-340
	1990
23		David A. Mix Barrington, Neil Immerman, Howard Straubing: On Uniformity within NC¹. J. Comput. Syst. Sci. 41(3): 274-306 (1990)
	1989
22		Neil Immerman: Descriptive and Computational Complexity. FCT 1989: 244-245
21		Jin-yi Cai, Martin Fürer, Neil Immerman: An Optimal Lower Bound on the Number of Variables for Graph Identification FOCS 1989: 612-617
20		Neil Immerman, Susan Landau: The Complexity of Iterated Multiplication. Structure in Complexity Theory Conference 1989: 104-111
19		Neil Immerman, Dexter Kozen: Definability with Bounded Number of Bound Variables Inf. Comput. 83(2): 121-139 (1989)
18		Neil Immerman: Expressibility and Parallel Complexity. SIAM J. Comput. 18(3): 625-638 (1989)
17		Neil Immerman, Stephen R. Mahaney: Relativizing Relativized Computations. Theor. Comput. Sci. 68(3): 267-276 (1989)
	1988
16		Neil Immerman: Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. 17(5): 935-938 (1988)
	1987
15		Neil Immerman, Dexter Kozen: Definability with Bounded Number of Bound Variables LICS 1987: 236-244
14		Michael J. Fischer, Neil Immerman: Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. Inf. Process. Lett. 25(3): 175-181 (1987)
13		Neil Immerman: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778 (1987)
	1986
12		Michael J. Fischer, Neil Immerman: Foundations of Knowledge for Distributed Systems. TARK 1986: 171-185
11		Neil Immerman: Relational Queries Computable in Polynomial Time Information and Control 68(1-3): 86-104 (1986)
	1985
10		Juris Hartmanis, Neil Immerman: On Complete Problems for NP$\cap$CoNP. ICALP 1985: 250-259
9		Juris Hartmanis, Neil Immerman, Vivian Sewelson: Sparse Sets in NP-P: EXPTIME versus NEXPTIME Information and Control 65(2/3): 158-181 (1985)
	1983
8		Neil Immerman: Languages Which Capture Complexity Classes (Preliminary Report) STOC 1983: 347-354
7		Juris Hartmanis, Vivian Sewelson, Neil Immerman: Sparse Sets in NP-P: EXPTIME versus NEXPTIME STOC 1983: 382-391
	1982
6		Neil Immerman: Relational Queries Computable in Polynomial Time (Extended Abstract) STOC 1982: 147-152
5		Neil Immerman: Upper and Lower Bounds for First Order Expressibility. J. Comput. Syst. Sci. 25(1): 76-98 (1982)
	1981
4		Neil Immerman: Number of Quantifiers is Better Than Number of Tape Cells. J. Comput. Syst. Sci. 22(3): 384-406 (1981)
	1980
3		Neil Immerman: Upper and Lower Bounds for First Order Expressibility FOCS 1980: 74-82
	1979
2		Neil Immerman: Length of Predicate Calculus Formulas as a New Complexity Measure FOCS 1979: 337-347
	1978
1		Juris Hartmanis, Neil Immerman, Stephen R. Mahaney: One-Way Log-Tape Reductions FOCS 1978: 65-72

Coauthor Index

1	Micah Adler	[51] [57]
2	Edward Aftandilian	[83]
3	Jagrati Agrawal	[73] [75]
4	Natasha Alechina	[45]
5	Eric Allender	[27] [39] [59] [63] [79]
6	Rajeev Alur	[69] [71] [72]
7	Marcelo Arenas	[69] [71] [72]
8	José L. Balcázar	[27] [39]
9	Pablo Barceló	[69] [71] [72]
10	David A. Mix Barrington	[23] [28] [48] [52] [62]
11	Michael Bauland	[59] [63] [79]
12	Daniel S. Bernstein	[47] [53]
13	Jonathan F. Buss	[48]
14	Jin-Yi Cai (Jin-yi Cai)	[21] [26]
15	Marco Carmosino	[91]
16	Michael Crouch	[85]
17	Brian DeCleene	[58]
18	Yanlei Diao	[73] [75] [81]
19	Kousha Etessami	[29] [33] [35] [46] [69] [71] [72]
20	Michael J. Fischer	[12] [14]
21	Martin Fürer	[21] [26]
22	Hector Geffner	[90]
23	Robert Givan (Bob Givan)	[53]
24	Sumit Gulwani	[82]
25	Yuri Gurevich	[32]
26	Samuel Z. Guyer	[83]
27	Daniel Gyllstrom	[73] [75]
28	Joseph Y. Halpern	[49]
29	Robert Harper	[49]
30	Juris Hartmanis	[1] [7] [9] [10]
31	Matthew Hertz	[56]
32	William Hesse	[55]
33	Shachar Itzhaky	[82]
34	Charles Jordan (Skip Jordan)	[91]
35	Phokion G. Kolaitis	[38] [49]
36	Dexter Kozen	[15] [19]
37	James F. Kurose (Jim Kurose)	[58]
38	Susan Landau	[20] [34] [54]
39	Clemens Lautemann	[52] [62]
40	Tal Lev-Ami	[64] [66] [68] [78]
41	Leonid Libkin	[69] [71] [72]
42	Stephen R. Mahaney	[1] [17]
43	J. Antonio Medina	[31] [37]
44	J. Eliot B. Moss	[56] [85]
45	Sushant Patnaik	[25] [30] [36] [40]
46	Alexander Moshe Rabinovich (Alexander Rabinovich)	[60] [61]
47	Christoph Reichenbach	[83]
48	Thomas W. Reps	[60] [61] [64] [68] [78]
49	Shmuel Sagiv (Mooly Sagiv)	[60] [61] [64] [66] [68] [78] [82]
50	Henning Schnoor	[59] [63] [79]
51	Nicole Schweikardt	[52] [62]
52	Vivian Sewelson	[7] [9]
53	Saharon Shelah	[32]
54	Yannis Smaragdakis	[83]
55	Siddharth Srivastava	[64] [74] [76] [78] [80] [84] [86] [87] [88] [89] [90]
56	David W. Stemple	[25] [36]
57	Howard Straubing	[23]
58	Denis Thérien	[52] [62]
59	Donald F. Towsley (Don Towsley)	[58]
60	Moshe Y. Vardi	[41] [49]
61	Sudarshan Vasudevan	[58]
62	Victor Vianu	[49]
63	Heribert Vollmer	[59] [63] [79]
64	Philipp Weis	[65] [67] [70] [77]
65	Greta Yorsh	[60] [61] [64] [78]
66	Haopeng Zhang	[81]
67	Tianjiao Zhang	[88]
68	Shlomo Zilberstein	[47] [53] [74] [76] [80] [84] [86] [87] [88] [89] [90]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page