Heribert Vollmer - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

The Complexity of Problems for Quantified ConstraintsMichael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer. mst, 47(2):454-490, 2010. [doi]

Proof Complexity of Propositional Default LogicOlaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer. sat 2010: 30-43 [doi]

Counting Classes and the Fine Structure between NC:::1::: and LSamir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer. eccc, 17:101, 2010. [doi]

Counting Classes and the Fine Structure between NC:::1::: and LSamir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer. mfcs 2010: 306-317 [doi]

Complexity Results for Modal Dependence LogicPeter Lohmann, Heribert Vollmer. csl 2010: 411-425 [doi]

Extensional Uniformity for Boolean CircuitsPierre McKenzie, Michael Thomas, Heribert Vollmer. siamcomp, 39(7):3186-3206, 2010. [doi]

2009

The complexity of satisfiability problems: Refining Schaefer s theoremEric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. jcss, 75(4):245-254, 2009. [doi]

The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly FragmentsMichael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. ENTCS, 231:277-292, 2009. [doi]

The complexity of propositional implicationOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer. ipl, 109(18):1071-1077, 2009. [doi]

The Complexity of Reasoning for Fragments of Default LogicOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer. sat 2009: 51-64 [doi]

Model Checking CTL is Almost Always Inherently SequentialOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider. time 2009: 21-28 [doi]

The Complexity of Satisfiability for Fragments of CTL and CTL*Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk. ijfcs, 20(5):901-918, 2009. [doi]

2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly FragmentsMichael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. eccc, 15(028), 2008. [doi]

Boolean Constraint Satisfaction Problems: When Does Post s Lattice Help?Nadia Creignou, Heribert Vollmer. dagstuhl 2008: 3-37 [doi]

Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer, editors, Volume 5250 of Lecture Notes in Computer Science, Springer, 2008. [doi]

On Second-Order Monadic Groupoidal QuantifiersJuha Kontinen, Heribert Vollmer. wollic 2008: 238-248 [doi]

Extensional Uniformity for Boolean CircuitsPierre McKenzie, Michael Thomas, Heribert Vollmer. csl 2008: 64-78 [doi]

The Complexity of Satisfiability for Fragments of CTL and CTL:::*:::Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer. ENTCS, 223:201-213, 2008. [doi]

2007

The Complexity of Generalized Satisfiability for Linear Temporal LogicMichael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. fossacs 2007: 48-62 [doi]

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

The complexity of deciding if a Boolean function can be computed by circuits over a restricted basisHeribert Vollmer. eccc, 14(045), 2007. [doi]

The Complexity of Problems for Quantified ConstraintsHeribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor. eccc, 14(023), 2007. [doi]

Computational Complexity of Constraint SatisfactionHeribert Vollmer. cie 2007: 748-757 [doi]

2006

The Complexity of Generalized Satisfiability for Linear Temporal LogicMichael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. eccc, 13(153), 2006. [doi]

06401 Abstracts Collection - Complexity of ConstraintsNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer. dagstuhl 2006: [doi]

06401 Executive Summary - Complexity of ConstraintsNadia Creignou, Phokion G. Kolaitis, Heribert Vollmer. dagstuhl 2006: [doi]

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

The many faces of a translationPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. jcss, 72(1):163-179, 2006. [doi]

06451 Executive Summary -- Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer. dagstuhl 2007: [doi]

06451 Abstracts Collection -- Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer. dagstuhl 2007: [doi]

Exploiting practical limitations of UML diagrams for model validation and executionFriedrich Steimann, Heribert Vollmer. SoSyM, 5(1):26-47, 2006. [doi]

2005

2004

2003

On the Autoreducibility of Random SequencesTodd Ebert, Wolfgang Merkle, Heribert Vollmer. siamcomp, 32(6):1542-1569, 2003. [doi]

Generic separations and leaf languagesMatthias Galota, Sven Kosub, Heribert Vollmer. mlq, 49(4):353-362, 2003. [doi]

Functions Computable in Polynomial SpaceMatthias Galota, Heribert Vollmer. eccc, 10(018), 2003. [doi]

Optimal satisfiability for propositional calculi and constraint satisfaction problemsSteffen Reith, Heribert Vollmer. iandc, 186(1):1-19, 2003. [doi]

Complexity Theory Made EasyHeribert Vollmer. dlt 2003: 95-110 [doi]

2002

Equivalence and Isomorphism for Boolean Constraint SatisfactionElmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer. csl 2002: 412-426 [doi]

On the Autoreducibility of Random SequencesTodd Ebert, Wolfgang Merkle, Heribert Vollmer. eccc, (056), 2002. [doi]

