A Simple Inductive Synthesis Methodology and its
Applications, Shachar Itzhaky, Sumit Gulwani, Neil
Immerman and Mooly Sagiv, OOPSLA '10 Proceedings of the ACM International Conference on Object Oriented
Programming Systems Languages and Applications, 2010
Michael Crouch, Neil Immerman, and J. Eliot
B. Moss, Finding Reductions Automatically, in Fields of
Logic and Computation: Essays
Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, A. Blass,
N. Dershowitz, and W. Reisig, eds., (2010), Springer, 181 - 200.
Sushant Patnaik, Neil Immerman PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1994
D.M. Barrington,
N. Immerman, Time, Hardware, and
Uniformity, in Complexity Theory Retrospective II,
L. Hemaspaandra and A. Selman, editors, 1997, Springer-Verlag, 1-22. A preliminary
version of this paper appeared in Ninth IEEE Structure in Complexity Theory
Symposium (1994), 176- 185.
J.A. Medina and N. Immerman, A Syntactic
Characterization of NP-Completeness, IEEE Logic In Computer Science
Symp. (1994), 241-250.
Susan Landau and N. Immerman, The Similarities
(and Differences) between Polynomials and Integers, International
Conference on Number Theoretic and Algebraic Methods in Computer Science
(1993), 57-59.
N. Immerman, Descriptive
and Computational Complexity, in Computational Complexity Theory, ed.
J. Hartmanis, Lecture Notes for AMS Short Course on ComputationComplexity
Theory, Proc. Symp. in Applied Math. 38, American Mathematical
Society (1989), 75-91.
N. Immerman, "Number
of Quantifiers is Better Than Number of Tape Cells",
JCSS 22(3) (1981), 384-406. A preliminary version appeared as,
``Length of Predicate Calculus Formulas as a New Complexity
Measure,'' 20th IEEE FOCS Symp. (1979), 337-347. I don't
have the journal version on line, but here is a
tech report version from Cornell, Feb. 1, 1980, that looks pretty
close to the journal version.