Heribert Vollmer

According to our database1, Heribert Vollmer
  • authored at least 173 papers between 1990 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Complexity of Propositional Logics in Team Semantic.
ACM Trans. Comput. Log., 2018

Preface of STACS 2016 Special Issue.
Theory Comput. Syst., 2018

2017
Paradigms for Parameterized Enumeration.
Theory Comput. Syst., 2017

Modal independence logic.
J. Log. Comput., 2017

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth.
CoRR, 2017

On the Complexity of Hard Enumeration Problems.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
SAT and Interactions (Dagstuhl Seminar 16381).
Dagstuhl Reports, 2016

A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits.
CoRR, 2016

On the Complexity of Hard Enumeration Problems.
CoRR, 2016

Descriptive Complexity of #AC0 Functions.
CoRR, 2016

A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits.
Proceedings of the Logic, Language, Information, and Computation, 2016

Descriptive Complexity of #AC0 Functions.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Introduction.
Proceedings of the Dependence Logic, Theory and Applications, 2016

Expressivity and Complexity of Dependence Logic.
Proceedings of the Dependence Logic, Theory and Applications, 2016

2015
Dependence Logic with a Majority Quantifier.
Journal of Logic, Language and Information, 2015

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL.
Int. J. Found. Comput. Sci., 2015

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting.
Fundam. Inform., 2015

Logics for Dependence and Independence (Dagstuhl Seminar 15261).
Dagstuhl Reports, 2015

Circuits, Logic and Games (Dagstuhl Seminar 15401).
Dagstuhl Reports, 2015

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.
CoRR, 2015

Complexity of Propositional Independence and Inclusion Logic.
CoRR, 2015

On the parameterized complexity of non-monotonic logics.
Arch. Math. Log., 2015

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Complexity of Propositional Independence and Inclusion Logic.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Parameterized Enumeration for Modification Problems.
Proceedings of the Language and Automata Theory and Applications, 2015

A Van Benthem Theorem for Modal Team Semantics.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Komplexität von Algorithmen.
Mathematik für Anwendungen 4, Lehmanns Media, ISBN: 978-3-86541-761-9, 2015

2014
LoCo - A Logic for Configuration Problems.
ACM Trans. Comput. Log., 2014

A Fragment of Dependence Logic Capturing Polynomial Time
Logical Methods in Computer Science, 2014

A Van Benthem Theorem for Modal Team Semantics.
CoRR, 2014

Modal Independence Logic.
CoRR, 2014

Modal Independence Logic.
Proceedings of the Advances in Modal Logic 10, 2014

2013
Verifying proofs in constant depth.
TOCT, 2013

Complexity Results for Modal Dependence Logic.
Studia Logica, 2013

Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071).
Dagstuhl Reports, 2013

Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice
CoRR, 2013

Paradigms for Parameterized Enumeration.
CoRR, 2013

Parameterized Enumeration with Ordering.
CoRR, 2013

Model Checking for Modal Dependence Logic: An Approach through Post's Lattice.
Proceedings of the Logic, Language, Information, and Computation, 2013

Extended Modal Dependence Logic.
Proceedings of the Logic, Language, Information, and Computation, 2013

Paradigms for Parameterized Enumeration.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
ACM Trans. Comput. Log., 2012

Counting classes and the fine structure between NC1 and L.
Theor. Comput. Sci., 2012

The complexity of reasoning for fragments of default logic.
J. Log. Comput., 2012

Verifying Proofs in Constant Depth.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Complexity of Model Checking for Logics over Kripke models.
Bulletin of the EATCS, 2012

SAT Interactions (Dagstuhl Seminar 12471).
Dagstuhl Reports, 2012

Parameterized Complexity of Weighted Satisfiability Problems.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

On the Parameterized Complexity of Default Logic and Autoepistemic Logic.
Proceedings of the Language and Automata Theory and Applications, 2012

LoCo - A Logic for Configuration Problems.
Proceedings of the ECAI 2012, 2012

2011
The tractability of model checking for LTL: The good, the bad, and the ugly fragments.
ACM Trans. Comput. Log., 2011

On the Parameterized Complexity of Default Logic and Autoepistemic Logic
CoRR, 2011

Dependence logic with a majority quantifier
CoRR, 2011

Complexity Results for Modal Dependence Logic
CoRR, 2011

Model Checking CTL is Almost Always Inherently Sequential
Logical Methods in Computer Science, 2011

Proof complexity of propositional default logic.
Arch. Math. Log., 2011

