Heribert Vollmer

Peter Lohmann, Heribert Vollmer: Complexity Results for Modal Dependence Logic. Studia Logica 101(2): 343-366 (2013)

Julian-Steffen Müller, Heribert Vollmer: Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice. CoRR abs/1303.6424 (2013)

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)

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)

Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas: The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17 (2012)

Markus Aschinger, Conrad Drescher, Heribert Vollmer: LoCo - A Logic for Configuration Problems. ECAI 2012: 73-78

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer: On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400

Nadia Creignou, Heribert Vollmer: Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354

Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer: A Fragment of Dependence Logic Capturing Polynomial Time. CoRR abs/1210.3321 (2012)

Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer: SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012)

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)

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, isbn 978-3-642-15327-3

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)

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)

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 (2011)

Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer: Dependence logic with a majority quantifier. FSTTCS 2011: 252-263

Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. MFCS 2011: 84-95

Peter Lohmann, Heribert Vollmer: Complexity Results for Modal Dependence Logic. CoRR abs/1104.0607 (2011)

Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer: Dependence logic with a majority quantifier. CoRR abs/1109.4750 (2011)

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer: On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011)

Juha Kontinen, Heribert Vollmer: On Second-Order Monadic Monoidal and Groupoidal Quantifiers. Logical Methods in Computer Science 6(3) (2010)

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)

Michael Thomas, Heribert Vollmer: Complexity of non-monotonic logics. Bulletin of the EATCS 102: 53-82 (2010)

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)

Pierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39(7): 3186-3206 (2010)

Peter Lohmann, Heribert Vollmer: Complexity Results for Modal Dependence Logic. CSL 2010: 411-425

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

Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer: Proof Complexity of Propositional Default Logic. SAT 2010: 30-43

Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010)

Michael Thomas, Heribert Vollmer: Complexity of Non-Monotonic Logics. CoRR abs/1009.1990 (2010)

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)

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)

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)

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)

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009)

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)

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)

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider: Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, isbn 978-3-540-76393-2

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)

Pierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78

Nadia Creignou, Heribert Vollmer: Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37

Juha Kontinen, Heribert Vollmer: On Second-Order Monadic Groupoidal Quantifiers. WoLLIC 2008: 238-248

Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): 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

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)

Pierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits. CoRR abs/0805.4072 (2008)

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008)

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008)

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)

Heribert Vollmer: Computational Complexity of Constraint Satisfaction. CiE 2007: 748-757

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62

Thomas Schwentick, Denis Thérien, Heribert Vollmer (Eds.): Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

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)

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)

Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)

Friedrich Steimann, Heribert Vollmer: Exploiting practical limitations of UML diagrams for model validation and execution. Software and System Modeling 5(1): 26-47 (2006)

Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006

Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006

Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006

Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006

Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006

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)

Christian Glaßer, Steffen Reith, Heribert Vollmer: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005)

Matthias Galota, Heribert Vollmer: Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005)

Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)

Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82

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)

Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004)

Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004

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

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175

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)

Steffen Reith, Heribert Vollmer: Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003)

Matthias Galota, Sven Kosub, Heribert Vollmer: Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003)

Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003)

Heribert Vollmer: Complexity Theory Made Easy. Developments in Language Theory 2003: 95-110

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003)

Matthias Galota, Heribert Vollmer: Functions Computable in Polynomial Space. Electronic Colloquium on Computational Complexity (ECCC) 10(018) (2003)

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426

Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002)

Todd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. Electronic Colloquium on Computational Complexity (ECCC)(056) (2002)

Timo Peichl, Heribert Vollmer: Finite Automata with Generalized Acceptance Criteria. Discrete Mathematics & Theoretical Computer Science 4(2): 179-192 (2001)

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)

Matthias Galota, Heribert Vollmer: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368

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

Thomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250

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)

Sven Kosub, Heinz Schmitz, Heribert Vollmer: Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000)

Ulrich Hertrampf, Steffen Reith, Heribert Vollmer: A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000)

Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175

Christian Glaßer, Steffen Reith, Heribert Vollmer: The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178

Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901

Todd Ebert, Heribert Vollmer: On the Autoreducibility of Random Sequences. MFCS 2000: 333-342

Steffen Reith, Heribert Vollmer: Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649

Heribert Vollmer: Introduction to circuit complexity - a uniform approach. Texts in theoretical computer science, Springer 1999, isbn 978-3-540-64310-4, pp. I-XI, 1-270

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)

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

Heribert Vollmer: Uniform characterizations of complexity classes. SIGACT News 30(1): 17-27 (1999)

Timo Peichl, Heribert Vollmer: Finite Automata with Generalized Acceptance Criteria. ICALP 1999: 605-614

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454

Ronald V. Book, Heribert Vollmer, Klaus W. Wagner: Probabilistic Type-2 Operators and "Almost"-Classes. Computational Complexity 7(3): 265-289 (1998)

Hans-Jörg Burtschick, Heribert Vollmer: Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998)

Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC¹ Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998)

K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998)

Heribert Vollmer: Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. 207(1): 159-170 (1998)

Sven Kosub, Heinz Schmitz, Heribert Vollmer: Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998)

Heribert Vollmer: A Generalized Quantifier Concept in Computational Complexity Theory. CoRR cs.CC/9809115 (1998)

Steffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998)

Steffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electronic Colloquium on Computational Complexity (ECCC) 5(22) (1998)

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)

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. Electronic Colloquium on Computational Complexity (ECCC) 5(59) (1998)

Kenneth W. Regan, Heribert Vollmer: Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997)

Heribert Vollmer, Klaus W. Wagner: Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312

Heribert Vollmer, Klaus W. Wagner: On Operators of Higher Types. IEEE Conference on Computational Complexity 1997: 174-184

Heribert Vollmer: A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI 1997: 99-123

Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: On Balanced Versus Unbalanced Computation Trees. Mathematical Systems Theory 29(4): 411-421 (1996)

Heribert Vollmer, Klaus W. Wagner: Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163(1&2): 245-258 (1996)

Heribert Vollmer: Relations Among Parallel and Sequential Computation Models. ASIAN 1996: 23-32

Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC¹ Computation. IEEE Conference on Computational Complexity 1996: 12-21

Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. IEEE Conference on Computational Complexity 1996: 260-269

Ronald V. Book, Heribert Vollmer, Klaus W. Wagner: On Type-2 Probabilistic Quantifiers. ICALP 1996: 369-380

Hans-Jörg Burtschick, Heribert Vollmer: Lindstroem Quantifiers and Leaf Language Definability. Electronic Colloquium on Computational Complexity (ECCC) 3(5) (1996)

Ronald V. Book, Heribert Vollmer, Klaus W. Wagner: Probabilistic Type-2 Operators and ``Almost''-Classes. Electronic Colloquium on Computational Complexity (ECCC) 3(35) (1996)

Heribert Vollmer, Klaus W. Wagner: Complexity Classes of Optimization Functions. Inf. Comput. 120(2): 198-219 (1995)

Lane A. Hemaspaandra, Heribert Vollmer: The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995)

Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: On the Power of Number-Theoretic Operations with Respect to Counting. Structure in Complexity Theory Conference 1995: 299-314

Heribert Vollmer: On Different Reducibility Notions for Function Classes. STACS 1994: 449-460

Heribert Vollmer, Klaus W. Wagner: The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4(4): 293-307 (1993)

Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Structure in Complexity Theory Conference 1993: 200-207

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)

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