Heribert Vollmer Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert 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)
2008
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Springer 2008
93no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Heribert Vollmer: Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJuha Kontinen, Heribert Vollmer: On Second-Order Monadic Groupoidal Quantifiers. WoLLIC 2008: 238-248
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Michael Thomas, Heribert Vollmer: Extensional Uniformity for Boolean Circuits CoRR abs/0805.4072: (2008)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Reasoning for Fragments of Default Logic CoRR abs/0808.3884: (2008)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer: The Complexity of Propositional Implication CoRR abs/0811.0959: (2008)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArne 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)
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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): (2008)
2007
82no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: Circuits, Logic, and Games, 08.11. - 10.11.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Computational Complexity of Constraint Satisfaction. CiE 2007: 748-757
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer: The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert 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)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert 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)
2006
77no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: Complexity of Constraints, 01.10. - 06.10.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFriedrich Steimann, Heribert Vollmer: Exploiting practical limitations of UML diagrams for model validation and execution. Software and System Modeling 5(1): 26-47 (2006)
2005
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer: The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Steffen Reith, Heribert Vollmer: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
2004
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004)
2003
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Complexity Theory Made Easy. Developments in Language Theory 2003: 95-110
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism CoRR cs.CC/0306134: (2003)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: Functions Computable in Polynomial Space Electronic Colloquium on Computational Complexity (ECCC) 10(018): (2003)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteffen Reith, Heribert Vollmer: Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Sven Kosub, Heribert Vollmer: Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTodd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003)
2002
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR cs.CC/0202036: (2002)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTodd Ebert, Wolfgang Merkle, Heribert Vollmer: On the Autoreducibility of Random Sequences Electronic Colloquium on Computational Complexity (ECCC)(056): (2002)
2001
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Galota, Heribert Vollmer: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo Peichl, Heribert Vollmer: Finite Automata with Generalized Acceptance Criteria. Discrete Mathematics & Theoretical Computer Science 4(2): 179-192 (2001)
46no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)
2000
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The Many Faces of a Translation. ICALP 2000: 890-901
43no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Glaßer, Steffen Reith, Heribert Vollmer: The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTodd Ebert, Heribert Vollmer: On the Autoreducibility of Random Sequences. MFCS 2000: 333-342
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteffen Reith, Heribert Vollmer: Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManindra 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)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich Hertrampf, Steffen Reith, Heribert Vollmer: A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Heinz Schmitz, Heribert Vollmer: Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000)
1999
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimo Peichl, Heribert Vollmer: Finite Automata with Generalized Acceptance Criteria. ICALP 1999: 605-614
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer: Complements of Multivalued Functions. Chicago J. Theor. Comput. Sci. 1999: (1999)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Was leistet die Komplexitätstheorie für die Praxis? Informatik Spektrum 22(5): 317-327 (1999)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Uniform characterizations of complexity classes. SIGACT News 30(1): 17-27 (1999)
1998
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSven Kosub, Heinz Schmitz, Heribert Vollmer: Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL CoRR cs.CC/9809114: (1998)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: A Generalized Quantifier Concept in Computational Complexity Theory CoRR cs.CC/9809115: (1998)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae CoRR cs.CC/9809116: (1998)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald V. Book, Heribert Vollmer, Klaus W. Wagner: Probabilistic Type-2 Operators and "Almost"-Classes. Computational Complexity 7(3): 265-289 (1998)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSteffen Reith, Heribert Vollmer: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae Electronic Colloquium on Computational Complexity (ECCC) 5(22): (1998)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManindra 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)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998)
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Jörg Burtschick, Heribert Vollmer: Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998)
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC1 Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. 207(1): 159-170 (1998)
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLK. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998)
1997
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer, Klaus W. Wagner: Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI 1997: 99-123
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer, Klaus W. Wagner: On Operators of Higher Types. IEEE Conference on Computational Complexity 1997: 174-184
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKenneth W. Regan, Heribert Vollmer: Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997)
1996
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: Relations Among Parallel and Sequential Computation Models. ASIAN 1996: 23-32
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald V. Book, Heribert Vollmer, Klaus W. Wagner: On Type-2 Probabilistic Quantifiers. ICALP 1996: 369-380
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer: Nondeterministic NC1 Computation. IEEE Conference on Computational Complexity 1996: 12-21
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStephen 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald V. Book, Heribert Vollmer, Klaus W. Wagner: Probabilistic Type-2 Operators and ``Almost''-Classes Electronic Colloquium on Computational Complexity (ECCC) 3(35): (1996)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans-Jörg Burtschick, Heribert Vollmer: Lindstroem Quantifiers and Leaf Language Definability Electronic Colloquium on Computational Complexity (ECCC) 3(5): (1996)
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: On Balanced Versus Unbalanced Computation Trees. Mathematical Systems Theory 29(4): 411-421 (1996)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer, Klaus W. Wagner: Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163(1&2): 245-258 (1996)
1995
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich 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
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer, Klaus W. Wagner: Complexity Classes of Optimization Functions Inf. Comput. 120(2): 198-219 (1995)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Heribert Vollmer: The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: On Different Reducibility Notions for Function Classes. STACS 1994: 449-460
1993
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich 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
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer, Klaus W. Wagner: The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4(4): 293-307 (1993)
1992
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeribert Vollmer: The Gap-Language-Technique Revisited. CSL 1990: 389-399

Coauthor Index

1Manindra Agrawal [26] [40]
2Eric Allender [26] [40] [61] [69] [96]
3Helmut Alt [93]
4Michael Bauland [61] [63] [64] [67] [69] [72] [79] [80] [83] [84] [89] [96] [99]
5Olaf Beyersdorff [86] [87] [98] [100]
6Elmar Böhler [52] [53] [58] [62] [65] [67] [79]
7Ronald V. Book [12] [15] [28]
8Hans-Jörg Burtschick [11] [24]
9Hervé Caussinus [14] [23]
10Philippe Chapdelaine [63] [64]
11Nadia Creignou [63] [64] [67] [73] [74] [77] [79] [91] [94]
12K. Cronauer [21]
13Samir Datta [26] [40]
14Martin Dietzfelbinger [93]
15Todd Ebert [42] [51] [54]
16Stephen A. Fenner [13] [35]
17Matthias Galota [49] [50] [55] [57] [66]
18Christian Glaßer (Christian Glasser) [43] [49] [68]
19Frederic Green [13] [35]
20Edith Hemaspaandra (Edith Spaan) [52] [53] [58] [62]
21Lane A. Hemaspaandra (Lane A. Hemachandra) [6]
22Miki Hermann [63] [64]
23Ulrich Hertrampf [2] [4] [8] [10] [21] [39]
24Steven Homer [13] [35]
25Neil Immerman [61] [69] [96]
26Phokion G. Kolaitis [73] [74] [77] [94]
27Juha Kontinen [90]
28Sven Kosub [32] [38] [55]
29Clemens Lautemann [2] [4] [25] [31] [36] [46]
30Pierre McKenzie [14] [23] [25] [31] [36] [44] [45] [46] [60] [71] [88] [92]
31Arne Meier [85] [86] [87] [97] [98] [100]
32Wolfgang Merkle [51] [54]
33Martin Mundhenk [84] [85] [89] [97] [99]
34Timo Peichl [37] [47]
35Kenneth W. Regan [17]
36Rüdiger Reischuk [93]
37Steffen Reith [27] [29] [39] [41] [43] [49] [52] [53] [56] [58] [62] [65] [67] [68] [79]
38Christian Scheideler [93]
39Heinz Schmitz [32] [38]
40Thomas Schneider [72] [80] [83] [84] [89] [99]
41Henning Schnoor [61] [65] [67] [69] [72] [79] [80] [83] [84] [89] [96] [99]
42Ilka Schnoor [72] [80] [83] [84] [89] [99]
43Thomas Schwentick [2] [4] [25] [31] [36] [44] [46] [48] [71] [75] [76] [82]
44Alan L. Selman [13] [35]
45Friedrich Steimann [70]
46Denis Thérien [14] [23] [44] [48] [71] [75] [76] [82]
47Thomas Thierauf [13] [35]
48Michael Thomas [85] [86] [87] [88] [92] [97] [98] [100]
49Berthold Vöcking [93]
50Dorothea Wagner [93]
51Klaus W. Wagner [2] [3] [4] [7] [8] [9] [10] [12] [15] [18] [20] [21] [26] [28] [40] [45] [60]

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)