Heribert Vollmer

Es wird die dblp-Klassifikation verwendet.

Konferenz- und Workshop-Veröffentlichungen
Journal-Veröffentlichungen
Bücher
Buchteile
Vordrucke und Technische Berichte

Typ: Journal-Veröffentlichungen (68), Konferenz- und Workshop-Veröffentlichungen (58), Vordrucke und Technische Berichte (61), Bücher (5), Buchteile (2), Dissertationen (1)

Jahr: 1990–1995 (9) , 1996–2000 (38) , 2001–2005 (30) , 2006–2010 (49) , 2011–2015 (45) , 2016–2020 (30)

Logik, Philosophie und Wissenschaftstheorie

2019

[BIB] Heribert Vollmer:
Künstlicher Geist? Christ in der Gegenwart 71(1): 17-18 (2019).

2018

[BIB] Heribert Vollmer:
Die Zukunft der Menschheit - Pierre Teilhard de Chardin und die Künstliche Intelligenz. Herder Korrespondenz 72(11): 28-32 (2018).

2016

[BIB] Heribert Vollmer:
Leibniz and the Development of Modal Logic in the 20th Century. In: Wenchao Li et al., Hrsg.: Für unser Glück oder das Glück anderer. Vorträge des X. Internationalen Leibniz-Kongresses, Band V, Georg Olms Verlag, Hildesheim Zürich New York 2016: 595-608.
[BIB] Heribert Vollmer:
Auctor Informaticae - Gottfried Wilhelm Leibniz: Der erste Informatiker. Unimagazin/Forschungsmagazin der Leibniz Universität Hannover, Ausgabe 01/02: Leibniz 2016: 40-43 (2016).

Populärwissenschaftliche Artikel

2001

[BIB] Heribert Vollmer, Steffen Reith:
Wer wird Millionär? Komplexitätstheorie: Konzepte und Herausforderungen. c’t Magazin für Computertechnik, Heft 7: 240-251 (2001).

1999

[BIB] Heribert Vollmer:
Was leistet die Komplexitätstheorie für die Praxis? Informatik Spektrum 22(5): 317-327 (1999).

Theoretische Informatik

2020

[BIB] 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).

2019

[BIB] 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).
[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
A complexity theory for hard enumeration problems. Discrete Applied Mathematics 268: 191-209 (2019).
[BIB] Anselm Haak, Heribert Vollmer:
A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Logic 170(9): 1008-1029 (2019).
[BIB] 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.
[BIB] Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. CoRR abs/1902.00246 (2019).
[BIB] Heribert Vollmer, Brigitte Vallée:
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 63(5): 923-925 (2019).
[BIB] 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

[BIB] Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363.
[BIB] Christoph Dürr, Heribert Vollmer:
Preface of STACS 2016 Special Issue. Theory Comput. Syst. 62(1): 1-3 (2018).
[BIB] 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).

2017

[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195.
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal independence logic. J. Log. Comput. 27(5): 1333-1352 (2017).
[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017).
[BIB] Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR abs/1710.01934 (2017).

2016

[BIB] Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC⁰ Functions. CSL 2016: 20:1-20:16.
[BIB] Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC 2016: 234-248.
[BIB] (Ed.) Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Dependence Logic, Theory and Applications. Springer 2016. ISBN 978-3-319-31803-5.
[BIB] Arnaud Durand, Juha Kontinen, Heribert Vollmer:
Expressivity and Complexity of Dependence Logic. Dependence Logic 2016: 5-32.
[BIB] Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC⁰ Functions. CoRR abs/1604.06617 (2016).
[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. CoRR abs/1610.05493 (2016).
[BIB] Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR abs/1603.09531 (2016).
[BIB] Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer:
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6(9): 74-93 (2016).
[BIB] Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Introduction. Dependence Logic 2016: 1-3.

2015

[BIB] Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. MFCS (1) 2015: 269-280.
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CSL 2015: 277-291.
[BIB] 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).
[BIB] Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Inform. 136(4): 297-316 (2015).
[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence Logic with a Majority Quantifier. Journal of Logic, Language and Information 24(3): 289-305 (2015).
[BIB] 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).
[BIB] 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.
[BIB] Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. CoRR abs/1504.06135 (2015).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015).
[BIB] Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) 2015: 281-292. Aktualisierte Version im arXiv.
[BIB] Arne Meier, Heribert Vollmer:
Komplexität von Algorithmen. Mathematik für Anwendungen 4. Lehmanns Media 2015. ISBN 978-3-86541-761-9.
[BIB] 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). Erratum zu 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).

2014

[BIB] Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer:
A Fragment of Dependence Logic Capturing Polynomial Time. Logical Methods in Computer Science 10(3) (2014).
[BIB] 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).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. CoRR abs/1404.0144 (2014).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CoRR abs/1410.6648 (2014).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. Advances in Modal Logic 2014: 353-372.

2013

[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301.
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Studia Logica 101(2): 343-366 (2013).
[BIB] Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. TOCT 5(1): 2:1-2:23 (2013).
[BIB] 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).
[BIB] Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer:
Extended Modal Dependence Logic. WoLLIC 2013: 126-137.
[BIB] Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice. CoRR abs/1303.6424 (2013).
[BIB] 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).
[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013).
[BIB] Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. WoLLIC 2013: 238-250.

2012

[BIB] Markus Aschinger, Conrad Drescher, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. ECAI 2012: 73-78.
[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400.
[BIB] Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354.
[BIB] 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).
[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC¹ and L. Theor. Comput. Sci. 417: 36-49 (2012).
[BIB] 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).
[BIB] Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electronic Colloquium on Computational Complexity (ECCC) 19: 79 (2012).
[BIB] Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. Bulletin of the EATCS 108: 49-89 (2012).
[BIB] Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012).

2011

[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. FSTTCS 2011: 252-263.
[BIB] Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95.
[BIB] 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).
[BIB] 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).
[BIB] Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Logical Methods in Computer Science 7(2) (2011).
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CoRR abs/1104.0607 (2011).
[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. CoRR abs/1109.4750 (2011).
[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011).
[BIB] (Ed.) 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.

2010

[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CSL 2010: 411-425.
[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC¹ and L. MFCS 2010: 306-317.
[BIB] Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43.
[BIB] 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).
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39(7): 3186-3206 (2010).
[BIB] 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. Logical Methods in Computer Science 8(3) (2010).
[BIB] Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Monoidal and Groupoidal Quantifiers. Logical Methods in Computer Science 6(3) (2010).
[BIB] Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010.
[BIB] Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010.
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games 2010.
[BIB] Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010.
[BIB] Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010.
[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC¹ and L. Electronic Colloquium on Computational Complexity (ECCC) 17: 101 (2010).
[BIB] Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010).
[BIB] Michael Thomas, Heribert Vollmer:
Complexity of Non-Monotonic Logics. CoRR abs/1009.1990 (2010).
[BIB] Michael Thomas, Heribert Vollmer:
Complexity of non-monotonic logics. Bulletin of the EATCS 102: 53-82 (2010).

2009

[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64.
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28.
[BIB] 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. Electr. Notes Theor. Comput. Sci. 231: 277-292 (2009).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009).
[BIB] 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).
[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Logical Methods in Computer Science 5(1) (2009).
[BIB] 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).
[BIB] 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). Zugehöriges Erratum vorhanden.

2008

[BIB] Nadia Creignou, Heribert Vollmer:
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37.
[BIB] Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Groupoidal Quantifiers. WoLLIC 2008: 238-248.
[BIB] Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL^*. Electr. Notes Theor. Comput. Sci. 223: 201-213 (2008).
[BIB] 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. Electronic Colloquium on Computational Complexity (ECCC) 15(028) (2008).
[BIB] 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).
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CoRR abs/0805.4072 (2008).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008).
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78.
[BIB] (Ed.) Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. Springer 2008. ISBN 978-3-540-76393-2.

2007

[BIB] Heribert Vollmer:
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Electronic Colloquium on Computational Complexity (ECCC) 14(045) (2007).
[BIB] Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electronic Colloquium on Computational Complexity (ECCC) 14(023) (2007).
[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62.
[BIB] Heribert Vollmer:
Computational Complexity of Constraint Satisfaction. CiE 2007: 748-757.

2006

[BIB] Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006).
[BIB] Friedrich Steimann, Heribert Vollmer:
Exploiting practical limitations of UML diagrams for model validation and execution. Software and Systems Modeling 5(1): 26-47 (2006).
[BIB] Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006.
[BIB] Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006.
[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electronic Colloquium on Computational Complexity (ECCC) 13(153) (2006).

2005

[BIB] Matthias Galota, Heribert Vollmer:
Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005).
[BIB] Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electronic Colloquium on Computational Complexity (ECCC)(024) (2005).
[BIB] Christian Glaßer, Steffen Reith, Heribert Vollmer:
The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005).
[BIB] Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005).
[BIB] Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82.

2004

[BIB] Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004).
[BIB] Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electronic Colloquium on Computational Complexity (ECCC)(100) (2004).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175.
[BIB] 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.
[BIB] Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004.
[BIB] Heribert Vollmer:
First-order logic with groupoidal quantifiers. ESSLLI 2003, Collecium Logicum Vol. VI, Kurt-Gödel-Society 2004: 71-105.
[BIB] Elmar Böhler, Nadia Creignou, Steffen Reith, Heribert Vollmer:
Playing with Boolean Blocks, Part II: Constraint Satisfaction Problems. (2004).

2003

