Heribert Vollmer

Citado por

	Todos	Desde 2017
Citações	3541	939
Índice h	32	17
Índice i10	65	27

200

100

150

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202215 25 19 59 76 65 54 78 52 105 108 124 93 140 142 195 191 133 200 150 165 161 170 196 156 194 154 141 96

Acesso público

Ver todos

39 artigos

5 artigos

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Arne MeierPrivatdozent, Institute of Theoretical Computer Science, Leibniz Universität HannoverE-mail confirmado em thi.uni-hannover.de
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel UniversityE-mail confirmado em ti.informatik.uni-kiel.de
Juha KontinenProfessor, University of Helsinki, FinlandE-mail confirmado em helsinki.fi
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityE-mail confirmado em udo.edu
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyE-mail confirmado em uni-jena.de
Thomas SchneiderDept. of Mathematics and Computer Science, University of Bremen, GermanyE-mail confirmado em uni-bremen.de
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterE-mail confirmado em cs.rochester.edu
Eric AllenderRutgers UniversityE-mail confirmado em cs.rutgers.edu
Jonni VirtemaLecturer, University of Sheffield, UKE-mail confirmado em sheffield.ac.uk
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteE-mail confirmado em cmi.ac.in
Edith HemaspaandraProfessor of Computer Science, RITE-mail confirmado em cs.rit.edu
Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaE-mail confirmado em imsc.res.in
Miika HannulaUniversity of HelsinkiE-mail confirmado em helsinki.fi
Antti KuusistoAcademy Research Fellow, University of HelsinkiE-mail confirmado em helsinki.fi
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)E-mail confirmado em buffalo.edu
Frederic GreenClark UniversityE-mail confirmado em clarku.edu
Raghavendra Rao B VIIT MadrasE-mail confirmado em cse.iitm.ac.in
Georg GottlobProfessor of Informatics, University of OxfordE-mail confirmado em cs.ox.ac.uk
Manindra AgrawalProfessor of Computer Science, IIT KanpurE-mail confirmado em iitk.ac.in
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

Seguir

Heribert Vollmer

Professor für Theoretische Informatik, Leibniz Universität Hannover

E-mail confirmado em thi.uni-hannover.de - Página inicial

Komplexitätstheorie Logik


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Introduction to circuit complexity: a uniform approach H Vollmer Springer Science & Business Media, 1999	723	1999
Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory E Böhler, N Creignou, S Reith, H Vollmer SIGACT News, 2003	143	2003
On the power of polynomial time bit-reductions U Hertrampf, C Lautemann, T Schwentick, H Vollmer, KW Wagner [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993	131	1993
NondeterministicNC1Computation H Caussinus, P McKenzie, D Thérien, H Vollmer Journal of Computer and System Sciences 57 (2), 200-212, 1998	109	1998
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	107	1995
A polynomial-time approximation scheme for base station positioning in UMTS networks M Galota, C Glaßer, S Reith, H Vollmer Proceedings of the 5th international workshop on discrete algorithms and …, 2001	98	2001
The complexity of satisfiability problems: Refining Schaefer's theorem E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer Journal of Computer and System Sciences 75 (4), 245-254, 2009	94*	2009
The complexity of base station positioning in cellular networks C Glaßer, S Reith, H Vollmer Discrete Applied Mathematics 148 (1), 1-12, 2005	91*	2005
Playing with Boolean blocks, part II: Constraint satisfaction problems E Böhler, N Creignou, S Reith, H Vollmer ACM SIGACT-Newsletter, 2004	80	2004
Partially-ordered two-way automata: A new characterization of DA T Schwentick, D Thérien, H Vollmer International Conference on Developments in Language Theory, 239-250, 2001	75	2001
Taschenbuch der Algorithmen B Vöcking, H Alt, M Dietzfelbinger, R Reischuk, C Scheideler, H Vollmer, ... Springer, 2008	63*	2008
On the autoreducibility of random sequences T Ebert, W Merkle, H Vollmer SIAM Journal on Computing 32 (6), 1542-1569, 2003	59	2003
Lindström quantifiers and leaf language definability HJ Burtschick, H Vollmer International Journal of Foundations of Computer Science 9 (03), 277-294, 1998	58	1998
The descriptive complexity approach to LOGCFL C Lautemann, P McKenzie, T Schwentick, H Vollmer Journal of Computer and System Sciences 62 (4), 629-652, 2001	56	2001
The complexity of generalized satisfiability for linear temporal logic H Vollmer, I Schnoor, H Schnoor, T Schneider, M Bauland Logical Methods in Computer Science 5, 2009	55*	2009
Bases for Boolean co-clones E Böhler, S Reith, H Schnoor, H Vollmer Information Processing Letters 96 (2), 59-66, 2005	54	2005
The complexity of satisfiability for fragments of CTL and CTL⋆ A Meier, M Thomas, H Vollmer, M Mundhenk International Journal of Foundations of Computer Science 20 (05), 901-918, 2009	53	2009
Complexity results for modal dependence logic P Lohmann, H Vollmer Studia Logica 101 (2), 343-366, 2013	52	2013
Complexity of constraints: an overview of current research themes N Creignou, PG Kolaitis, H Vollmer Springer Science & Business Media, 2008	49	2008
The tractability of model checking for LTL: The good, the bad, and the ugly fragments M Bauland, M Mundhenk, T Schneider, H Schnoor, I Schnoor, H Vollmer ACM Transactions on Computational Logic (TOCL) 12 (2), 1-28, 2011	47	2011

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

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores