×

zbMATH — the first resource for mathematics

Vollmer, Heribert

Compute Distance To:
Author ID: vollmer.heribert Recent zbMATH articles by "Vollmer, Heribert"
Published as: Vollmer, Heribert; Vollmer, H.
External Links: MGP
Documents Indexed: 113 Publications since 1991, including 7 Books
Reviewing Activity: 71 Reviews
all top 5

Co-Authors

8 single-authored
19 Meier, Arne
14 Kontinen, Juha
13 Creignou, Nadia
12 Schnoor, Henning
11 Wagner, Klaus W.
10 Müller, Julian-Steffen
9 McKenzie, Pierre
9 Reith, Steffen
8 Bauland, Michael
8 Beyersdorff, Olaf
7 Mundhenk, Martin
6 Durand, Arnaud
5 Böhler, Elmar
5 Datta, Samir
5 Haak, Anselm
5 Schneider, Thomas
5 Schwentick, Thomas
4 Ebbing, Johannes
4 Galota, Matthias
4 Mahajan, Meena
4 Schmidt, Johannes
4 Schnoor, Ilka
4 Thérien, Denis
3 Allender, Eric W.
3 Hella, Lauri T.
3 Hertrampf, Ulrich
3 Kosub, Sven
3 Virtema, Jonni
2 Alt, Helmut
2 Aschinger, Markus
2 Book, Ronald Vernon
2 Dietzfelbinger, Martin
2 Drescher, Conrad
2 Ebert, Todd
2 Hannula, Miika
2 Hemaspaandra, Edith
2 Immerman, Neil
2 Kröll, Markus
2 Kuusisto, Antti
2 Lautemann, Clemens
2 Lohmann, Peter
2 Müller, Sebastian
2 Peichl, Timo
2 Pichler, Reinhard
2 Raghavendra Rao, B. V.
2 Reischuk, Rüdiger
2 Scharfenberger-Fabian, Gido
2 Scheideler, Christian
2 Schmitz, Heinz
2 Skritek, Sebastian
2 Sreenivasaiah, Karteek
2 Vöcking, Berthold
2 Wagner, Dorothea
1 Abramsky, Samson
1 Agrawal, Manindra
1 Burtschick, Hans-Jörg
1 Caussinus, Hervé
1 Chapdelaine, Philippe
1 Cronauer, K.
1 Dürr, Christoph
1 Fenner, Stephen A.
1 Glaßer, Christian
1 Gottlob, Georg
1 Green, Frederic
1 Hermann, Miki
1 Homer, Steven
1 Kolaitis, Phokion G.
1 Krebs, Andreas
1 Ktari, Raida
1 Merkle, Wolfgang
1 Olive, Frédéric
1 Ollinger, Nicolas
1 Regan, Kenneth W.
1 Schindler, Irina
1 Selman, Alan L.
1 Thierauf, Thomas
1 Väänänen, Jouko Antero
1 Vallée, Brigitte
1 Valleée, Brigitte

Publications by Year

Citations contained in zbMATH Open

