Neil Immerman
Neil Immerman
College of Computer and Information Sciences, UMass, Amherst
Verified email at - Homepage
Cited by
Cited by
The complexity of decentralized control of Markov decision processes
DS Bernstein, R Givan, N Immerman, S Zilberstein
Mathematics of operations research 27 (4), 819-840, 2002
Descriptive complexity
N Immerman
Springer Science & Business Media, 2012
Nondeterministic space is closed under complementation
N Immerman
SIAM Journal on computing 17 (5), 935-938, 1988
Relational queries computable in polynomial time
N Immerman
Information and control 68 (1-3), 86-104, 1986
Languages that capture complexity classes
N Immerman
SIAM Journal on Computing 16 (4), 760-778, 1987
On uniformity within NC1
DAM Barrington, N Immerman, H Straubing
Journal of Computer and System Sciences 41 (3), 274-306, 1990
An optimal lower bound on the number of variables for graph identification
JY Cai, M Fürer, N Immerman
Combinatorica 12 (4), 389-410, 1992
Efficient pattern matching over event streams
J Agrawal, Y Diao, D Gyllstrom, N Immerman
Proceedings of the 2008 ACM SIGMOD international conference on Management of …, 2008
Upper and lower bounds for first order expressibility
N Immerman
Journal of Computer and System Sciences 25 (1), 76-98, 1982
Describing graphs: A first-order approach to graph canonization
N Immerman, E Lander
Complexity theory retrospective, 59-81, 1990
Number of quantifiers is better than number of tape cells
N Immerman
Journal of Computer and System Sciences 22 (3), 384-406, 1981
Sparse sets in NP-P: Exptime versus nexptime
J Hartmanis, N Immerman, V Sewelson
Information and Control 65 (2-3), 158-181, 1985
Definability with bounded number of bound variables
N Immerman, D Kozen
Information and Computation 83 (2), 121-139, 1989
Descriptive and computational complexity
N Immerman
Computational Complexity Theory, ed. J. Hartmanis, Proc. Symp. in Applied …, 1989
Expressibility and parallel complexity
N Immerman
SIAM Journal on Computing 18 (3), 625-638, 1989
On complexity and optimization of expensive queries in complex event processing
H Zhang, Y Diao, N Immerman
Proceedings of the 2014 ACM SIGMOD international conference on Management of …, 2014
On the unusual effectiveness of logic in computer science
JY Halpern, R Harper, N Immerman, PG Kolaitis, MY Vardi, V Vianu
The Bulletin of Symbolic Logic 7 (2), 213-236, 2001
Leader election algorithms for wireless ad hoc networks
S Vasudevan, B DeCleene, N Immerman, J Kurose, D Towsley
Proceedings DARPA Information Survivability Conference and Exposition 1, 261-272, 2003
Expressibility as a complexity measure: results and directions
N Immerman
Yale University. Department of Computer Science, 1987
On supporting kleene closure over event streams
D Gyllstrom, J Agrawal, Y Diao, N Immerman
2008 IEEE 24th International Conference on Data Engineering, 1391-1393, 2008
The system can't perform the operation now. Try again later.
Articles 1–20