Heribert Vollmer
Heribert Vollmer
Professor für Theoretische Informatik, Leibniz Universität Hannover
Verified email at thi.uni-hannover.de - Homepage
Cited by
Cited by
Introduction to circuit complexity: a uniform approach
H Vollmer
Springer Science & Business Media, 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
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
H Caussinus, P McKenzie, D Thérien, H Vollmer
Journal of Computer and System Sciences 57 (2), 200-212, 1998
The satanic notations: counting classes beyond# P and other definitional adventures
LA Hemaspaandra, H Vollmer
ACM SIGACT News 26 (1), 2-13, 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
The complexity of base station positioning in cellular networks
C Glaßer, S Reith, H Vollmer
Discrete Applied Mathematics 148 (1), 1-12, 2005
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
Playing with Boolean blocks, part II: Constraint satisfaction problems
E Böhler, N Creignou, S Reith, H Vollmer
ACM SIGACT-Newsletter, 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
Taschenbuch der Algorithmen
B Vöcking, H Alt, M Dietzfelbinger, R Reischuk, C Scheideler, H Vollmer, ...
Springer-Verlag, 2008
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
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
Bases for Boolean co-clones
E Böhler, S Reith, H Schnoor, H Vollmer
Information Processing Letters 96 (2), 59-66, 2005
On the autoreducibility of random sequences
T Ebert, W Merkle, H Vollmer
SIAM Journal on Computing 32 (6), 1542-1569, 2003
Lindström quantifiers and leaf language definability
HJ Burtschick, H Vollmer
International Journal of Foundations of Computer Science 9 (03), 277-294, 1998
Complexity results for modal dependence logic
P Lohmann, H Vollmer
Studia Logica 101 (2), 343-366, 2013
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
Optimal satisfiability for propositional calculi and constraint satisfaction problems
S Reith, H Vollmer
Information and Computation 186 (1), 1-19, 2003
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
The system can't perform the operation now. Try again later.
Articles 1–20