92 Publications have been cited 482 times in 300 Documents Cited by Year
Introduction to circuit complexity. A uniform approach. Zbl 0931.68055
Vollmer, Heribert
65
1998
Nondeterministic \(NC^1\) computation. Zbl 0921.68029
Caussinus, Hervé; McKenzie, Pierre; Thérien, Denis; Vollmer, Heribert
26
1998
Bases for Boolean co-clones. Zbl 1184.68351
Böhler, Elmar; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
19
2005
Extended modal dependence logic \(\mathcal{EMDL}\). Zbl 1394.03047
Ebbing, Johannes; Hella, Lauri; Meier, Arne; Müller, Julian-Steffen; Virtema, Jonni; Vollmer, Heribert
16
2013
Lindström quantifiers and leaf language definability. Zbl 1319.68104
Burtschick, Hans-Jörg; Vollmer, Heribert
14
1998
A van Benthem theorem for modal team semantics. Zbl 1373.03024
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
12
2015
Partially-ordered two-way automata: A new characterization of DA. Zbl 1073.68051
Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
11
2002
The complexity of satisfiability problems: Refining Schaefer’s theorem. Zbl 1156.68396
Allender, Eric; Bauland, Michael; Immerman, Neil; Schnoor, Henning; Vollmer, Heribert
11
2005
Complexity of constraints. An overview of current research themes. Zbl 1154.68008
Creignou, Nadia (ed.); Kolaitis, Phokion G. (ed.); Vollmer, Heribert (ed.)
11
2008
The complexity of satisfiability problems: Refining Schaefer’s theorem. Zbl 1161.68487
Allender, Eric; Bauland, Michael; Immerman, Neil; Schnoor, Henning; Vollmer, Heribert
11
2009
Equivalence and isomorphism for Boolean constraint satisfaction. Zbl 1020.68039
Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert
10
2002
On balanced versus unbalanced computation trees. Zbl 0853.68097
Hertrampf, U.; Vollmer, H.; Wagner, K. W.
10
1996
Complexity results for modal dependence logic. Zbl 1432.03043
Lohmann, Peter; Vollmer, Heribert
10
2013
The complexity of generalized satisfiability for linear temporal logic. Zbl 1183.03017
Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
9
2009
Complexity classes of optimization functions. Zbl 0835.68048
Vollmer, Heribert; Wagner, Klaus W.
8
1995
Boolean constraint satisfaction problems: When does Post’s lattice help? Zbl 1171.68495
Creignou, Nadia; Vollmer, Heribert
8
2008
The complexity of propositional implication. Zbl 1202.68207
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
8
2009
Gap-languages and log-time complexity classes. Zbl 0893.68067
Regan, Kenneth W.; Vollmer, Heribert
7
1997
The descriptive complexity approach to LOGCFL. Zbl 0983.68108
Lautemann, Clemens; McKenzie, Pierre; Schwentick, Thomas; Vollmer, Heribert
7
2001
On the autoreducibility of random sequences. Zbl 1032.03036
Ebert, Todd; Merkle, Wolfgang; Vollmer, Heribert
7
2003
The complexity of finding middle elements. Zbl 0804.68052
Vollmer, Heribert; Wagner, Klaus W.
6
1993
On different reducibility notions for function classes. Zbl 0941.68581
Vollmer, Heribert
6
1994
A generalized quantifier concept in computational complexity theory. Zbl 0967.03035
Vollmer, Heribert
6
1999
The complexity of generalized satisfiability for linear temporal logic. Zbl 1183.03016
Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
6
2007
Complexity of propositional independence and inclusion logic. Zbl 1465.68104
Hannula, Miika; Kontinen, Juha; Virtema, Jonni; Vollmer, Heribert
6
2015
The tractability of model-checking for LTL: the good, the bad, and the ugly fragments. Zbl 1347.68217
Bauland, Michael; Mundhenk, Martin; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
6
2009
The complexity of satisfiability for fragments of CTL and CTL\(^\bigstar \). Zbl 1186.68212
Meier, Arne; Thomas, Michael; Vollmer, Heribert; Mundhenk, Martin
6
2009
On the complexity of hard enumeration problems. Zbl 06725136
Creignou, Nadia; Kröll, Markus; Pichler, Reinhard; Skritek, Sebastian; Vollmer, Heribert
5
2017
The complexity of Boolean constraint isomorphism. Zbl 1122.68586
Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert
5
2004
Model checking CTL is almost always inherently sequential. Zbl 1220.68068
Beyersdorff, Olaf; Meier, Arne; Mundhenk, Martin; Schneider, Thomas; Thomas, Michael; Vollmer, Heribert
5
2011
Complexity of propositional logics in team semantic. Zbl 1407.68291
Hannula, Miika; Kontinen, Juha; Virtema, Jonni; Vollmer, Heribert
5
2018
Modal inclusion logic: being lax is simpler than being strict. Zbl 1465.68105
Hella, Lauri; Kuusisto, Antti; Meier, Arne; Vollmer, Heribert
5
2015
The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\). Zbl 1337.68134
Meier, Arne; Mundhenk, Martin; Thomas, Michael; Vollmer, Heribert
5
2008
Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting. Zbl 1337.68127
Creignou, Nadia; Vollmer, Heribert
4
2015
An algebraic approach to the complexity of generalized conjunctive queries. Zbl 1122.68407
Bauland, Michael; Chapdelaine, Philippe; Creignou, Nadia; Hermann, Miki; Vollmer, Heribert
4
2005
The complexity of reasoning for fragments of default logic. Zbl 1247.68263
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
4
2009
Paradigms for parameterized enumeration. Zbl 1368.68221
Creignou, Nadia; Meier, Arne; Müller, Julian-Steffen; Schmidt, Johannes; Vollmer, Heribert
4
2017
Modal independence logic. Zbl 1444.03064
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
4
2017
The complexity of reasoning for fragments of autoepistemic logic. Zbl 1352.68226
Creignou, Nadia; Meier, Arne; Vollmer, Heribert; Thomas, Michael
4
2012
The complexity of problems for quantified constraints. Zbl 1204.68182
Bauland, Michael; Böhler, Elmar; Creignou, Nadia; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
4
2010
The complexity of reasoning for fragments of default logic. Zbl 1267.68222
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
4
2012
Complexity results for modal dependence logic. Zbl 1270.03048
Lohmann, Peter; Vollmer, Heribert
4
2010
Expressivity and complexity of dependence logic. Zbl 1429.03114
Durand, Arnaud; Kontinen, Juha; Vollmer, Heribert
3
2016
Dependence logic with a majority quantifier. Zbl 1246.68126
Durand, Arnaud; Ebbing, Johannes; Kontinen, Juha; Vollmer, Heribert
3
2011
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Zbl 1058.68062
Reith, Steffen; Vollmer, Heribert
3
2003
Dependence logic with a majority quantifier. Zbl 1368.03040
Durand, Arnaud; Ebbing, Johannes; Kontinen, Juha; Vollmer, Heribert
3
2015
On type-2 probabilistic quantifiers. Zbl 1046.68537
Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W.
3
1996
The complexity of base station positioning in cellular networks. Zbl 1099.90012
Glaßer, Christian; Reith, Steffen; Vollmer, Heribert
3
2005
Complexity classifications for different equivalence and audit problems for Boolean circuits. Zbl 1248.94130
Böhler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
3
2012
A note on closure properties of logspace MOD classes. Zbl 0953.68549
Hertrampf, Ulrich; Reith, Steffen; Vollmer, Heribert
3
2000
A complexity theory for hard enumeration problems. Zbl 1419.05016
Creignou, Nadia; Kröll, Markus; Pichler, Reinhard; Skritek, Sebastian; Vollmer, Heribert
2
2019
Modal indepence logic. Zbl 1385.03021
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
2
2014
Uniform characterizations of complexity classes of functions. Zbl 0969.68084
Kosub, Sven; Schmitz, Heinz; Vollmer, Heribert
2
2000
A generalization of the Büchi-Elgot-Trakhtenbrot theorem. Zbl 0999.03033
Galota, Matthias; Vollmer, Heribert
2
2001
Relating polynomial time to constant depth. Zbl 0916.68038
Vollmer, Heribert
2
1998
The descriptive complexity approach to LOGCFL. Zbl 0924.03069
Lautemann, Clemens; McKenzie, Pierre; Schwentick, Thomas; Vollmer, Heribert
2
1999
Complements of multivalued functions. Zbl 0924.68089
Fenner, Stephen; Green, Frederic; Homer, Steven; Selman, Alan L.; Thierauf, Thomas; Vollmer, Heribert
2
1999
Finite automata with generalized acceptance criteria. Zbl 0981.68080
Peichl, Timo; Vollmer, Heribert
2
2001
Model checking for modal dependence logic: an approach through Post’s lattice. Zbl 1394.68234
Müller, Julian-Steffen; Vollmer, Heribert
2
2013
Paradigms for parameterized enumeration. Zbl 1362.68103
Creignou, Nadia; Meier, Arne; Müller, Julian-Steffen; Schmidt, Johannes; Vollmer, Heribert
2
2013
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Zbl 0996.68187
Reith, Steffen; Vollmer, Heribert
2
2000
The gap-language-technique revisited. Zbl 0790.68046
Vollmer, Heribert
2
1991
The chain method to separate counting classes. Zbl 0893.68070
Cronauer, K.; Hertrampf, U.; Vollmer, H.; Wagner, K. W.
2
1998
Recursion theoretic characterizations of complexity classes of counting functions. Zbl 0877.68059
Vollmer, Heribert; Wagner, Klaus W.
2
1996
Arithmetic circuits and polynomial replacement systems. Zbl 1044.68061
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2000
Arithmetic circuits and polynomial replacement systems. Zbl 1101.68567
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2004
Proof complexity of propositional default logic. Zbl 1308.03057
Beyersdorff, Olaf; Meier, Arne; Müller, Sebastian; Thomas, Michael; Vollmer, Heribert
2
2011
Descriptive complexity of #AC\(^0\) functions. Zbl 1369.68220
Durand, Arnaud; Haak, Anselm; Kontinen, Juha; Vollmer, Heribert
2
2016
Extensional uniformity for Boolean circuits. Zbl 1209.68254
McKenzie, Pierre; Thomas, Michael; Vollmer, Heribert
2
2010
Functions computable in polynomial space. Zbl 1067.68073
Galota, Matthias; Vollmer, Heribert
2
2005
Complexity of non-monotonic logics. Zbl 1275.68141
Thomas, Michael; Vollmer, Heribert
2
2010
On the parameterized complexity of non-monotonic logics. Zbl 1361.03036
Meier, Arne; Schindler, Irina; Schmidt, Johannes; Thomas, Michael; Vollmer, Heribert
2
2015
The tractability of model checking for LTL: the good, the bad, and the ugly fragments. Zbl 1351.68151
Bauland, Michael; Mundhenk, Martin; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
2
2011
On the parameterized complexity of default logic and autoepistemic logic. Zbl 1351.68120
Meier, Arne; Schmidt, Johannes; Thomas, Michael; Vollmer, Heribert
2
2012
Erratum to: “The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)”. Zbl 1405.68130
Meier, Arne; Thomas, Michael; Vollmer, Heribert; Mundhenk, Martin
2
2015
Counting classes and the fine structure between {NC}\(^{1}\) and {L}. Zbl 1287.68052
Datta, Samir; Mahajan, Meena; Raghavendra Rao, B. V.; Thomas, Michael; Vollmer, Heribert
2
2010
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Zbl 1179.68062
Vollmer, Heribert
2
2009
A fragment of dependence logic capturing polynomial time. Zbl 1338.68090
Ebbing, Johannes; Kontinen, Juha; Müller, Julian-Steffen; Vollmer, Heribert
2
2014
Complexity of model checking for logics over Kripke models. Zbl 1394.68233
Meier, Arne; Müller, Julian-Steffen; Mundhenk, Martin; Vollmer, Heribert
1
2012
The many faces of a translation. Zbl 0973.68155
McKenzie, Pierre; Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
1
2000
A model-theoretic characterization of constant-depth arithmetic circuits. Zbl 06625890
Haak, Anselm; Vollmer, Heribert
1
2016
Finite automata with generalized acceptance criteria. Zbl 0943.68119
Peichl, Timo; Vollmer, Heribert
1
1999
Measure one results in computational complexity theory. Zbl 0867.68054
Vollmer, Heribert; Wagner, Klaus W.
1
1997
Computational complexity of constraint satisfaction. Zbl 1151.68431
Vollmer, Heribert
1
2007
LoCo – a logic for configuration problems. Zbl 1354.68246
Aschinger, Markus; Drescher, Conrad; Gottlob, Georg; Vollmer, Heribert
1
2014
Algorithms unplugged. Zbl 1206.68024
Vöcking, Berthold (ed.); Alt, Helmut (ed.); Dietzfelbinger, Martin (ed.); Reischuk, Rüdiger (ed.); Scheideler, Christian (ed.); Vollmer, Heribert (ed.); Wagner, Dorothea (ed.)
1
2011
On second-order monadic monoidal and groupoidal quantifiers. Zbl 1214.03025
Kontinen, Juha; Vollmer, Heribert
1
2010
Proof complexity of propositional default logic. Zbl 1306.68183
Beyersdorff, Olaf; Meier, Arne; Müller, Sebastian; Thomas, Michael; Vollmer, Heribert
1
2010
Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\). Zbl 1282.68111
Datta, Samir; Mahajan, Meena; Raghavendra Rao, B. V.; Thomas, Michael; Vollmer, Heribert
1
2012
Parameterized enumeration for modification problems. Zbl 1451.68136
Creignou, Nadia; Ktari, Raïda; Meier, Arne; Müller, Julian-Steffen; Olive, Frédéric; Vollmer, Heribert
1
2015
Dependence logic. Theory and applications. Selected papers based on the presentations at the Dagstuhl seminar on ‘Dependence logic: theory and applications’, Wadern, Germany, February 2013. Zbl 1348.03004
Abramsky, Samson (ed.); Kontinen, Juha (ed.); Väänänen, Jouko (ed.); Vollmer, Heribert (ed.)
1
2016
LoCo – a logic for configuration problems. Zbl 1327.68239
Aschinger, Markus; Drescher, Conrad; Vollmer, Heribert
1
2012
A complexity theory for hard enumeration problems. Zbl 1419.05016
Creignou, Nadia; Kröll, Markus; Pichler, Reinhard; Skritek, Sebastian; Vollmer, Heribert
2
2019
Complexity of propositional logics in team semantic. Zbl 1407.68291
Hannula, Miika; Kontinen, Juha; Virtema, Jonni; Vollmer, Heribert
5
2018
On the complexity of hard enumeration problems. Zbl 06725136
Creignou, Nadia; Kröll, Markus; Pichler, Reinhard; Skritek, Sebastian; Vollmer, Heribert
5
2017
Paradigms for parameterized enumeration. Zbl 1368.68221
Creignou, Nadia; Meier, Arne; Müller, Julian-Steffen; Schmidt, Johannes; Vollmer, Heribert
4
2017
Modal independence logic. Zbl 1444.03064
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
4
2017
Expressivity and complexity of dependence logic. Zbl 1429.03114
Durand, Arnaud; Kontinen, Juha; Vollmer, Heribert
3
2016
Descriptive complexity of #AC\(^0\) functions. Zbl 1369.68220
Durand, Arnaud; Haak, Anselm; Kontinen, Juha; Vollmer, Heribert
2
2016
A model-theoretic characterization of constant-depth arithmetic circuits. Zbl 06625890
Haak, Anselm; Vollmer, Heribert
1
2016
Dependence logic. Theory and applications. Selected papers based on the presentations at the Dagstuhl seminar on ‘Dependence logic: theory and applications’, Wadern, Germany, February 2013. Zbl 1348.03004
Abramsky, Samson; Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
1
2016
A van Benthem theorem for modal team semantics. Zbl 1373.03024
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
12
2015
Complexity of propositional independence and inclusion logic. Zbl 1465.68104
Hannula, Miika; Kontinen, Juha; Virtema, Jonni; Vollmer, Heribert
6
2015
Modal inclusion logic: being lax is simpler than being strict. Zbl 1465.68105
Hella, Lauri; Kuusisto, Antti; Meier, Arne; Vollmer, Heribert
5
2015
Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting. Zbl 1337.68127
Creignou, Nadia; Vollmer, Heribert
4
2015
Dependence logic with a majority quantifier. Zbl 1368.03040
Durand, Arnaud; Ebbing, Johannes; Kontinen, Juha; Vollmer, Heribert
3
2015
On the parameterized complexity of non-monotonic logics. Zbl 1361.03036
Meier, Arne; Schindler, Irina; Schmidt, Johannes; Thomas, Michael; Vollmer, Heribert
2
2015
Erratum to: “The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)”. Zbl 1405.68130
Meier, Arne; Thomas, Michael; Vollmer, Heribert; Mundhenk, Martin
2
2015
Parameterized enumeration for modification problems. Zbl 1451.68136
Creignou, Nadia; Ktari, Raïda; Meier, Arne; Müller, Julian-Steffen; Olive, Frédéric; Vollmer, Heribert
1
2015
Modal indepence logic. Zbl 1385.03021
Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert
2
2014
A fragment of dependence logic capturing polynomial time. Zbl 1338.68090
Ebbing, Johannes; Kontinen, Juha; Müller, Julian-Steffen; Vollmer, Heribert
2
2014
LoCo – a logic for configuration problems. Zbl 1354.68246
Aschinger, Markus; Drescher, Conrad; Gottlob, Georg; Vollmer, Heribert
1
2014
Extended modal dependence logic \(\mathcal{EMDL}\). Zbl 1394.03047
Ebbing, Johannes; Hella, Lauri; Meier, Arne; Müller, Julian-Steffen; Virtema, Jonni; Vollmer, Heribert
16
2013
Complexity results for modal dependence logic. Zbl 1432.03043
Lohmann, Peter; Vollmer, Heribert
10
2013
Model checking for modal dependence logic: an approach through Post’s lattice. Zbl 1394.68234
Müller, Julian-Steffen; Vollmer, Heribert
2
2013
Paradigms for parameterized enumeration. Zbl 1362.68103
Creignou, Nadia; Meier, Arne; Müller, Julian-Steffen; Schmidt, Johannes; Vollmer, Heribert
2
2013
The complexity of reasoning for fragments of autoepistemic logic. Zbl 1352.68226
Creignou, Nadia; Meier, Arne; Vollmer, Heribert; Thomas, Michael
4
2012
The complexity of reasoning for fragments of default logic. Zbl 1267.68222
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
4
2012
Complexity classifications for different equivalence and audit problems for Boolean circuits. Zbl 1248.94130
Böhler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
3
2012
On the parameterized complexity of default logic and autoepistemic logic. Zbl 1351.68120
Meier, Arne; Schmidt, Johannes; Thomas, Michael; Vollmer, Heribert
2
2012
Complexity of model checking for logics over Kripke models. Zbl 1394.68233
Meier, Arne; Müller, Julian-Steffen; Mundhenk, Martin; Vollmer, Heribert
1
2012
Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\). Zbl 1282.68111
Datta, Samir; Mahajan, Meena; Raghavendra Rao, B. V.; Thomas, Michael; Vollmer, Heribert
1
2012
LoCo – a logic for configuration problems. Zbl 1327.68239
Aschinger, Markus; Drescher, Conrad; Vollmer, Heribert
1
2012
Model checking CTL is almost always inherently sequential. Zbl 1220.68068
Beyersdorff, Olaf; Meier, Arne; Mundhenk, Martin; Schneider, Thomas; Thomas, Michael; Vollmer, Heribert
5
2011
Dependence logic with a majority quantifier. Zbl 1246.68126
Durand, Arnaud; Ebbing, Johannes; Kontinen, Juha; Vollmer, Heribert
3
2011
Proof complexity of propositional default logic. Zbl 1308.03057
Beyersdorff, Olaf; Meier, Arne; Müller, Sebastian; Thomas, Michael; Vollmer, Heribert
2
2011
The tractability of model checking for LTL: the good, the bad, and the ugly fragments. Zbl 1351.68151
Bauland, Michael; Mundhenk, Martin; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
2
2011
Algorithms unplugged. Zbl 1206.68024
Vöcking, Berthold; Alt, Helmut; Dietzfelbinger, Martin; Reischuk, Rüdiger; Scheideler, Christian; Vollmer, Heribert; Wagner, Dorothea
1
2011
The complexity of problems for quantified constraints. Zbl 1204.68182
Bauland, Michael; Böhler, Elmar; Creignou, Nadia; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
4
2010
Complexity results for modal dependence logic. Zbl 1270.03048
Lohmann, Peter; Vollmer, Heribert
4
2010
Extensional uniformity for Boolean circuits. Zbl 1209.68254
McKenzie, Pierre; Thomas, Michael; Vollmer, Heribert
2
2010
Complexity of non-monotonic logics. Zbl 1275.68141
Thomas, Michael; Vollmer, Heribert
2
2010
Counting classes and the fine structure between {NC}\(^{1}\) and {L}. Zbl 1287.68052
Datta, Samir; Mahajan, Meena; Raghavendra Rao, B. V.; Thomas, Michael; Vollmer, Heribert
2
2010
On second-order monadic monoidal and groupoidal quantifiers. Zbl 1214.03025
Kontinen, Juha; Vollmer, Heribert
1
2010
Proof complexity of propositional default logic. Zbl 1306.68183
Beyersdorff, Olaf; Meier, Arne; Müller, Sebastian; Thomas, Michael; Vollmer, Heribert
1
2010
The complexity of satisfiability problems: Refining Schaefer’s theorem. Zbl 1161.68487
Allender, Eric; Bauland, Michael; Immerman, Neil; Schnoor, Henning; Vollmer, Heribert
11
2009
The complexity of generalized satisfiability for linear temporal logic. Zbl 1183.03017
Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
9
2009
The complexity of propositional implication. Zbl 1202.68207
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
8
2009
The tractability of model-checking for LTL: the good, the bad, and the ugly fragments. Zbl 1347.68217
Bauland, Michael; Mundhenk, Martin; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
6
2009
The complexity of satisfiability for fragments of CTL and CTL\(^\bigstar \). Zbl 1186.68212
Meier, Arne; Thomas, Michael; Vollmer, Heribert; Mundhenk, Martin
6
2009
The complexity of reasoning for fragments of default logic. Zbl 1247.68263
Beyersdorff, Olaf; Meier, Arne; Thomas, Michael; Vollmer, Heribert
4
2009
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Zbl 1179.68062
Vollmer, Heribert
2
2009
Complexity of constraints. An overview of current research themes. Zbl 1154.68008
Creignou, Nadia; Kolaitis, Phokion G.; Vollmer, Heribert
11
2008
Boolean constraint satisfaction problems: When does Post’s lattice help? Zbl 1171.68495
Creignou, Nadia; Vollmer, Heribert
8
2008
The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\). Zbl 1337.68134
Meier, Arne; Mundhenk, Martin; Thomas, Michael; Vollmer, Heribert
5
2008
The complexity of generalized satisfiability for linear temporal logic. Zbl 1183.03016
Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
6
2007
Computational complexity of constraint satisfaction. Zbl 1151.68431
Vollmer, Heribert
1
2007
Bases for Boolean co-clones. Zbl 1184.68351
Böhler, Elmar; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
19
2005
The complexity of satisfiability problems: Refining Schaefer’s theorem. Zbl 1156.68396
Allender, Eric; Bauland, Michael; Immerman, Neil; Schnoor, Henning; Vollmer, Heribert
11
2005
An algebraic approach to the complexity of generalized conjunctive queries. Zbl 1122.68407
Bauland, Michael; Chapdelaine, Philippe; Creignou, Nadia; Hermann, Miki; Vollmer, Heribert
4
2005
The complexity of base station positioning in cellular networks. Zbl 1099.90012
Glaßer, Christian; Reith, Steffen; Vollmer, Heribert
3
2005
Functions computable in polynomial space. Zbl 1067.68073
Galota, Matthias; Vollmer, Heribert
2
2005
The complexity of Boolean constraint isomorphism. Zbl 1122.68586
Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert
5
2004
Arithmetic circuits and polynomial replacement systems. Zbl 1101.68567
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2004
On the autoreducibility of random sequences. Zbl 1032.03036
Ebert, Todd; Merkle, Wolfgang; Vollmer, Heribert
7
2003
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Zbl 1058.68062
Reith, Steffen; Vollmer, Heribert
3
2003
Partially-ordered two-way automata: A new characterization of DA. Zbl 1073.68051
Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
11
2002
Equivalence and isomorphism for Boolean constraint satisfaction. Zbl 1020.68039
Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert
10
2002
The descriptive complexity approach to LOGCFL. Zbl 0983.68108
Lautemann, Clemens; McKenzie, Pierre; Schwentick, Thomas; Vollmer, Heribert
7
2001
A generalization of the Büchi-Elgot-Trakhtenbrot theorem. Zbl 0999.03033
Galota, Matthias; Vollmer, Heribert
2
2001
Finite automata with generalized acceptance criteria. Zbl 0981.68080
Peichl, Timo; Vollmer, Heribert
2
2001
A note on closure properties of logspace MOD classes. Zbl 0953.68549
Hertrampf, Ulrich; Reith, Steffen; Vollmer, Heribert
3
2000
Uniform characterizations of complexity classes of functions. Zbl 0969.68084
Kosub, Sven; Schmitz, Heinz; Vollmer, Heribert
2
2000
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Zbl 0996.68187
Reith, Steffen; Vollmer, Heribert
2
2000
Arithmetic circuits and polynomial replacement systems. Zbl 1044.68061
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2000
The many faces of a translation. Zbl 0973.68155
McKenzie, Pierre; Schwentick, Thomas; Thérien, Denis; Vollmer, Heribert
1
2000
A generalized quantifier concept in computational complexity theory. Zbl 0967.03035
Vollmer, Heribert
6
1999
The descriptive complexity approach to LOGCFL. Zbl 0924.03069
Lautemann, Clemens; McKenzie, Pierre; Schwentick, Thomas; Vollmer, Heribert
2
1999
Complements of multivalued functions. Zbl 0924.68089
Fenner, Stephen; Green, Frederic; Homer, Steven; Selman, Alan L.; Thierauf, Thomas; Vollmer, Heribert
2
1999
Finite automata with generalized acceptance criteria. Zbl 0943.68119
Peichl, Timo; Vollmer, Heribert
1
1999
Introduction to circuit complexity. A uniform approach. Zbl 0931.68055
Vollmer, Heribert
65
1998
Nondeterministic \(NC^1\) computation. Zbl 0921.68029
Caussinus, Hervé; McKenzie, Pierre; Thérien, Denis; Vollmer, Heribert
26
1998
Lindström quantifiers and leaf language definability. Zbl 1319.68104
Burtschick, Hans-Jörg; Vollmer, Heribert
14
1998
Relating polynomial time to constant depth. Zbl 0916.68038
Vollmer, Heribert
2
1998
The chain method to separate counting classes. Zbl 0893.68070
Cronauer, K.; Hertrampf, U.; Vollmer, H.; Wagner, K. W.
2
1998
Gap-languages and log-time complexity classes. Zbl 0893.68067
Regan, Kenneth W.; Vollmer, Heribert
7
1997
Measure one results in computational complexity theory. Zbl 0867.68054
Vollmer, Heribert; Wagner, Klaus W.
1
1997
On balanced versus unbalanced computation trees. Zbl 0853.68097
Hertrampf, U.; Vollmer, H.; Wagner, K. W.
10
1996
On type-2 probabilistic quantifiers. Zbl 1046.68537
Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W.
3
1996
Recursion theoretic characterizations of complexity classes of counting functions. Zbl 0877.68059
Vollmer, Heribert; Wagner, Klaus W.
2
1996
Complexity classes of optimization functions. Zbl 0835.68048
Vollmer, Heribert; Wagner, Klaus W.
8
1995
On different reducibility notions for function classes. Zbl 0941.68581
Vollmer, Heribert
6
1994
The complexity of finding middle elements. Zbl 0804.68052
Vollmer, Heribert; Wagner, Klaus W.
6
1993
The gap-language-technique revisited. Zbl 0790.68046
Vollmer, Heribert
2
1991
all top 5

