| 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 | 2174 | 2002 |
| Descriptive complexity N Immerman Springer Science & Business Media, 1998 | 1449 | 1998 |
| Nondeterministic space is closed under complementation N Immerman SIAM Journal on computing 17 (5), 935-938, 1988 | 1016 | 1988 |
| Relational queries computable in polynomial time N Immerman Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 990 | 1982 |
| 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 | 875 | 1992 |
| Languages which capture complexity classes N Immerman Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 873 | 1983 |
| On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990 | 715 | 1990 |
| 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 | 607 | 2008 |
| Describing graphs: A first-order approach to graph canonization N Immerman, E Lander Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion …, 1990 | 358 | 1990 |
| Upper and lower bounds for first order expressibility N Immerman Journal of Computer and System Sciences 25 (1), 76-98, 1982 | 333 | 1982 |
| 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 | 234 | 2014 |
| Number of quantifiers is better than number of tape cells N Immerman Journal of Computer and System Sciences 22 (3), 384-406, 1981 | 230 | 1981 |
| Sparse sets in np-p: exptime versus nexptime J Hartmanis, V Sewelson, N Immerman Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 214 | 1983 |
| Definability with bounded number of bound variables N Immerman, D Kozen Information and Computation 83 (2), 121-139, 1989 | 193 | 1989 |
| On the unusual effectiveness of logic in computer science JY Halpern, R Harper, N Immerman, PG Kolaitis, MY Vardi, V Vianu Bulletin of Symbolic Logic 7 (2), 213-236, 2001 | 184 | 2001 |
| Descriptive and computational complexity N Immerman Computational Complexity Theory 38, 75-91, 1989 | 174 | 1989 |
| Expressibility and parallel complexity N Immerman SIAM Journal on Computing 18 (3), 625-638, 1989 | 170 | 1989 |
| Dyn-FO (preliminary version): a parallel, dynamic complexity class S Patnaik, N Immerman Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1994 | 161 | 1994 |
| 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 | 151 | 2003 |
| Expressibility as a complexity measure: results and directions N Immerman Proceeding Structure in Complexity Theory, 194-202, 1987 | 146 | 1987 |
Shlomo ZilbersteinProfessor of Computer Science, University of Massachusetts Amherst確認したメール アドレス: cs.umass.edu