2001

2000

Characterizing Small Depth and Small Space Classes by Operators of Higher TypeManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. cjtcs, 2000, 2000. [doi]

On the Autoreducibility of Random SequencesTodd Ebert, Heribert Vollmer. mfcs 2000: 333-342 [doi]

The Complexity of Base Station Positioning in Cellular NetworksChristian Glaßer, Steffen Reith, Heribert Vollmer. icalp 2000: 167-178

A note on closure properties of logspace MOD classesUlrich Hertrampf, Steffen Reith, Heribert Vollmer. ipl, 75(3):91-93, 2000. [doi]

Uniform Characterizations of Complexity Classes of FunctionsSven Kosub, Heinz Schmitz, Heribert Vollmer. ijfcs, 11(4):525-551, 2000.

Arithmetic Circuits and Polynomial Replacement SystemsPierre McKenzie, Heribert Vollmer, Klaus W. Wagner. fsttcs 2000: 164-175 [doi]

The Many Faces of a TranslationPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. icalp 2000: 890-901 [doi]

Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction ProblemsSteffen Reith, Heribert Vollmer. mfcs 2000: 640-649 [doi]

1999

1998

Characterizing Small Depth and Small Space Classes by Operators of Higher TypesManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. eccc, 5(57), 1998. [doi]

Probabilistic Type-2 Operators and Almost -ClassesRonald V. Book, Heribert Vollmer, Klaus W. Wagner. cc, 7(3):265-289, 1998. [doi]

Lindström Quantifiers and Leaf Language DefinabilityHans-Jörg Burtschick, Heribert Vollmer. ijfcs, 9(3):277-294, 1998.

Nondeterministic ::::NC:::::::1::: ComputationHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer. jcss, 57(2):200-212, 1998.

The Chain Method to Separate Counting ClassesK. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. mst, 31(1):93-108, 1998.

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

The Descriptive Complexity Approach to LOGCFLClemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer. eccc, 5(59), 1998. [doi]

The Complexity of Computing Optimal Assignments of Generalized Propositional FormulaeSteffen Reith, Heribert Vollmer. eccc, 5(22), 1998. [doi]

1997

Gap-Languages and Log-Time Complexity ClassesKenneth W. Regan, Heribert Vollmer. TCS, 188(1-2):101-116, 1997. [doi]

On Operators of Higher TypesHeribert Vollmer, Klaus W. Wagner. cocoon 1997: 174-184 [doi]

Measure One Results in Computational Complexity TheoryHeribert Vollmer, Klaus W. Wagner. BIRTHDAY 1997: 285-312

A Generalized Quantifier Concept in Computational Complexity TheoryHeribert Vollmer. esslli 2000: 99-123 [doi]

1996

On Type-2 Probabilistic QuantifiersRonald V. Book, Heribert Vollmer, Klaus W. Wagner. icalp 1996: 369-380

Probabilistic Type-2 Operators and Almost -ClassesRonald V. Book, Heribert Vollmer, Klaus W. Wagner. eccc, 3(35), 1996. [doi]

Lindstroem Quantifiers and Leaf Language DefinabilityHans-Jörg Burtschick, Heribert Vollmer. eccc, 3(5), 1996. [doi]

Nondeterministic NC:::1::: ComputationHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer. cocoon 1996: 12-21 [doi]

Complements of Multivalued FunctionsStephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer. cocoon 1996: 260-269 [doi]

On Balanced Versus Unbalanced Computation TreesUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. mst, 29(4):411-421, 1996.

Recursion Theoretic Characterizations of Complexity Classes of Counting FunctionsHeribert Vollmer, Klaus W. Wagner. TCS, 163(1&2):245-258, 1996. [doi]

Relations Among Parallel and Sequential Computation ModelsHeribert Vollmer. asian 1996: 23-32

1995

The satanic notations: counting classes beyond #P and other definitional adventuresLane A. Hemaspaandra, Heribert Vollmer. sigact, 26(1):2-13, 1995. [doi]

On the Power of Number-Theoretic Operations with Respect to CountingUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. cocoon 1995: 299-314

Complexity Classes of Optimization FunctionsHeribert Vollmer, Klaus W. Wagner. iandc, 120(2):198-219, August 1995.

1994

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

1993

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

The Complexity of Finding Middle ElementsHeribert Vollmer, Klaus W. Wagner. ijfcs, 4(4):293-307, 1993.

1990

The Gap-Language-Technique RevisitedHeribert Vollmer. csl 1991: 389-399