☰

Neil Immerman

Affiliations: 
University of Massachusetts, Amherst, Amherst, MA 
Area:
Computer Science
Google:
"Neil Immerman"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
William M. Hesse grad student 2003 U Mass Amherst
Siddharth Srivastava grad student 2010 U Mass Amherst
Philipp Weis grad student 2011 U Mass Amherst

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Srivastava S, Immerman N, Zilberstein S. (2012) Applicability conditions for plans with loops: Computability results and algorithms Artificial Intelligence. 191: 1-19
Srivastava S, Immerman N, Zilberstein S. (2011) A new representation and associated algorithms for generalized planning Artificial Intelligence. 175: 615-647
Alur R, Arenas M, Barceló P, et al. (2008) First-order and temporal logics for nested words Logical Methods in Computer Science. 4
Weis P, Immerman N. (2007) Structure theorem and strict alternation hierarchy for FO2 on words Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4646: 343-357
Lev-Ami T, Immerman N, Reps T, et al. (2005) Simulating reachability using first-order logic with applications to verification of linked data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3632: 99-115
Allender E, Bauland M, Immerman N, et al. (2005) The complexity of satisfiability problems: Refining Schaefer's theorem Lecture Notes in Computer Science. 3618: 71-82
Barrington DAM, Immerman N, Lautemann C, et al. (2005) First-order expressibility of languages with neutral letters or: The Crane Beach conjecture Journal of Computer and System Sciences. 70: 101-127
Adler M, Immerman N. (2003) An n ! lower bound on formula size Acm Transactions On Computational Logic. 4: 296-314
Bernstein DS, Givan R, Immerman N, et al. (2002) The Complexity of Decentralized Control of Markov Decision Processes Mathematics of Operations Research. 27: 819-840
Landau S, Immerman N. (2002) Embedding linkages on an integer lattice Algorithmica (New York). 32: 423-436
See more...