[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003).
[BIB] Steffen Reith, Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003).
[BIB] Matthias Galota, Sven Kosub, Heribert Vollmer:
Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003).
[BIB] Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003).
[BIB] Matthias Galota, Heribert Vollmer:
Functions Computable in Polynomial Space. Electronic Colloquium on Computational Complexity (ECCC) 10(018) (2003).
[BIB] Heribert Vollmer:
Complexity Theory Made Easy. Developments in Language Theory 2003: 95-110.
[BIB] Elmar Böhler, Nadia Creignou, Steffen Reith, Heribert Vollmer:
Playing with Boolean Blocks, Part I: Post's Lattice with Applications to Complexity Theory. (2003).

2002

[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002).
[BIB] Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. Electronic Colloquium on Computational Complexity (ECCC)(056) (2002).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426.
[BIB] Elmar Böhler, Heribert Vollmer:
Boolean Functions and Post’s Lattice with Applications to Complexity Theory. (2002). Lecture Notes for Logic and Interaction 2002.

2001

[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001).
[BIB] Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. Discrete Mathematics & Theoretical Computer Science 4(2): 179-192 (2001).
[BIB] 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.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250.
[BIB] Matthias Galota, Heribert Vollmer:
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368.
[BIB] Steffen Reith, Heribert Vollmer:
Ist P=NP? Einführung in die Theorie der NP-Vollständigkeit. (2001). Technischer Bericht.

2000

[BIB] Todd Ebert, Heribert Vollmer:
On the Autoreducibility of Random Sequences. MFCS 2000: 333-342.
[BIB] Steffen Reith, Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649.
[BIB] Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000).
[BIB] Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000).
[BIB] Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178.
[BIB] Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175.
[BIB] Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The Many Faces of a Translation. ICALP 2000: 890-901.
[BIB] Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chicago J. Theor. Comput. Sci. 2000 (2000).

1999

[BIB] Heribert Vollmer:
Uniform characterizations of complexity classes. SIGACT News 30(1): 17-27 (1999).
[BIB] Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. ICALP 1999: 605-614.
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454.
[BIB] Heribert Vollmer:
Introduction to Circuit Complexity - A Uniform Approach. Springer 1999. ISBN 978-3-662-03927-4.
[BIB] Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chicago J. Theor. Comput. Sci. 1999 (1999).

1998

[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998).
[BIB] Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. CoRR cs.CC/9809115 (1998).
[BIB] Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998).
[BIB] Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617.
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Computational Complexity 7(3): 265-289 (1998).
[BIB] Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC¹ Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998).
[BIB] K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998).
[BIB] Heribert Vollmer:
Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. 207(1): 159-170 (1998).
[BIB] Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electronic Colloquium on Computational Complexity (ECCC) 5(22) (1998).
[BIB] Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Types. Electronic Colloquium on Computational Complexity (ECCC) 5(57) (1998).
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. Electronic Colloquium on Computational Complexity (ECCC) 5(59) (1998).
[BIB] Hans-Jörg Burtschick, Heribert Vollmer:
Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998).

1997

[BIB] Heribert Vollmer, Klaus W. Wagner:
On Operators of Higher Types. Computational Complexity Conference 1997: 174-184.
[BIB] Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI 1997: 99-123.
[BIB] Kenneth W. Regan, Heribert Vollmer:
Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997).
[BIB] Heribert Vollmer, Klaus W. Wagner:
Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312.

1996

[BIB] Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC¹ Computation. Computational Complexity Conference 1996: 12-21.
[BIB] Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Computational Complexity Conference 1996: 260-269.
[BIB] Heribert Vollmer, Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163(1&2): 245-258 (1996).
[BIB] Hans-Jörg Burtschick, Heribert Vollmer:
Lindstroem Quantifiers and Leaf Language Definability. Electronic Colloquium on Computational Complexity (ECCC) 3(5) (1996).
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Electronic Colloquium on Computational Complexity (ECCC) 3(35) (1996).
[BIB] Heribert Vollmer:
Relations Among Parallel and Sequential Computation Models. ASIAN 1996: 23-32.
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
On Type-2 Probabilistic Quantifiers. ICALP 1996: 369-380.
[BIB] Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees. Mathematical Systems Theory 29(4): 411-421 (1996).

1995

[BIB] Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting. Computational Complexity Conference 1995: 299-314.
[BIB] Heribert Vollmer, Klaus W. Wagner:
Complexity Classes of Optimization Functions. Inf. Comput. 120(2): 198-219 (1995).
[BIB] Lane A. Hemaspaandra, Heribert Vollmer:
The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995).

1994

[BIB] Heribert Vollmer:
On Different Reducibility Notions for Function Classes. STACS 1994: 449-460.
[BIB] Heribert Vollmer:
Komplexitätsklassen von Funktionen. Julius Maximilians University Würzburg, Germany 1994.

1993

[BIB] Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Computational Complexity Conference 1993: 200-207.
[BIB] Heribert Vollmer, Klaus W. Wagner:
The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4(4): 293-307 (1993).

1992

[BIB] 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

[BIB] Heribert Vollmer:
The Gap-Language-Technique Revisited. CSL 1990: 389-399.

Bereitgestellt durch die dblp computer science bibliography
Impressum | Datenschutz | Haftungsausschluss