Cited by 404 Authors

33 Vollmer, Heribert
18 Meier, Arne
15 Allender, Eric W.
13 Krebs, Andreas
10 Creignou, Nadia
10 Mahajan, Meena
8 Durand, Arnaud
8 Virtema, Jonni
7 Beyersdorff, Olaf
7 Kontinen, Juha
7 Kufleitner, Manfred
7 McKenzie, Pierre
7 Schnoor, Henning
6 Lagerkvist, Victor
6 Lohrey, Markus
6 Lück, Martin
6 Mundhenk, Martin
6 Raghavendra Rao, B. V.
6 Wagner, Klaus W.
5 Hermann, Miki
5 Limaye, Nutan
5 Mengel, Stefan
5 Schneider, Thomas
5 Weiß, Armin
5 Yang, Fan
4 Bauland, Michael
4 Bodirsky, Manuel
4 Borchert, Bernd
4 Glaßer, Christian
4 Krokhin, Andrei A.
4 Lohmann, Peter
4 Myasnikov, Alexei G.
4 Nordh, Gustav
4 Pichler, Reinhard
4 Schmidt, Johannes
4 Selivanov, Viktor L’vovich
4 Thérien, Denis
4 Valeriote, Matthew A.
4 Wang, Fengming
4 Zanuttini, Bruno
3 Behrisch, Mike
3 Bollig, Beate
3 Ciardelli, Ivano A.
3 Ebbing, Johannes
3 Faliszewski, Piotr
3 Fleischer, Lukas
3 Galliani, Pietro
3 Goldberg, Leslie Ann
3 Haak, Anselm
3 Hemaspaandra, Lane A.
3 Iemhoff, Rosalie
3 Immerman, Neil
3 Jansen, Maurice J.
3 Jonsson, Peter A.
3 Kröll, Markus
3 Kuusisto, Antti
3 Ludwig, Michael
3 Malod, Guillaume
3 Reith, Steffen
3 Roy, Biman
3 Salzer, Gernot
3 Schnoor, Ilka
3 Schwentick, Thomas
3 Skritek, Sebastian
3 Tantau, Till
3 Tesson, Pascal
3 Wechsung, Gerd
2 Alves, Mateus Rodrigues
2 Artale, Alessandro
2 Arvind, Vikraman
2 Baier, Herbert
2 Böhler, Elmar
2 Bova, Simone
2 Buttkus, Matthias
2 Cadilhac, Michaël
2 Capelli, Florent
2 Chen, Hubie
2 Claßen, Grit
2 Cooper, Martin C.
2 Dalmau, Víctor
2 Datta, Samir
2 De Oliveira Oliveira, Mateus
2 dos Santos Souza, Uéverton
2 Fichte, Johannes Klaus
2 Gadouleau, Maximilien
2 Galanis, Andreas
2 Gottlob, Georg
2 Ham, Lucy
2 Hannula, Miika
2 Hella, Lauri T.
2 Hemaspaandra, Edith
2 Hempel, Harald
2 Jackson, Marcel G.
2 Köbler, Johannes
2 Kolaitis, Phokion G.
2 Kontchakov, Roman
2 Koster, Arie M. C. A.
2 Kosub, Sven
2 Krötzsch, Markus
2 Lange, Klaus-Jörn
...and 304 more Authors
all top 5

