default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeribert Vollmer
Person information
- affiliation: Leibniz University of Hannover, Institute for Theoretical Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i63]Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema
, Heribert Vollmer:
Graph Neural Networks and Arithmetic Circuits. CoRR abs/2402.17805 (2024)- [i62]Juha Kontinen, Jonni Virtema, Heribert Vollmer, Fan Yang, Nicolas Fröhlich:
Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). Dagstuhl Reports 14(3): 31-51 (2024) - 2023
- [i61]Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer:
Parameterized Complexity of Weighted Team Definability. CoRR abs/2302.00541 (2023) - 2022
- [j64]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173(10): 103163 (2022) - [c60]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. MFCS 2022: 38:1-38:14 - [i60]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. CoRR abs/2205.00539 (2022) - 2021
- [j63]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. 116: 40-54 (2021) - [c59]Timon Barlag, Heribert Vollmer:
A Logical Characterization of Constant-Depth Circuits over the Reals. WoLLIC 2021: 16-30 - 2020
- [j62]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020) - [i59]Timon Barlag, Heribert Vollmer:
A Logical Characterization of Constant-Depth Circuits over the Reals. CoRR abs/2005.04916 (2020) - [i58]Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating Teams in First-Order Team Logics. CoRR abs/2006.06953 (2020)
2010 – 2019
- 2019
- [j61]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterised Enumeration for Modification Problems. Algorithms 12(9): 189 (2019) - [j60]Anselm Haak, Heribert Vollmer:
A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Log. 170(9): 1008-1029 (2019) - [j59]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268: 191-209 (2019) - [j58]Heribert Vollmer, Brigitte Vallée:
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 63(5): 923-925 (2019) - [c58]Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. MFCS 2019: 19:1-19:15 - [i57]Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. CoRR abs/1902.00246 (2019) - [i56]Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports 9(1): 28-46 (2019) - 2018
- [j57]Christoph Dürr, Heribert Vollmer:
Preface of STACS 2016 Special Issue. Theory Comput. Syst. 62(1): 1-3 (2018) - [j56]Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Logics in Team Semantic. ACM Trans. Comput. Log. 19(1): 2:1-2:14 (2018) - [c57]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363 - 2017
- [j55]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal independence logic. J. Log. Comput. 27(5): 1333-1352 (2017) - [j54]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017) - [c56]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195 - [e9]Heribert Vollmer, Brigitte Vallée:
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. LIPIcs 66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-028-6 [contents] - [i55]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR abs/1710.01934 (2017) - 2016
- [c55]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CSL 2016: 20:1-20:16 - [c54]Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC 2016: 234-248 - [p2]Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Introduction. Dependence Logic 2016: 1-3 - [p1]Arnaud Durand, Juha Kontinen, Heribert Vollmer:
Expressivity and Complexity of Dependence Logic. Dependence Logic 2016: 5-32 - [e8]Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Dependence Logic, Theory and Applications. Springer 2016, ISBN 978-3-319-31801-1 [contents] - [e7]Nicolas Ollinger, Heribert Vollmer:
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. LIPIcs 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-001-9 [contents] - [i54]Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR abs/1603.09531 (2016) - [i53]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CoRR abs/1604.06617 (2016) - [i52]Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. CoRR abs/1610.05493 (2016) - [i51]Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer:
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6(9): 74-93 (2016) - 2015
- [b3]Arne Meier, Heribert Vollmer:
Komplexität von Algorithmen. Mathematik für Anwendungen 4, Lehmanns Media 2015, ISBN 978-3-86541-761-9, pp. 1-204 - [j53]Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015) - [j52]Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136(4): 297-316 (2015) - [j51]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. Int. J. Found. Comput. Sci. 26(8): 1189- (2015) - [j50]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. 24(3): 289-305 (2015) - [c53]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CSL 2015: 277-291 - [c52]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration for Modification Problems. LATA 2015: 524-536 - [c51]Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. MFCS (1) 2015: 269-280 - [c50]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) 2015: 281-292 - [i50]Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. CoRR abs/1504.06135 (2015) - [i49]Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015) - [i48]Erich Grädel, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6): 70-85 (2015) - [i47]Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015) - 2014
- [j49]Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer:
A Fragment of Dependence Logic Capturing Polynomial Time. Log. Methods Comput. Sci. 10(3) (2014) - [j48]Markus Aschinger, Conrad Drescher, Georg Gottlob, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. ACM Trans. Comput. Log. 15(3): 20:1-20:25 (2014) - [c49]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. Advances in Modal Logic 2014: 353-372 - [i46]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. CoRR abs/1404.0144 (2014) - [i45]Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CoRR abs/1410.6648 (2014) - 2013
- [j47]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Stud Logica 101(2): 343-366 (2013) - [j46]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013) - [c48]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301 - [c47]Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer:
Extended Modal Dependence Logic. WoLLIC 2013: 126-137 - [c46]Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. WoLLIC 2013: 238-250 - [i44]Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice. CoRR abs/1303.6424 (2013) - [i43]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013) - [i42]Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration with Ordering. CoRR abs/1309.5009 (2013) - [i41]Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer:
Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports 3(2): 45-54 (2013) - 2012
- [j45]Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108: 49-89 (2012) - [j44]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3): 587-604 (2012) - [j43]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012) - [j42]Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012) - [c45]Markus Aschinger, Conrad Drescher, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. ECAI 2012: 73-78 - [c44]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400 - [c43]Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354 - [i40]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012) - [i39]Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j41]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011) - [j40]Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Log. Methods Comput. Sci. 7(2) (2011) - [j39]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12(2): 13:1-13:28 (2011) - [c42]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. FSTTCS 2011: 252-263 - [c41]Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95 - [e6]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - [i38]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CoRR abs/1104.0607 (2011) - [i37]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. CoRR abs/1109.4750 (2011) - [i36]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011) - 2010
- [j38]Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Monoidal and Groupoidal Quantifiers. Log. Methods Comput. Sci. 6(3) (2010) - [j37]Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems. Log. Methods Comput. Sci. 8(3) (2010) - [j36]Michael Thomas, Heribert Vollmer:
Complexity of non-monotonic logics. Bull. EATCS 102: 53-82 (2010) - [j35]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47(2): 454-490 (2010) - [j34]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39(7): 3186-3206 (2010) - [c40]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CSL 2010: 411-425 - [c39]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317 - [c38]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43 - [e5]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 07.02. - 12.02.2010. Dagstuhl Seminar Proceedings 10061, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i35]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010 - [i34]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010 - [i33]Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games 2010 - [i32]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i31]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i30]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010) - [i29]Michael Thomas, Heribert Vollmer:
Complexity of Non-Monotonic Logics. CoRR abs/1009.1990 (2010) - [i28]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j33]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009) - [j32]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009) - [j31]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009) - [j30]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009) - [j29]Heribert Vollmer:
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory Comput. Syst. 44(1): 82-90 (2009) - [c37]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64 - [c36]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - 2008
- [c35]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78 - [c34]Nadia Creignou, Heribert Vollmer:
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37 - [c33]Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Groupoidal Quantifiers. WoLLIC 2008: 238-248 - [c32]Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*. RP 2008: 201-213 - [e4]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5250, Springer 2008, ISBN 978-3-540-92799-0 [contents] - [e3]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - [i27]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. CoRR abs/0805.0498 (2008) - [i26]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CoRR abs/0805.4072 (2008) - [i25]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008) - [i24]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008) - [i23]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c31]Heribert Vollmer:
Computational Complexity of Constraint Satisfaction. CiE 2007: 748-757 - [c30]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62 - [c29]Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. M4M 2007: 277-292 - [e2]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i22]Heribert Vollmer:
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Electron. Colloquium Comput. Complex. TR07 (2007) - [i21]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j28]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006) - [j27]Friedrich Steimann, Heribert Vollmer:
Exploiting practical limitations of UML diagrams for model validation and execution. Softw. Syst. Model. 5(1): 26-47 (2006) - [e1]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i20]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006 - [i19]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006 - [i18]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i17]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i16]Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j26]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148(1): 1-12 (2005) - [j25]Matthias Galota, Heribert Vollmer:
Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005) - [j24]Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005) - [c28]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82 - [i15]Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j23]Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004) - [c27]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004 - [c26]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers 2004: 30-45 - [c25]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - [i14]Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j22]Steffen Reith, Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003) - [j21]Matthias Galota, Sven Kosub, Heribert Vollmer:
Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003) - [j20]Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003) - [c24]Heribert Vollmer:
Complexity Theory Made Easy. Developments in Language Theory 2003: 95-110 - [i13]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003) - [i12]Matthias Galota, Heribert Vollmer:
Functions Computable in Polynomial Space. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c23]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 - [i11]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002) - [i10]Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j19]Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. Discret. Math. Theor. Comput. Sci. 4(2): 179-192 (2001) - [j18]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001) - [c22]Matthias Galota, Heribert Vollmer:
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368 - [c21]Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer:
A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59 - [c20]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250 - 2000
- [j17]Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j16]Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000) - [j15]Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000) - [c19]Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175 - [c18]Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178 - [c17]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The Many Faces of a Translation. ICALP 2000: 890-901 - [c16]Todd Ebert, Heribert Vollmer:
On the Autoreducibility of Random Sequences. MFCS 2000: 333-342 - [c15]Steffen Reith, Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649
1990 – 1999
- 1999
- [b2]Heribert Vollmer:
Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series, Springer 1999, ISBN 978-3-540-64310-4, pp. I-XI, 1-270 - [j14]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j13]Heribert Vollmer:
Was leistet die Komplexitätstheorie für die Praxis? Inform. Spektrum 22(5): 317-327 (1999) - [j12]Heribert Vollmer:
Uniform characterizations of complexity classes. SIGACT News 30(1): 17-27 (1999) - [c14]Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. ICALP 1999: 605-614 - [c13]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454 - 1998
- [j11]Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. 7(3): 265-289 (1998) - [j10]Hans-Jörg Burtschick, Heribert Vollmer:
Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998) - [j9]Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC1 Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998) - [j8]K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998) - [j7]Heribert Vollmer:
Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. 207(1): 159-170 (1998) - [c12]Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617 - [i9]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998) - [i8]Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. CoRR cs.CC/9809115 (1998) - [i7]Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998) - [i6]Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electron. Colloquium Comput. Complex. TR98 (1998) - [i5]Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Types. Electron. Colloquium Comput. Complex. TR98 (1998) - [i4]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j6]Kenneth W. Regan, Heribert Vollmer:
Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997) - [c11]Heribert Vollmer, Klaus W. Wagner:
Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312 - [c10]Heribert Vollmer, Klaus W. Wagner:
On Operators of Higher Types. CCC 1997: 174-184 - [c9]Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI 1997: 99-123 - 1996
- [j5]Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory 29(4): 411-421 (1996) - [j4]Heribert Vollmer, Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163(1&2): 245-258 (1996) - [c8]Heribert Vollmer:
Relations Among Parallel and Sequential Computation Models. ASIAN 1996: 23-32 - [c7]Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC1 Computation. CCC 1996: 12-21 - [c6]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269 - [c5]Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
On Type-2 Probabilistic Quantifiers. ICALP 1996: 369-380 - [i3]Hans-Jörg Burtschick, Heribert Vollmer:
Lindstroem Quantifiers and Leaf Language Definability. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j3]Heribert Vollmer, Klaus W. Wagner:
Complexity Classes of Optimization Functions. Inf. Comput. 120(2): 198-219 (1995) - [j2]Lane A. Hemaspaandra, Heribert Vollmer:
The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995) - [c4]Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting. SCT 1995: 299-314 - 1994
- [b1]Heribert Vollmer:
Komplexitätsklassen von Funktionen. Julius Maximilians University Würzburg, Germany, 1994, pp. 1-119 - [c3]Heribert Vollmer:
On Different Reducibility Notions for Function Classes. STACS 1994: 449-460 - 1993
- [j1]Heribert Vollmer, Klaus W. Wagner:
The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4(4): 293-307 (1993) - [c2]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT 1993: 200-207 - 1992
- [i1]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Bit-Reductions. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28 (1992) - 1990
- [c1]Heribert Vollmer:
The Gap-Language-Technique Revisited. CSL 1990: 389-399
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
