Neil Immerman

Citado por

	Todos	Desde 2020
Citações	14632	3148
Índice h	46	24
Índice i10	88	47

740

370

185

555

19871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202539 86 128 199 198 250 178 285 379 247 308 289 251 227 272 178 267 299 322 326 471 355 477 452 484 531 478 503 551 476 527 480 537 522 540 582 678 729 96

Acesso público

Ver tudo

12 artigos

0 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Shlomo ZilbersteinProfessor of Computer Science, University of Massachusetts AmherstEmail confirmado em cs.umass.edu
Mooly SagivTel Aviv UniversityEmail confirmado em acm.org
Siddharth SrivastavaArizona State UniversityEmail confirmado em asu.edu
Yanlei DiaoProfessor of Computer Science, University of Massachusetts AmherstEmail confirmado em cs.umass.edu
Phokion KolaitisDistinguished Research Professor, UC Santa Cuz and Principal Research Staff Member, IBM ResearchEmail confirmado em ucsc.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonEmail confirmado em cs.wisc.edu
Howard StraubingProfessor of Computer Science Boston CollegeEmail confirmado em bc.edu
Thomas RepsJ. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus, CS Dept., Univ. of WisconsinEmail confirmado em cs.wisc.edu
Kousha EtessamiUniversity of EdinburghEmail confirmado em inf.ed.ac.uk
Shachar ItzhakyTechnionEmail confirmado em cs.technion.ac.il
Martin FürerProfessor of Computer Science and Engineering, Pennsylvania State UniversityEmail confirmado em cse.psu.edu
Dexter KozenProfessor of Computer Science, Cornell UniversityEmail confirmado em cs.cornell.edu
Eric AllenderRutgers UniversityEmail confirmado em cs.rutgers.edu
Don TowsleyUniversity of MassachusettsEmail confirmado em cs.umass.edu

Seguir

Neil Immerman

College of Computer and Information Sciences, UMass, Amherst

Email confirmado em cs.umass.edu - Página inicial

logic in computer science descriptive complexity


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	2181	2002
Descriptive complexity N Immerman Springer Science & Business Media, 1998	1462	1998
Nondeterministic space is closed under complementation N Immerman SIAM Journal on computing 17 (5), 935-938, 1988	1022	1988
Relational queries computable in polynomial time N Immerman Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982	1000	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	887	1992
Languages which capture complexity classes N Immerman Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983	879	1983
On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990	732	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	602	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	362	1990
Upper and lower bounds for first order expressibility N Immerman Journal of Computer and System Sciences 25 (1), 76-98, 1982	339	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	236	2014
Number of quantifiers is better than number of tape cells N Immerman Journal of Computer and System Sciences 22 (3), 384-406, 1981	234	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	219	1983
Definability with bounded number of bound variables N Immerman, D Kozen Information and Computation 83 (2), 121-139, 1989	195	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	181	2001
Descriptive and Computational Complexity. N Immerman FCT, 244-245, 1989	177	1989
Expressibility and parallel complexity N Immerman SIAM Journal on Computing 18 (3), 625-638, 1989	174	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	164	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	155	2003
Expressibility as a complexity measure: results and directions N Immerman Proceeding Structure in Complexity Theory, 194-202, 1987	151	1987

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores