Neil Immerman
11 references under this name, matched as it is written. Somebody else may write under it too, and the same person may appear here spelled another way.
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
Shachar Itzhaky and others (2013) · Computer Aided Verification · Springer Berlin Heidelberg
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
Neil Immerman and others (2004) · Lecture notes in computer science · Springer Science+Business Media
DSPACE (n/sup k/)=VAR(k+1)
Neil Immerman (2002) · Structure in Complexity Theory Annual Conference
On the unusual effectiveness of logic in computer science
Joseph Y. Halpern and others (2001) · Bulletin of Symbolic Logic
Descriptive Complexity
Neil Immerman (1999) · Springer New York
Descriptive complexity: a logician's approach to computation
Neil Immerman (1995) · Notices of the American Mathematical Society
Nondeterministic space is closed under complementation
Neil Immerman (1988) · SIAM Journal on Computing
Languages that Capture Complexity Classes
Neil Immerman (1987) · SIAM Journal on Computing · Society for Industrial & Applied Mathematics (SIAM)
Relational queries computable in polynomial time
Neil Immerman (1986) · Elsevier BV
Upper and lower bounds for first-order expressibility
Neil Immerman (1982) · Journal of Computer and System Sciences
Number of quantifiers is better than number of tape cells
Neil Immerman (1981) · Journal of Computer and System Sciences · Elsevier BV