Cited in 63 Serials

34 Theory of Computing Systems
29 Theoretical Computer Science
25 Journal of Computer and System Sciences
13 Information and Computation
10 Information Processing Letters
9 International Journal of Foundations of Computer Science
8 Algorithmica
7 Computational Complexity
6 Annals of Pure and Applied Logic
5 Artificial Intelligence
5 RAIRO. Theoretical Informatics and Applications
5 Logical Methods in Computer Science
4 Discrete Applied Mathematics
4 Algebra Universalis
4 The Journal of Symbolic Logic
4 Archive for Mathematical Logic
4 Annals of Mathematics and Artificial Intelligence
4 ACM Transactions on Computational Logic
3 Journal of Logic, Language and Information
2 Acta Informatica
2 Journal of Statistical Physics
2 Studia Logica
2 Journal of Complexity
2 SIAM Journal on Discrete Mathematics
2 International Journal of Algebra and Computation
2 Chicago Journal of Theoretical Computer Science
2 The Review of Symbolic Logic
1 Discrete Mathematics
1 Bulletin of the Polish Academy of Sciences. Technical Sciences
1 Journal of Algebra
1 Journal of Combinatorial Theory. Series B
1 Notre Dame Journal of Formal Logic
1 SIAM Journal on Computing
1 European Journal of Combinatorics
1 Advances in Applied Mathematics
1 Science of Computer Programming
1 Journal of Computer Science and Technology
1 Computers & Operations Research
1 Journal of Automated Reasoning
1 Random Structures & Algorithms
1 MSCS. Mathematical Structures in Computer Science
1 Discrete Mathematics and Applications
1 Journal of Global Optimization
1 Games and Economic Behavior
1 SIAM Journal on Optimization
1 New Zealand Journal of Mathematics
1 Journal of Mathematical Sciences (New York)
1 Mathematical Logic Quarterly (MLQ)
1 Advances in Applied Clifford Algebras
1 The Electronic Journal of Combinatorics
1 Constraints
1 Journal of Scheduling
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Fundamenta Informaticae
1 Logic and Logical Philosophy
1 Journal of Machine Learning Research (JMLR)
1 Journal of Applied Logic
1 Oberwolfach Reports
1 RAIRO. Theoretical Informatics and Applications
1 Bulletin of Mathematical Sciences
1 EURO Journal on Computational Optimization
1 Computer Science Review
1 Journal of Membrane Computing

Citations by Year