Neil Immerman

Citado por

	Total	Desde 2019
Citas	14324	3483
Índice h	45	26
Índice i10	88	49

680

340

170

510

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202438 88 121 199 193 246 173 279 370 254 307 276 247 221 270 180 262 289 317 324 465 354 471 447 485 530 473 504 542 477 533 477 545 506 547 589 677 617

Acceso público

Ver todo

12 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Shlomo ZilbersteinProfessor of Computer Science, University of Massachusetts AmherstDirección de correo verificada de cs.umass.edu
Mooly SagivTel Aviv UniversityDirección de correo verificada de acm.org
Siddharth SrivastavaArizona State UniversityDirección de correo verificada de asu.edu
Yanlei DiaoProfessor of Computer Science, University of Massachusetts AmherstDirección de correo verificada de cs.umass.edu
Phokion KolaitisDistinguished Research Professor, UC Santa Cuz and Principal Research Staff Member, IBM ResearchDirección de correo verificada de ucsc.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonDirección de correo verificada de cs.wisc.edu
Howard StraubingProfessor of Computer Science Boston CollegeDirección de correo verificada de bc.edu
Thomas RepsJ. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus, CS Dept., Univ. of WisconsinDirección de correo verificada de cs.wisc.edu
Kousha EtessamiUniversity of EdinburghDirección de correo verificada de inf.ed.ac.uk
Shachar ItzhakyTel Aviv UniversityDirección de correo verificada de tau.ac.il
Martin FürerProfessor of Computer Science and Engineering, Pennsylvania State UniversityDirección de correo verificada de cse.psu.edu
Dexter KozenProfessor of Computer Science, Cornell UniversityDirección de correo verificada de cs.cornell.edu
Eric AllenderRutgers UniversityDirección de correo verificada de cs.rutgers.edu
Don TowsleyUniversity of MassachusettsDirección de correo verificada de cs.umass.edu

Seguir

Neil Immerman

College of Computer and Information Sciences, UMass, Amherst

Dirección de correo verificada de cs.umass.edu - Página principal

logic in computer science descriptive complexity


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	2131	2002
Descriptive complexity N Immerman Springer Science & Business Media, 1998	1431	1998
Nondeterministic space is closed under complementation N Immerman SIAM Journal on computing 17 (5), 935-938, 1988	1012	1988
Relational queries computable in polynomial time N Immerman Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982	984	1982
Languages which capture complexity classes N Immerman Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983	870	1983
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	858	1992
On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990	710	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	605	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	357	1990
Upper and lower bounds for first order expressibility N Immerman Journal of Computer and System Sciences 25 (1), 76-98, 1982	330	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	232	2014
Number of quantifiers is better than number of tape cells N Immerman Journal of Computer and System Sciences 22 (3), 384-406, 1981	229	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	213	1983
Definability with bounded number of bound variables N Immerman, D Kozen Information and Computation 83 (2), 121-139, 1989	192	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	180	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	160	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	145	1987

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores