dblp.uni-trier.dewww.uni-trier.de

Heribert Vollmer Vis

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

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)