Heribert Vollmer
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
47
Venues
15
Active years
1990–2026
Best venue rank
A*
Where they publish
Papers
47 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | KR | Recurrent Graph Neural Networks and Arithmetic Circuits. | Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer |
| 2022 | MFCS | Enumeration Classes Defined by Circuits. | Nadia Creignou, Arnaud Durand, Heribert Vollmer |
| 2021 | WoLLIC | A Logical Characterization of Constant-Depth Circuits over the Reals. | Timon Barlag, Heribert Vollmer |
| 2019 | MFCS | Counting of Teams in First-Order Team Logics. | Anselm Haak, Juha Kontinen, Fabian Mller, Heribert Vollmer, Fan Yang |
| 2018 | LICS | Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. | Arnaud Durand, Anselm Haak, Heribert Vollmer |
| 2017 | LATA | On the Complexity of Hard Enumeration Problems. | Nadia Creignou, Markus Krll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer |
| 2016 | CSL | Descriptive Complexity of #AC | Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer |
| 2016 | WoLLIC | A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. | Anselm Haak, Heribert Vollmer |
| 2015 | CSL | A Van Benthem Theorem for Modal Team Semantics. | Juha Kontinen, Julian-Steffen Mller, Henning Schnoor, Heribert Vollmer |
| 2015 | LATA | Parameterized Enumeration for Modification Problems. | Nadia Creignou, Rada Ktari, Arne Meier, Julian-Steffen Mller, Frdric Olive, Heribert Vollmer |
| 2015 | MFCS | Complexity of Propositional Independence and Inclusion Logic. | Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer |
| 2015 | MFCS | Modal Inclusion Logic: Being Lax is Simpler than Being Strict. | Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer |
| 2014 | AiML | Modal Independence Logic. | Juha Kontinen, Julian-Steffen Mller, Henning Schnoor, Heribert Vollmer |
| 2013 | MFCS | Paradigms for Parameterized Enumeration. | Nadia Creignou, Arne Meier, Julian-Steffen Mller, Johannes Schmidt, Heribert Vollmer |
| 2013 | WoLLIC | Extended Modal Dependence Logic. | Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Mller, Jonni Virtema, Heribert Vollmer |
| 2013 | WoLLIC | Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. | Julian-Steffen Mller, Heribert Vollmer |
| 2012 | ECAI | LoCo - A Logic for Configuration Problems. | Markus Aschinger, Conrad Drescher, Heribert Vollmer |
| 2012 | LATA | On the Parameterized Complexity of Default Logic and Autoepistemic Logic. | Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer |
| 2012 | SAT | Parameterized Complexity of Weighted Satisfiability Problems. | Nadia Creignou, Heribert Vollmer |
| 2011 | MFCS | Verifying Proofs in Constant Depth. | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
| 2010 | CSL | Complexity Results for Modal Dependence Logic. | Peter Lohmann, Heribert Vollmer |
| 2010 | MFCS | Counting Classes and the Fine Structure between NC | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
| 2010 | SAT | Proof Complexity of Propositional Default Logic. | Olaf Beyersdorff, Arne Meier, Sebastian Mller, Michael Thomas, Heribert Vollmer |
| 2009 | SAT | The Complexity of Reasoning for Fragments of Default Logic. | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
| 2009 | TIME | Model Checking CTL is Almost Always Inherently Sequential. | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider |
| 2008 | CSL | Extensional Uniformity for Boolean Circuits. | Pierre McKenzie, Michael Thomas, Heribert Vollmer |
| 2008 | WoLLIC | On Second-Order Monadic Groupoidal Quantifiers. | Juha Kontinen, Heribert Vollmer |
| 2007 | CiE | Computational Complexity of Constraint Satisfaction. | Heribert Vollmer |
| 2007 | FOSSACS | The Complexity of Generalized Satisfiability for Linear Temporal Logic. | Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer |
| 2005 | MFCS | The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
| 2004 | STACS | The Complexity of Boolean Constraint Isomorphism. | Elmar Bhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2004 | SAT | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. | Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2003 | DLT | Complexity Theory Made Easy. | Heribert Vollmer |
| 2002 | CSL | Equivalence and Isomorphism for Boolean Constraint Satisfaction. | Elmar Bhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer |
| 2001 | CSL | A Generalization of the Bchi-Elgot-Trakhtenbrot Theorem. | Matthias Galota, Heribert Vollmer |
| 2001 | DLT | Partially-Ordered Two-Way Automata: A New Characterization of DA. | Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2000 | ICALP | The Complexity of Base Station Positioning in Cellular Networks. | Christian Glaer, Steffen Reith, Heribert Vollmer |
| 2000 | ICALP | The Many Faces of a Translation. | Pierre McKenzie, Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2000 | MFCS | On the Autoreducibility of Random Sequences. | Todd Ebert, Heribert Vollmer |
| 2000 | MFCS | Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. | Steffen Reith, Heribert Vollmer |
| 1999 | ICALP | Finite Automata with Generalized Acceptance Criteria. | Timo Peichl, Heribert Vollmer |
| 1999 | STACS | The Descriptive Complexity Approach to LOGCFL. | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
| 1998 | STACS | Uniformly Defining Complexity Classes of Functions. | Sven Kosub, Heinz Schmitz, Heribert Vollmer |
| 1996 | ICALP | On Type-2 Probabilistic Quantifiers. | Ronald V. Book, Heribert Vollmer, Klaus W. Wagner |
| 1994 | STACS | On Different Reducibility Notions for Function Classes. | Heribert Vollmer |
| 1990 | CSL | The Gap-Language-Technique Revisited. | Heribert Vollmer |