Neil Immerman

Получаване на мой собствен потребителски профил

Позовавания

	Всички	От 2019
Позовавания	14363	3519
h-индекс	46	26
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 318 324 465 354 471 446 485 530 473 504 542 477 533 477 545 506 548 588 674 656

Публичен достъп

Преглед на всички

12 статии

0 статии

налични

неналични

Въз основа на изисквания при финансирането

Съавтори

Shlomo ZilbersteinProfessor of Computer Science, University of Massachusetts AmherstПотвърден имейл адрес: cs.umass.edu
Mooly SagivTel Aviv UniversityПотвърден имейл адрес: acm.org
Siddharth SrivastavaArizona State UniversityПотвърден имейл адрес: asu.edu
Yanlei DiaoProfessor of Computer Science, University of Massachusetts AmherstПотвърден имейл адрес: cs.umass.edu
Phokion KolaitisDistinguished Research Professor, UC Santa Cuz and Principal Research Staff Member, IBM ResearchПотвърден имейл адрес: ucsc.edu
Jin-Yi CaiUniversity of Wisconsin - MadisonПотвърден имейл адрес: cs.wisc.edu
Howard StraubingProfessor of Computer Science Boston CollegeПотвърден имейл адрес: bc.edu
Thomas RepsJ. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus, CS Dept., Univ. of WisconsinПотвърден имейл адрес: cs.wisc.edu
Kousha EtessamiUniversity of EdinburghПотвърден имейл адрес: inf.ed.ac.uk
Shachar ItzhakyTel Aviv UniversityПотвърден имейл адрес: tau.ac.il
Martin FürerProfessor of Computer Science and Engineering, Pennsylvania State UniversityПотвърден имейл адрес: cse.psu.edu
Dexter KozenProfessor of Computer Science, Cornell UniversityПотвърден имейл адрес: cs.cornell.edu
Eric AllenderRutgers UniversityПотвърден имейл адрес: cs.rutgers.edu
Don TowsleyUniversity of MassachusettsПотвърден имейл адрес: cs.umass.edu

Следене

Neil Immerman

College of Computer and Information Sciences, UMass, Amherst

Потвърден имейл адрес: cs.umass.edu - Начална страница

logic in computer science descriptive complexity


Заглавие Сортиране по цитати Сортиране по година Сортиране по заглавие	Позовавания Позовавания	Година
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	2139	2002
Descriptive complexity N Immerman Springer Science & Business Media, 1998	1437	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	985	1982
Languages which capture complexity classes N Immerman Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983	872	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	862	1992
On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990	712	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	356	1990
Upper and lower bounds for first order expressibility N Immerman Journal of Computer and System Sciences 25 (1), 76-98, 1982	331	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	233	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	182	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	145	1987

Системата не може да изпълни операцията сега. Опитайте отново по-късно.

Статии 1–20

Позовавания годишно

Дублирани описания

Обединени библиографски описания

Добавяне на съавториСъавтори

Следене

Позовавания

Съавтори