Verifying Proofs in Constant Depth.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Dependence logic with a majority quantifier.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Extensional Uniformity for Boolean Circuits.
SIAM J. Comput., 2010

The Complexity of Problems for Quantified Constraints.
Theory Comput. Syst., 2010

Counting Classes and the Fine Structure between NC1 and L.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Complexity of non-monotonic logics.
Bulletin of the EATCS, 2010

On Second-Order Monadic Monoidal and Groupoidal Quantifiers
Logical Methods in Computer Science, 2010

Complexity of Non-Monotonic Logics
CoRR, 2010

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Logical Methods in Computer Science, 2010

The Complexity of Reasoning for Fragments of Autoepistemic Logic
CoRR, 2010

Proof Complexity of Propositional Default Logic.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Counting Classes and the Fine Structure between NC1 and L.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

10061 Executive Summary - Circuits, Logic, and Games.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

10061 Abstracts Collection - Circuits, Logic, and Games.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Complexity Results for Modal Dependence Logic.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

The Complexity of Reasoning for Fragments of Autoepistemic Logic.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Proof Complexity of Propositional Default Logic.
Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Complexity Results for Modal Dependence Logic.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis.
Theory Comput. Syst., 2009

The complexity of satisfiability problems: Refining Schaefer's theorem.
J. Comput. Syst. Sci., 2009

The complexity of propositional implication.
Inf. Process. Lett., 2009

The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci., 2009

The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electr. Notes Theor. Comput. Sci., 2009

The Complexity of Generalized Satisfiability for Linear Temporal Logic
Logical Methods in Computer Science, 2009

Model Checking CTL is Almost Always Inherently Sequential.
Proceedings of the TIME 2009, 2009

The Complexity of Reasoning for Fragments of Default Logic.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Electr. Notes Theor. Comput. Sci., 2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments.
Electronic Colloquium on Computational Complexity (ECCC), 2008

The Complexity of Propositional Implication
CoRR, 2008

The Complexity of Reasoning for Fragments of Default Logic
CoRR, 2008

Extensional Uniformity for Boolean Circuits
CoRR, 2008

The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
CoRR, 2008

On Second-Order Monadic Groupoidal Quantifiers.
Proceedings of the Logic, 2008

Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?.
Proceedings of the Complexity of Constraints, 2008

Extensional Uniformity for Boolean Circuits.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
The Complexity of Problems for Quantified Constraints.
Electronic Colloquium on Computational Complexity (ECCC), 2007

The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis.
Electronic Colloquium on Computational Complexity (ECCC), 2007

The Complexity of Generalized Satisfiability for Linear Temporal Logic.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Computational Complexity of Constraint Satisfaction.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Exploiting practical limitations of UML diagrams for model validation and execution.
Software and System Modeling, 2006

The many faces of a translation.
J. Comput. Syst. Sci., 2006

The Complexity of Generalized Satisfiability for Linear Temporal Logic.
Electronic Colloquium on Computational Complexity (ECCC), 2006

06451 Abstracts Collection -- Circuits, Logic, and Games .
Proceedings of the Circuits, Logic, and Games, 08.11. - 10.11.2006, 2006

06451 Executive Summary -- Circuits, Logic, and Games .
Proceedings of the Circuits, Logic, and Games, 08.11. - 10.11.2006, 2006

06401 Abstracts Collection - Complexity of Constraints.
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

06401 Executive Summary - Complexity of Constraints.
Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

2005
Bases for Boolean co-clones.
Inf. Process. Lett., 2005

Functions computable in polynomial space.
Inf. Comput., 2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electronic Colloquium on Computational Complexity (ECCC), 2005

The complexity of base station positioning in cellular networks.
Discrete Applied Mathematics, 2005

The Complexity of Satisfiability Problems: Refining Schaefer's Theorem.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Arithmetic Circuits and Polynomial Replacement Systems.
SIAM J. Comput., 2004

The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
Electronic Colloquium on Computational Complexity (ECCC), 2004

The Complexity of Boolean Constraint Isomorphism.
Proceedings of the STACS 2004, 2004

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
Proceedings of the SAT 2004, 2004

2003
On the Autoreducibility of Random Sequences.
SIAM J. Comput., 2003

Generic separations and leaf languages.
Math. Log. Q., 2003

Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Inf. Comput., 2003

Functions Computable in Polynomial Space
Electronic Colloquium on Computational Complexity (ECCC), 2003

