Heribert Vollmer

207 papers A* 5A 14B 17C 12Journal 123Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Recurrent Graph Neural Networks and Arithmetic Circuits. CoRR Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer
2025	J	`jnl`	A logical characterization of constant-depth circuits over the reals. J. Log. Comput. Timon Barlag, Heribert Vollmer
2025	J	`jnl`	Enumeration Classes Defined by Circuits. ACM Trans. Comput. Theory Nadia Creignou, Arnaud Durand, Heribert Vollmer
2024	A*	`conf`	Graph Neural Networks and Arithmetic Circuits. NeurIPS Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer
2024	J	`jnl`	Graph Neural Networks and Arithmetic Circuits. CoRR Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema, Heribert Vollmer
2024	J	`jnl`	Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). Dagstuhl Reports Juha Kontinen, Jonni Virtema, Heribert Vollmer, Fan Yang, Nicolas Fröhlich
2024	J	`jnl`	Parameterized complexity of weighted team definability. Math. Struct. Comput. Sci. Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
2024	J	`jnl`	Special issue on logic and complexity. Math. Struct. Comput. Sci. Nadia Creignou, Arnaud Durand, Heribert Vollmer
2023	J	`jnl`	Parameterized Complexity of Weighted Team Definability. CoRR Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
2022	J	`jnl`	Enumerating teams in first-order team logics. Ann. Pure Appl. Log. Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2022	B	`conf`	Enumeration Classes Defined by Circuits. MFCS Nadia Creignou, Arnaud Durand, Heribert Vollmer
2022	J	`jnl`	Enumeration Classes Defined by Circuits. CoRR Nadia Creignou, Arnaud Durand, Heribert Vollmer
2021	C	`conf`	A Logical Characterization of Constant-Depth Circuits over the Reals. WoLLIC Timon Barlag, Heribert Vollmer
2021	J	`jnl`	Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2020	J	`jnl`	A Logical Characterization of Constant-Depth Circuits over the Reals. CoRR Timon Barlag, Heribert Vollmer
2020	J	`jnl`	Enumerating Teams in First-Order Team Logics. CoRR Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2020	J	`jnl`	Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2019	J	`jnl`	A complexity theory for hard enumeration problems. Discret. Appl. Math. Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2019	J	`jnl`	A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Log. Anselm Haak, Heribert Vollmer
2019	B	`conf`	Counting of Teams in First-Order Team Logics. MFCS Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
2019	J	`jnl`	Counting of Teams in First-Order Team Logics. CoRR Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang
2019	J	`jnl`	Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. Heribert Vollmer, Brigitte Vallée
2019	J	`jnl`	Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer
2019	J	`jnl`	Parameterised Enumeration for Modification Problems. Algorithms Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2018	J	`jnl`	Complexity of Propositional Logics in Team Semantic. ACM Trans. Comput. Log. Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
2018	A*	`conf`	Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS Arnaud Durand, Anselm Haak, Heribert Vollmer
2018	J	`jnl`	Preface of STACS 2016 Special Issue. Theory Comput. Syst. Christoph Dürr, Heribert Vollmer
2017	A	`ed.`	34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, March 8-11, 2017 STACS Heribert Vollmer, Brigitte Vallée
2017	J	`jnl`	Modal independence logic. J. Log. Comput. Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
2017	J	`jnl`	Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR Arnaud Durand, Anselm Haak, Heribert Vollmer
2017	C	`conf`	On the Complexity of Hard Enumeration Problems. LATA Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2017	J	`jnl`	Paradigms for Parameterized Enumeration. Theory Comput. Syst. Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2016	A	`ed.`	33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orléans, France, February 17-20, 2016 STACS Nicolas Ollinger, Heribert Vollmer
2016	C	`conf`	A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC Anselm Haak, Heribert Vollmer
2016	J	`jnl`	A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR Anselm Haak, Heribert Vollmer
2016	—	`book`	Dependence Logic, Theory and Applications Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
2016	B	`conf`	Descriptive Complexity of #AC CSL Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2016	J	`jnl`	Descriptive Complexity of #AC CoRR Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2016	—	`ch.`	Expressivity and Complexity of Dependence Logic. Dependence Logic Arnaud Durand, Juha Kontinen, Heribert Vollmer
2016	—	`ch.`	Introduction. Dependence Logic Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
2016	J	`jnl`	On the Complexity of Hard Enumeration Problems. CoRR Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer
2016	J	`jnl`	SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer
2015	B	`conf`	A Van Benthem Theorem for Modal Team Semantics. CSL Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
2015	J	`jnl`	Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer
2015	—	`conf`	Complexity of Propositional Independence and Inclusion Logic. MFCS (1) Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
2015	J	`jnl`	Complexity of Propositional Independence and Inclusion Logic. CoRR Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer
2015	J	`jnl`	Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2015	J	`jnl`	Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL Int. J. Found. Comput. Sci. Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2015	—	`book`	Komplexität von Algorithmen. Arne Meier, Heribert Vollmer
2015	J	`jnl`	Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports Erich Grädel, Juha Kontinen, Jouko Väänänen, Heribert Vollmer
2015	—	`conf`	Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2015	J	`jnl`	On the parameterized complexity of non-monotonic logics. Arch. Math. Log. Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2015	J	`jnl`	Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae Nadia Creignou, Heribert Vollmer
2015	C	`conf`	Parameterized Enumeration for Modification Problems. LATA Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2015	J	`jnl`	Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2014	J	`jnl`	A Fragment of Dependence Logic Capturing Polynomial Time Log. Methods Comput. Sci. Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer
2014	J	`jnl`	A Van Benthem Theorem for Modal Team Semantics. CoRR Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
2014	J	`jnl`	LoCo - A Logic for Configuration Problems. ACM Trans. Comput. Log. Markus Aschinger, Conrad Drescher, Georg Gottlob, Heribert Vollmer
2014	B	`conf`	Modal Independence Logic. Advances in Modal Logic Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
2014	J	`jnl`	Modal Independence Logic. CoRR Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer
2013	J	`jnl`	Complexity Results for Modal Dependence Logic. Stud Logica Peter Lohmann, Heribert Vollmer
2013	J	`jnl`	Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer
2013	C	`conf`	Extended Modal Dependence Logic. WoLLIC Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
2013	J	`jnl`	Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice CoRR Julian-Steffen Müller, Heribert Vollmer
2013	C	`conf`	Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. WoLLIC Julian-Steffen Müller, Heribert Vollmer
2013	B	`conf`	Paradigms for Parameterized Enumeration. MFCS Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013	J	`jnl`	Paradigms for Parameterized Enumeration. CoRR Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013	J	`jnl`	Parameterized Enumeration with Ordering. CoRR Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2013	J	`jnl`	Verifying proofs in constant depth. ACM Trans. Comput. Theory Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2012	J	`jnl`	Complexity of Model Checking for Logics over Kripke models. Bull. EATCS Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
2012	J	`jnl`	Counting classes and the fine structure between NC Theor. Comput. Sci. Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2012	A	`conf`	LoCo - A Logic for Configuration Problems. ECAI Markus Aschinger, Conrad Drescher, Heribert Vollmer
2012	C	`conf`	On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2012	A	`conf`	Parameterized Complexity of Weighted Satisfiability Problems. SAT Nadia Creignou, Heribert Vollmer
2012	J	`jnl`	SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer
2012	J	`jnl`	The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
2012	J	`jnl`	The complexity of reasoning for fragments of default logic. J. Log. Comput. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2012	J	`jnl`	Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2011	—	`book`	Algorithms Unplugged Algorithms Unplugged Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2011	J	`jnl`	Complexity Results for Modal Dependence Logic CoRR Peter Lohmann, Heribert Vollmer
2011	J	`jnl`	Dependence logic with a majority quantifier CoRR Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2011	—	`conf`	Dependence logic with a majority quantifier. FSTTCS Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2011	J	`jnl`	Model Checking CTL is Almost Always Inherently Sequential Log. Methods Comput. Sci. Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
2011	J	`jnl`	On the Parameterized Complexity of Default Logic and Autoepistemic Logic CoRR Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2011	J	`jnl`	Proof complexity of propositional default logic. Arch. Math. Log. Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2011	J	`jnl`	The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2011	B	`conf`	Verifying Proofs in Constant Depth. MFCS Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2010	—	`conf`	10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	—	`conf`	10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	J	`jnl`	Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Log. Methods Comput. Sci. Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010	—	`ed.`	Circuits, Logic, and Games, 07.02. - 12.02.2010 Circuits, Logic, and Games Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010	B	`conf`	Complexity Results for Modal Dependence Logic. CSL Peter Lohmann, Heribert Vollmer
2010	—	`conf`	Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games Peter Lohmann, Heribert Vollmer
2010	J	`jnl`	Complexity of Non-Monotonic Logics CoRR Michael Thomas, Heribert Vollmer
2010	J	`jnl`	Complexity of non-monotonic logics. Bull. EATCS Michael Thomas, Heribert Vollmer
2010	B	`conf`	Counting Classes and the Fine Structure between NC MFCS Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2010	J	`jnl`	Counting Classes and the Fine Structure between NC Electron. Colloquium Comput. Complex. Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2010	J	`jnl`	Extensional Uniformity for Boolean Circuits. SIAM J. Comput. Pierre McKenzie, Michael Thomas, Heribert Vollmer
2010	J	`jnl`	On Second-Order Monadic Monoidal and Groupoidal Quantifiers Log. Methods Comput. Sci. Juha Kontinen, Heribert Vollmer
2010	—	`conf`	Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010	A	`conf`	Proof Complexity of Propositional Default Logic. SAT Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010	J	`jnl`	The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010	J	`jnl`	The Complexity of Reasoning for Fragments of Autoepistemic Logic CoRR Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010	—	`conf`	The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2009	C	`conf`	Model Checking CTL is Almost Always Inherently Sequential. TIME Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
2009	J	`jnl`	The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory Comput. Syst. Heribert Vollmer
2009	J	`jnl`	The Complexity of Generalized Satisfiability for Linear Temporal Logic Log. Methods Comput. Sci. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2009	A	`conf`	The Complexity of Reasoning for Fragments of Default Logic. SAT Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2009	J	`jnl`	The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2009	J	`jnl`	The complexity of propositional implication. Inf. Process. Lett. Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2009	J	`jnl`	The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2008	—	`conf`	Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints Nadia Creignou, Heribert Vollmer
2008	—	`ed.`	Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Complexity of Constraints Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2008	J	`jnl`	Extensional Uniformity for Boolean Circuits CoRR Pierre McKenzie, Michael Thomas, Heribert Vollmer
2008	B	`conf`	Extensional Uniformity for Boolean Circuits. CSL Pierre McKenzie, Michael Thomas, Heribert Vollmer
2008	C	`conf`	On Second-Order Monadic Groupoidal Quantifiers. WoLLIC Juha Kontinen, Heribert Vollmer
2008	—	`book`	Taschenbuch der Algorithmen Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2008	J	`jnl`	The Complexity of Propositional Implication CoRR Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008	J	`jnl`	The Complexity of Reasoning for Fragments of Default Logic CoRR Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008	—	`conf`	The Complexity of Satisfiability for Fragments of CTL and CTL RP Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments CoRR Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2008	J	`jnl`	The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments. Electron. Colloquium Comput. Complex. Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007	—	`ed.`	Circuits, Logic, and Games, 08.11. - 10.11.2006 Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2007	C	`conf`	Computational Complexity of Constraint Satisfaction. CiE Heribert Vollmer
2007	B	`conf`	The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007	J	`jnl`	The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
2007	—	`conf`	The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. M4M Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2007	J	`jnl`	The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Electron. Colloquium Comput. Complex. Heribert Vollmer
2006	—	`conf`	06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2006	—	`conf`	06401 Executive Summary - Complexity of Constraints. Complexity of Constraints Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2006	—	`conf`	06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006	—	`conf`	06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006	—	`ed.`	Complexity of Constraints, 01.10. - 06.10.2006 Complexity of Constraints Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
2006	J	`jnl`	Exploiting practical limitations of UML diagrams for model validation and execution. Softw. Syst. Model. Friedrich Steimann, Heribert Vollmer
2006	J	`jnl`	The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer
2006	J	`jnl`	The many faces of a translation. J. Comput. Syst. Sci. Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2005	J	`jnl`	Bases for Boolean co-clones. Inf. Process. Lett. Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005	J	`jnl`	Functions computable in polynomial space. Inf. Comput. Matthias Galota, Heribert Vollmer
2005	J	`jnl`	Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electron. Colloquium Comput. Complex. Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005	B	`conf`	The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2005	J	`jnl`	The complexity of base station positioning in cellular networks. Discret. Appl. Math. Christian Glaßer, Steffen Reith, Heribert Vollmer
2004	A	`conf`	An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004	—	`conf`	An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004	J	`jnl`	Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
2004	A	`conf`	The Complexity of Boolean Constraint Isomorphism. STACS Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2004	J	`jnl`	The Complexity of Satisfiability Problems: Refining Schaefer's Theorem Electron. Colloquium Comput. Complex. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
2003	C	`conf`	Complexity Theory Made Easy. Developments in Language Theory Heribert Vollmer
2003	J	`jnl`	Functions Computable in Polynomial Space Electron. Colloquium Comput. Complex. Matthias Galota, Heribert Vollmer
2003	J	`jnl`	Generic separations and leaf languages. Math. Log. Q. Matthias Galota, Sven Kosub, Heribert Vollmer
2003	J	`jnl`	On the Autoreducibility of Random Sequences. SIAM J. Comput. Todd Ebert, Wolfgang Merkle, Heribert Vollmer
2003	J	`jnl`	Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. Steffen Reith, Heribert Vollmer
2003	J	`jnl`	The Complexity of Boolean Constraint Isomorphism CoRR Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	J	`jnl`	Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	B	`conf`	Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002	J	`jnl`	On the Autoreducibility of Random Sequences Electron. Colloquium Comput. Complex. Todd Ebert, Wolfgang Merkle, Heribert Vollmer
2001	B	`conf`	A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL Matthias Galota, Heribert Vollmer
2001	—	`conf`	A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer
2001	J	`jnl`	Finite Automata with Generalized Acceptance Criteria. Discret. Math. Theor. Comput. Sci. Timo Peichl, Heribert Vollmer
2001	C	`conf`	Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory Thomas Schwentick, Denis Thérien, Heribert Vollmer
2001	J	`jnl`	The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
2000	J	`jnl`	A note on closure properties of logspace MOD classes. Inf. Process. Lett. Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
2000	—	`conf`	Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
2000	J	`jnl`	Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chic. J. Theor. Comput. Sci. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
2000	B	`conf`	On the Autoreducibility of Random Sequences. MFCS Todd Ebert, Heribert Vollmer
2000	B	`conf`	Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS Steffen Reith, Heribert Vollmer
2000	—	`conf`	The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops Christian Glaßer, Steffen Reith, Heribert Vollmer
2000	A*	`conf`	The Many Faces of a Translation. ICALP Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2000	J	`jnl`	Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. Sven Kosub, Heinz Schmitz, Heribert Vollmer
1999	J	`jnl`	Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
1999	A*	`conf`	Finite Automata with Generalized Acceptance Criteria. ICALP Timo Peichl, Heribert Vollmer
1999	—	`book`	Introduction to Circuit Complexity - A Uniform Approach. Heribert Vollmer
1999	A	`conf`	The Descriptive Complexity Approach to LOGCFL. STACS Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1999	J	`jnl`	Uniform characterizations of complexity classes. SIGACT News Heribert Vollmer
1999	J	`jnl`	Was leistet die Komplexitätstheorie für die Praxis? Inform. Spektrum Heribert Vollmer
1998	J	`jnl`	A Generalized Quantifier Concept in Computational Complexity Theory CoRR Heribert Vollmer
1998	J	`jnl`	Characterizing Small Depth and Small Space Classes by Operators of Higher Types Electron. Colloquium Comput. Complex. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
1998	J	`jnl`	Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. Hans-Jörg Burtschick, Heribert Vollmer
1998	J	`jnl`	Nondeterministic J. Comput. Syst. Sci. Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
1998	J	`jnl`	Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
1998	J	`jnl`	Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. Heribert Vollmer
1998	J	`jnl`	The Chain Method to Separate Counting Classes. Theory Comput. Syst. K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1998	J	`jnl`	The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae CoRR Steffen Reith, Heribert Vollmer
1998	J	`jnl`	The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae Electron. Colloquium Comput. Complex. Steffen Reith, Heribert Vollmer
1998	J	`jnl`	The Descriptive Complexity Approach to LOGCFL Electron. Colloquium Comput. Complex. Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998	J	`jnl`	The descriptive complexity approach to LOGCFL CoRR Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998	A	`conf`	Uniformly Defining Complexity Classes of Functions. STACS Sven Kosub, Heinz Schmitz, Heribert Vollmer
1997	—	`conf`	A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI Heribert Vollmer
1997	J	`jnl`	Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. Kenneth W. Regan, Heribert Vollmer
1997	—	`conf`	Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity Heribert Vollmer, Klaus W. Wagner
1997	A	`conf`	On Operators of Higher Types. CCC Heribert Vollmer, Klaus W. Wagner
1996	A	`conf`	Complements of Multivalued Functions. CCC Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
1996	J	`jnl`	Lindstroem Quantifiers and Leaf Language Definability Electron. Colloquium Comput. Complex. Hans-Jörg Burtschick, Heribert Vollmer
1996	A	`conf`	Nondeterministic NC CCC Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer
1996	J	`jnl`	On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1996	A*	`conf`	On Type-2 Probabilistic Quantifiers. ICALP Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
1996	J	`jnl`	Probabilistic Type-2 Operators and "Almost"-Classes Electron. Colloquium Comput. Complex. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
1996	J	`jnl`	Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. Heribert Vollmer, Klaus W. Wagner
1996	—	`conf`	Relations Among Parallel and Sequential Computation Models. ASIAN Heribert Vollmer
1995	J	`jnl`	Complexity Classes of Optimization Functions Inf. Comput. Heribert Vollmer, Klaus W. Wagner
1995	—	`conf`	On the Power of Number-Theoretic Operations with Respect to Counting. SCT Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
1995	J	`jnl`	The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News Lane A. Hemaspaandra, Heribert Vollmer
1994	—	`—`	Komplexitätsklassen von Funktionen. Heribert Vollmer
1994	A	`conf`	On Different Reducibility Notions for Function Classes. STACS Heribert Vollmer
1993	—	`conf`	On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1993	J	`jnl`	The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. Heribert Vollmer, Klaus W. Wagner
1992	J	`jnl`	On the Power of Polynomial Bit-Reductions Universität Trier, Mathematik/Informatik, Forschungsbericht Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1990	B	`conf`	The Gap-Language-Technique Revisited. CSL Heribert Vollmer