Heribert Vollmer

Cited by

	All	Since 2019
Citations	3886	916
h-index	34	16
i10-index	66	26

220

110

165

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 31 21 63 60 63 58 67 57 112 110 131 96 144 150 184 192 135 199 142 164 171 172 201 155 188 147 129 145 177 130

Public access

View all

36 articles

3 articles

available

not available

Based on funding mandates

Co-authors

Arne MeierPrivatdozent, Institute of Theoretical Computer Science, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Juha KontinenProfessor, University of Helsinki, FinlandVerified email at helsinki.fi
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel UniversityVerified email at ti.informatik.uni-kiel.de
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Jonni VirtemaLecturer, University of Sheffield, UKVerified email at sheffield.ac.uk
Thomas SchneiderDept. of Mathematics and Computer Science, University of Bremen, GermanyVerified email at uni-bremen.de
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Edith HemaspaandraProfessor of Computer Science, RITVerified email at cs.rit.edu
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaVerified email at imsc.res.in
Miika HannulaUniversity of HelsinkiVerified email at helsinki.fi
Antti KuusistoAcademy Research Fellow, Tampere UniversityVerified email at tuni.fi
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)Verified email at buffalo.edu
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in
Georg GottlobProfessor of Informatics, University of CalabriaVerified email at unical.it
Frederic GreenClark UniversityVerified email at clarku.edu
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
Alan SelmanProfessor emeritus of computer science and engineering, University at Buffalo

Heribert Vollmer

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

Verified email at thi.uni-hannover.de - Homepage

Komplexitätstheorie Logik


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Introduction to circuit complexity: a uniform approach H Vollmer Springer Science & Business Media, 1999	809	1999
Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory E Bohler ACM SIGACT News 34 (4), 38-52, 2003	149	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	136	1993
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	132	1995
NondeterministicNC1Computation H Caussinus, P McKenzie, D Thérien, H Vollmer Journal of Computer and System Sciences 57 (2), 200-212, 1998	113	1998
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	103	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	99*	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	94	2005
Playing with Boolean blocks, part II: Constraint satisfaction problems E Böhler, N Creignou, S Reith, H Vollmer ACM SIGACT-Newsletter 35 (1), 22-35, 2004	82	2004
Taschenbuch der Algorithmen B Vöcking, H Alt, M Dietzfelbinger, R Reischuk, C Scheideler, H Vollmer, ... Springer, 2008	81*	2008
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	81	2001
On the autoreducibility of random sequences T Ebert, W Merkle, H Vollmer SIAM Journal on Computing 32 (6), 1542-1569, 2003	72	2003
Bases for Boolean co-clones E Böhler, S Reith, H Schnoor, H Vollmer Information Processing Letters 96 (2), 59-66, 2005	62	2005
The complexity of generalized satisfiability for linear temporal logic M Bauland, T Schneider, H Schnoor, I Schnoor, H Vollmer Logical Methods in Computer Science 5, 2009	61	2009
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	59	2009
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	57	2001
Paradigms for parameterized enumeration N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer Theory of Computing Systems 60, 737-758, 2017	56	2017
Lindström quantifiers and leaf language definability HJ Burtschick, H Vollmer International Journal of Foundations of Computer Science 9 (03), 277-294, 1998	56	1998
Complexity results for modal dependence logic P Lohmann, H Vollmer Studia Logica 101, 343-366, 2013	55	2013
Complexity of constraints: an overview of current research themes N Creignou, PG Kolaitis, H Vollmer Springer Science & Business Media, 2008	52	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors