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
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.
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.