The Complexity of Boolean Constraint Isomorphism
CoRR, 2003

Complexity Theory Made Easy.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
On the Autoreducibility of Random Sequences
Electronic Colloquium on Computational Complexity (ECCC), 2002

Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR, 2002

Equivalence and Isomorphism for Boolean Constraint Satisfaction.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
The Descriptive Complexity Approach to LOGCFL.
J. Comput. Syst. Sci., 2001

Finite Automata with Generalized Acceptance Criteria.
Discrete Mathematics & Theoretical Computer Science, 2001

Partially-Ordered Two-Way Automata: A New Characterization of DA.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

A polynomial-time approximation scheme for base station positioning in UMTS networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
A note on closure properties of logspace MOD classes.
Inf. Process. Lett., 2000

Uniform Characterizations of Complexity Classes of Functions.
Int. J. Found. Comput. Sci., 2000

Characterizing Small Depth and Small Space Classes by Operators of Higher Type.
Chicago J. Theor. Comput. Sci., 2000

Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On the Autoreducibility of Random Sequences.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

The Many Faces of a Translation.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

The Complexity of Base Station Positioning in Cellular Networks.
ICALP Satellite Workshops, 2000

Arithmetic Circuits and Polynomial Replacement Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Uniform characterizations of complexity classes.
SIGACT News, 1999

Was leistet die Komplexitätstheorie für die Praxis?
Informatik Spektrum, 1999

Complements of Multivalued Functions.
Chicago J. Theor. Comput. Sci., 1999

The Descriptive Complexity Approach to LOGCFL.
Proceedings of the STACS 99, 1999

Finite Automata with Generalized Acceptance Criteria.
Proceedings of the Automata, 1999

Introduction to Circuit Complexity - A Uniform Approach.
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-03927-4, 1999

1998
Relating Polynomial Time to Constant Depth.
Theor. Comput. Sci., 1998

The Chain Method to Separate Counting Classes.
Theory Comput. Syst., 1998

Nondeterministic NC1 Computation.
J. Comput. Syst. Sci., 1998

Lindström Quantifiers and Leaf Language Definability.
Int. J. Found. Comput. Sci., 1998

The Descriptive Complexity Approach to LOGCFL
Electronic Colloquium on Computational Complexity (ECCC), 1998

Characterizing Small Depth and Small Space Classes by Operators of Higher Types
Electronic Colloquium on Computational Complexity (ECCC), 1998

The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Electronic Colloquium on Computational Complexity (ECCC), 1998

The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
CoRR, 1998

A Generalized Quantifier Concept in Computational Complexity Theory
CoRR, 1998

The descriptive complexity approach to LOGCFL
CoRR, 1998

Probabilistic Type-2 Operators and "Almost"-Classes.
Computational Complexity, 1998

Uniformly Defining Complexity Classes of Functions.
Proceedings of the STACS 98, 1998

1997
Gap-Languages and Log-Time Complexity Classes.
Theor. Comput. Sci., 1997

A Generalized Quantifier Concept in Computational Complexity Theory.
Proceedings of the Generalized Quantifiers and Computation, 1997

On Operators of Higher Types.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

Measure One Results in Computational Complexity Theory.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions.
Theor. Comput. Sci., 1996

On Balanced Versus Unbalanced Computation Trees.
Mathematical Systems Theory, 1996

Probabilistic Type-2 Operators and "Almost"-Classes
Electronic Colloquium on Computational Complexity (ECCC), 1996

Lindstroem Quantifiers and Leaf Language Definability
Electronic Colloquium on Computational Complexity (ECCC), 1996

On Type-2 Probabilistic Quantifiers.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Complements of Multivalued Functions.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Nondeterministic NC1 Computation.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Relations Among Parallel and Sequential Computation Models.
Proceedings of the Concurrency and Parallelism, 1996

1995
Complexity Classes of Optimization Functions
Inf. Comput., August, 1995

The satanic notations: counting classes beyond #P and other definitional adventures.
SIGACT News, 1995

On the Power of Number-Theoretic Operations with Respect to Counting.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
Komplexitätsklassen von Funktionen.
PhD thesis, 1994

On Different Reducibility Notions for Function Classes.
Proceedings of the STACS 94, 1994

1993
The Complexity of Finding Middle Elements.
Int. J. Found. Comput. Sci., 1993

On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

1990
The Gap-Language-Technique Revisited.
Proceedings of the Computer Science Logic, 4th Workshop, 1990


  Loading...