Veröffentlichungen

Es wird die dblp-Klassifikation verwendet.

Konferenz- und Workshop-Veröffentlichungen
Journal-Veröffentlichungen
Bücher
Buchteile
Vordrucke und Technische Berichte

Typ: Journal-Veröffentlichungen (104), Konferenz- und Workshop-Veröffentlichungen (134), Vordrucke und Technische Berichte (142), Bücher (12), Buchteile (3), Dissertationen (5)

Jahr: 1990–1996 (17) , 1997–2002 (39) , 2003–2008 (77) , 2009–2014 (129) , 2015–2020 (114) , 2021–2023 (30)

2023

[BIB] Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. Algorithmica 85(10): 2923-2961 (2023).
[BIB] Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with Probabilistic Team Semantics and the Boolean Negation. JELIA 2023: 665-680.
[BIB] Yasir Mahmood, Jonni Virtema:
Parameterized Complexity of Propositional Inclusion and Independence Logic. WoLLIC 2023: 274-291.
[BIB] Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema:
Unified Foundations of Team Semantics via Semirings. KR 2023: 75-85.
[BIB] Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI 2023: 3212-3220.
[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24(3): 26:1-26:25 (2023).
[BIB] Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with probabilistic team semantics and the Boolean negation. CoRR abs/2306.00420 (2023).
[BIB] Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema:
Unified Foundations of Team Semantics via Semirings. CoRR abs/2303.07926 (2023).
[BIB] Timon Barlag, Florian Chudigiewitsch, Sabrina Alexandra Gaube:
Logical Characterization of Algebraic Circuit Classes over Integral Domains. CoRR abs/2302.13764 (2023).
[BIB] Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer:
Parameterized Complexity of Weighted Team Definability. CoRR abs/2302.00541 (2023).

2022

[BIB] Juha Kontinen, Arne Meier, Yasir Mahmood:
A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 32(8): 1624-1644 (2022).
[BIB] Nicolas Fröhlich, Arne Meier:
Submodel Enumeration of Kripke Structures in Modal Logic. AiML 2022: 391-406.
[BIB] Yasir Mahmood, Arne Meier:
Parameterised complexity of model checking and satisfiability in propositional dependence logic. Ann. Math. Artif. Intell. 90(2-3): 271-296 (2022).
[BIB] Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173(10): 103163 (2022).
[BIB] Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. MFCS 2022: 38:1-38:14.
[BIB] Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. LICS 2022: 44:1-44:13.
[BIB] Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. CoRR abs/2205.00539 (2022).
[BIB] Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. LFCS 2022: 125-142.

2021

[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI 2021: 6426-6434.
[BIB] Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI 2021: 6349-6357.
[BIB] Timon Barlag, Heribert Vollmer:
A Logical Characterization of Constant-Depth Circuits over the Reals. WoLLIC 2021: 16-30.
[BIB] Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. CoRR abs/2110.12699 (2021).
[BIB] Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. CoRR abs/2109.09342 (2021).
[BIB] Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CSL 2021: 27:1-27:22.
[BIB] Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI 2021: 1880-1886.
[BIB] Yasir Mahmood, Jonni Virtema:
Parameterised Complexity of Propositional Logic in Team Semantics. CoRR abs/2105.14887 (2021).
[BIB] Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. STACS 2021: 40:1-40:17.
[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR abs/2102.11782 (2021).
[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31(1): 266-296 (2021).
[BIB] Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. 116: 40-54 (2021).

2020

[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21(1): 7:1-7:18 (2020).
[BIB] Martin Lück:
On the complexity of linear temporal logic with team semantics. Theor. Comput. Sci. 837: 1-25 (2020).
[BIB] Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CoRR abs/2007.03867 (2020).
[BIB] Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer:
Enumerating Teams in First-Order Team Logics. CoRR abs/2006.06953 (2020).
[BIB] Arne Meier:
Incremental FPT Delay. Algorithms 13(5): 122 (2020).
[BIB] Timon Barlag, Heribert Vollmer:
A Logical Characterization of Constant-Depth Circuits over the Reals. CoRR abs/2005.04916 (2020).
[BIB] Martin Lück:
On the Complexity of Linear Temporal Logic with Team Semantics. CoRR abs/2004.12682 (2020).
[BIB] Yasir Mahmood, Arne Meier:
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. FoIKS 2020: 157-174.
[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS 2020: 195-213.
[BIB] Martin Lück:
Team Logic: Axioms, Expressiveness, Complexity. 2020. Leibniz Universität Hannover, Dissertation.
[BIB] Arne Meier:
Parametrised Enumeration. 2020. Leibniz Universität Hannover, Habilitationsschrift.

2019

[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
A complexity theory for hard enumeration problems. Discret. Appl. Math. 268: 191-209 (2019).
[BIB] Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Backdoors for Linear Temporal Logic. Algorithmica 81(2): 476-496 (2019).
[BIB] Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. AAAI 2019: 2827-2834.
[BIB] Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. CoRR abs/1902.00246 (2019).
[BIB] Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports 9(1): 28-46 (2019).
[BIB] Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. Acta Informatica 56(6): 487-519 (2019).
[BIB] Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. Log. Methods Comput. Sci. 15(2) (2019).
[BIB] Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. Log. Methods Comput. Sci. 15(3) (2019).
[BIB] Anselm Haak, Heribert Vollmer:
A model-theoretic characterization of constant-depth arithmetic circuits. Ann. Pure Appl. Log. 170(9): 1008-1029 (2019).
[BIB] Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterised Enumeration for Modification Problems. Algorithms 12(9): 189 (2019).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5): 605-630 (2019).
[BIB] Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang:
Counting of Teams in First-Order Team Logics. MFCS 2019: 19:1-19:15.
[BIB] Heribert Vollmer, Brigitte Vallée:
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 63(5): 923-925 (2019).
[BIB] Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting Classes with Bounded Nondeterminism. CoRR abs/1904.12156 (2019).
[BIB] Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity for Abduction. CoRR abs/1906.00703 (2019).
[BIB] Yasir Mahmood, Arne Meier:
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. CoRR abs/1904.06107 (2019).
[BIB] Martin Lück, Miikka Vilander:
On the Succinctness of Atoms of Dependency. CoRR abs/1903.02344 (2019).

2018

[BIB] Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. MFCS 2018: 10:1-10:16.
[BIB] Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic Team Semantics. FoIKS 2018: 186-206.
[BIB] Martin Lück:
Axiomatizations of team logics. Ann. Pure Appl. Log. 169(9): 928-969 (2018).
[BIB] Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363.
[BIB] Christoph Dürr, Heribert Vollmer:
Preface of STACS 2016 Special Issue. Theory Comput. Syst. 62(1): 1-3 (2018).
[BIB] Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4): 297-320 (2018).
[BIB] Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Logics in Team Semantic. ACM Trans. Comput. Log. 19(1): 2:1-2:14 (2018).
[BIB] Martin Lück:
Canonical Models and the Complexity of Modal Team Logic. CSL 2018: 30:1-30:23.
[BIB] Martin Lück:
On the Complexity of Team Logic and Its Two-Variable Fragment. MFCS 2018: 27:1-27:22.
[BIB] Johannes Klaus Fichte, Markus Hecher, Arne Meier:
Counting Complexity for Reasoning in Abstract Argumentation. CoRR abs/1811.11501 (2018).
[BIB] Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. FoIKS 2018: 303-321.
[BIB] Maurice Chandoo:
Canonical Representations for Circular-Arc Graphs Using Flip Sets. Algorithmica 80(12): 3646-3672 (2018).
[BIB] Maurice Chandoo:
A Systematic Approach to Programming. CoRR abs/1808.08989 (2018).
[BIB] Maurice Chandoo:
A Complexity Theory for Labeling Schemes. CoRR abs/1802.02819 (2018).
[BIB] Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic team semantics. CoRR abs/1803.02180 (2018).
[BIB] Martin Lück:
On the Complexity of Team Logic and its Two-Variable Fragment. CoRR abs/1804.04968 (2018).
[BIB] Arne Meier:
Enumeration in Incremental FPT-Time. CoRR abs/1804.07799 (2018).
[BIB] Maurice Chandoo:
Fundamentals of Parameterized Complexity Revisited. CoRR abs/1804.11089 (2018).
[BIB] Martin Lück:
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. Int. J. Found. Comput. Sci. 29(1): 17-62 (2018).
[BIB] Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. LATA 2018: 130-142.

2017

[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS 2017: 32:1-32:14.
[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195.
[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal independence logic. J. Log. Comput. 27(5): 1333-1352 (2017).
[BIB] Martin Lück, Arne Meier, Irena Schindler:
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18(1): 1:1-1:32 (2017).
[BIB] Martin Lück:
The Power of the Filtration Technique for Modal Logics with Team Semantics. CSL 2017: 31:1-31:20.
[BIB] Arne Meier, Christian Reinbold:
Enumeration Complexity of Poor Man's Propositional Dependence Logic. CoRR abs/1704.03292 (2017).
[BIB] Maurice Chandoo:
Canonical Representations for Circular-Arc Graphs Using Flip Sets. CoRR abs/1702.05763 (2017).
[BIB] Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. CoRR abs/1706.09393 (2017).
[BIB] Martin Lück:
On the Complexity of Modal Team Logic and Two-Variable Team Logic. CoRR abs/1709.05253 (2017).
[BIB] Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR abs/1710.01934 (2017).
[BIB] Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. CoRR abs/1709.08510 (2017).
[BIB] Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. Theory Comput. Syst. 61(2): 263-282 (2017).
[BIB] Maurice Chandoo:
Computational Complexity Aspects of Implicit Graph Representations. 2017. Dissertation.

2016

[BIB] Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17.
[BIB] Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC⁰ Functions. CoRR abs/1604.06617 (2016).
[BIB] Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Strong Backdoors for Linear Temporal Logic. CoRR abs/1602.04934 (2016).
[BIB] Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. FoIKS 2016: 271-291.
[BIB] Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On Quantified Propositional Logics and the Exponential Time Hierarchy. GandALF 2016: 198-212.
[BIB] Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC⁰ Functions. CSL 2016: 20:1-20:16.
[BIB] Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. WoLLIC 2016: 234-248.
[BIB] Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. SAT 2016: 45-59.
[BIB] (Ed.) Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Dependence Logic, Theory and Applications. Springer 2016. ISBN 978-3-319-31803-5.
[BIB] Arnaud Durand, Juha Kontinen, Heribert Vollmer:
Expressivity and Complexity of Dependence Logic. Dependence Logic 2016: 5-32.
[BIB] Martin Lück:
Axiomatizations for Propositional and Modal Team Logic. CSL 2016: 33:1-33:18.
[BIB] Maurice Chandoo:
On the Implicit Graph Conjecture. MFCS 2016: 23:1-23:13.
[BIB] Maurice Chandoo:
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. STACS 2016: 26:1-26:13.
[BIB] Martin Lück:
Complete Problems of Propositional Logic for the Exponential Hierarchy. CoRR abs/1602.03050 (2016).
[BIB] Anselm Haak, Heribert Vollmer:
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits. CoRR abs/1603.09531 (2016).
[BIB] Martin Lück:
Axiomatizations of Team Logics. CoRR abs/1602.05040 (2016).
[BIB] Maurice Chandoo:
On the Implicit Graph Conjecture. CoRR abs/1603.01977 (2016).
[BIB] Johannes Klaus Fichte, Arne Meier, Irina Schindler:
Strong Backdoors for Default Logic. CoRR abs/1602.06052 (2016).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR abs/1609.06951 (2016).
[BIB] Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. CoRR abs/1610.05493 (2016).
[BIB] Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer:
SAT and Interactions (Dagstuhl Seminar 16381). Dagstuhl Reports 6(9): 74-93 (2016).
[BIB] Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Introduction. Dependence Logic 2016: 1-3.
[BIB] Konrad W. Schwerdtfeger:
Connectivity of Boolean satisfiability. University of Hanover, Hannover, Germany 2016.

2015

[BIB] Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. TIME 2015: 59-68.
[BIB] Andreas Krebs, Arne Meier, Martin Mundhenk:
The Model Checking Fingerprints of CTL Operators. TIME 2015: 101-110.
[BIB] Andreas Krebs, Arne Meier, Jonni Virtema:
A Team Based Variant of CTL. TIME 2015: 140-149.
[BIB] Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. CoRR abs/1510.09040 (2015).
[BIB] Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. CoRR abs/1504.06135 (2015).
[BIB] Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting. Fundam. Informaticae 136(4): 297-316 (2015).
[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. 24(3): 289-305 (2015).
[BIB] Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer:
Complexity of Propositional Independence and Inclusion Logic. MFCS (1) 2015: 269-280.
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CSL 2015: 277-291.
[BIB] Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015).
[BIB] Erich Grädel, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6): 70-85 (2015).
[BIB] Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA 2015: 549-560.
[BIB] Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration for Modification Problems. LATA 2015: 524-536.
[BIB] Martin Lück:
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. CoRR abs/1510.08786 (2015).
[BIB] Martin Lück, Arne Meier:
LTL Fragments are Hard for Standard Parameterisations. CoRR abs/1504.06187 (2015).
[BIB] Maurice Chandoo:
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace. CoRR abs/1507.03348 (2015).
[BIB] Andreas Krebs, Arne Meier, Martin Mundhenk:
The model checking fingerprints of CTL operators. CoRR abs/1504.04708 (2015).
[BIB] Andreas Krebs, Arne Meier, Jonni Virtema:
Parallel Computational Tree Logic. CoRR abs/1505.01964 (2015).
[BIB] Konrad W. Schwerdtfeger:
Connectivity of Boolean Satisfiability. CoRR abs/1510.06700 (2015).
[BIB] Katsuhiko Sano, Jonni Virtema:
Axiomatizing Propositional Dependence Logics. CSL 2015: 292-307.
[BIB] Katsuhiko Sano, Jonni Virtema:
Characterizing Frame Definability in Team Semantics via the Universal Modality. WoLLIC 2015: 140-155.
[BIB] Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic. Distributed Computing 28(1): 31-53 (2015).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR abs/1504.06409 (2015).
[BIB] Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015).
[BIB] Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer:
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) 2015: 281-292. Aktualisierte Version im arXiv.
[BIB] Arne Meier, Heribert Vollmer:
Komplexität von Algorithmen. Mathematik für Anwendungen 4. Lehmanns Media 2015. ISBN 978-3-86541-761-9.
[BIB] Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆. Int. J. Found. Comput. Sci. 26(8): 1189- (2015). Erratum zu Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk: The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009).

2014

[BIB] Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electron. Colloquium Comput. Complex. TR14 (2014).
[BIB] Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller, Heribert Vollmer:
A Fragment of Dependence Logic Capturing Polynomial Time. Log. Methods Comput. Sci. 10(3) (2014).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. Advances in Modal Logic 2014: 353-372.
[BIB] Markus Aschinger, Conrad Drescher, Georg Gottlob, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. ACM Trans. Comput. Log. 15(3): 20:1-20:25 (2014).
[BIB] Martin Lück, Arne Meier, Irina Schindler:
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. CoRR abs/1410.4044 (2014).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
Modal Independence Logic. CoRR abs/1404.0144 (2014).
[BIB] Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
A Van Benthem Theorem for Modal Team Semantics. CoRR abs/1410.6648 (2014).
[BIB] Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema:
Boolean Dependence Logic and Partially-Ordered Connectives. CoRR abs/1406.7132 (2014).
[BIB] Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. CSR 2014: 351-364.
[BIB] Julian-Steffen Müller:
Satisfiability and model checking in team based logics. Cuvillier University of Hanover 2014. ISBN 978-3-95404-759-8.
[BIB] Konrad W. Schwerdtfeger:
A Computational Trichotomy for Connectivity of Boolean Satisfiability. JSAT 8(3/4): 173-195 (2014).
[BIB] Arne Meier:
Generalized Complexity of ALC Subsumption. Recent Progress in the Boolean Domain 2014.

2013

[BIB] Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5(1): 2:1-2:23 (2013).
[BIB] Arne Meier, Thomas Schneider:
Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505: 55-73 (2013).
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Stud Logica 101(2): 343-366 (2013).
[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301.
[BIB] Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer:
Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071). Dagstuhl Reports 3(2): 45-54 (2013).
[BIB] Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer:
Extended Modal Dependence Logic. WoLLIC 2013: 126-137.
[BIB] Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice. CoRR abs/1303.6424 (2013).
[BIB] Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013).
[BIB] Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration with Ordering. CoRR abs/1309.5009 (2013).
[BIB] Konrad W. Schwerdtfeger:
A Computational Trichotomy for Connectivity of Boolean Satisfiability. CoRR abs/1312.4524 (2013).
[BIB] Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. CoRR abs/1312.6679 (2013).
[BIB] Nikhil Balaji, Samir Datta:
Collapsing Exact Arithmetic Hierarchies. Electronic Colloquium on Computational Complexity (ECCC) 20: 131 (2013).
[BIB] Eric Allender, Nikhil Balaji, Samir Datta:
Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. Electronic Colloquium on Computational Complexity (ECCC) 20: 177 (2013).
[BIB] Nikhil Balaji, Samir Datta:
Tree-width and Logspace: Determinants and Counting Euler Tours. CoRR abs/1312.7468 (2013).
[BIB] Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53(4): 669-689 (2013).
[BIB] Julian-Steffen Müller, Heribert Vollmer:
Model Checking for Modal Dependence Logic: An Approach through Post's Lattice. WoLLIC 2013: 238-250.
[BIB] Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema:
Boolean Dependence Logic and Partially-Ordered Connectives. WoLLIC 2013: 111-125.
[BIB] Samir Datta, Raghav Kulkarni:
Space complexity: what makes planar graphs special? Bulletin of the EATCS 109: 35-53 (2013).

2012

[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC¹ and L. Theor. Comput. Sci. 417: 36-49 (2012).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3): 587-604 (2012).
[BIB] Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. TR12 (2012).
[BIB] Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108: 49-89 (2012).
[BIB] Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic 2012: 261-278.
[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400.
[BIB] Nadia Creignou, Heribert Vollmer:
Parameterized Complexity of Weighted Satisfiability Problems. SAT 2012: 341-354.
[BIB] Markus Aschinger, Conrad Drescher, Heribert Vollmer:
LoCo - A Logic for Configuration Problems. ECAI 2012: 73-78.
[BIB] Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012).
[BIB] Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss:
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. CoRR abs/1204.1196 (2012).
[BIB] Arne Meier:
Generalized Complexity of ALC Subsumption. CoRR abs/1205.0722 (2012). Masterarbeit
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Characterization of Tree-Like Resolution Size. Electronic Colloquium on Computational Complexity (ECCC) 19: 161 (2012).
[BIB] Christian Schuster, Iftikhar Ali, Peter Lohmann, Annett Frick, Michael Förster, Birgit Kleinschmit:
Correction on "Towards Detecting Swath Events in TerraSAR-X Time Series to Establish NATURA 2000 Grassland Habitat Swath Management as Monitoring Parameter". Remote Sensing 4(8): 2455-2456 (2012).
[BIB] Peter Lohmann:
Computational Aspects of Dependence Logic. CoRR abs/1206.4564 (2012).
[BIB] Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012).
[BIB] Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. SOFSEM 2012: 226-237.
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is not Optimal. TOCT 4(3): 7:1-7:16 (2012).
[BIB] Olaf Beyersdorff:
Non-classical Aspects in Proof Complexity. Cuvillier 2012. ISBN 978-3-9540403-6-0.

2011

[BIB] Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95.
[BIB] Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer:
Model Checking CTL is Almost Always Inherently Sequential. Log. Methods Comput. Sci. 7(2) (2011).
[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. CoRR abs/1109.4750 (2011).
[BIB] Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. FSTTCS 2011: 252-263.
[BIB] Michael 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. ACM Trans. Comput. Log. 12(2): 13:1-13:28 (2011).
[BIB] Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011).
[BIB] Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC. CoRR abs/1103.0853 (2011).
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CoRR abs/1104.0607 (2011).
[BIB] Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011).
[BIB] Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of Two-Variable Dependence Logic and IF-Logic. LICS 2011: 289-298.
[BIB] (Ed.) Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011. ISBN 978-3-642-15327-3.
[BIB] Christian Schuster, Iftikhar Ali, Peter Lohmann, Annett Frick, Michael Förster, Birgit Kleinschmit:
Towards Detecting Swath Events in TerraSAR-X Time Series to Establish NATURA 2000 Grassland Habitat Swath Management as Monitoring Parameter. Remote Sensing 3(7): 1308-1322 (2011).
[BIB] Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. CoRR abs/1104.1034 (2011).
[BIB] Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable Dependence Logic and IF-Logic. CoRR abs/1104.3148 (2011).
[BIB] Olaf Beyersdorff, Oliver Kutz:
Proof Complexity of Non-classical Logics. ESSLLI 2011: 1-54.
[BIB] Michael Köster, Peter Lohmann:
Abstraction for Model Checking Modular Interpreted Systems over ATL. ProMAS 2011: 95-113.
[BIB] Johannes Ebbing, Peter Lohmann, Fan Yang:
Model Checking for Modal Intuitionistic Dependence Logic. TbiLLC 2011: 231-256.
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18.
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641.
[BIB] Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Complexity of logic-based argumentation in Post's framework. Argument & Computation 2(2-3): 107-129 (2011).
[BIB] Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Proof systems that take advice. Inf. Comput. 209(3): 320-332 (2011).
[BIB] Olaf Beyersdorff, Zenon Sadowski:
Do there exist complete sets for promise classes? Math. Log. Q. 57(6): 535-550 (2011).
[BIB] Arne Meier:
On the Complexity of Modal Logic Variants and their Fragments. Cuvillier 2011. ISBN 978-3-86955-929-2. Ein Corrigendum existiert.
[BIB] Michael Köster, Peter Lohmann:
Abstraction for model checking modular interpreted systems over ATL. AAMAS 2011: 1129-1130.
[BIB] Arne Meier, Thomas Schneider:
Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). TAMC 2011: 552-562.

2010

[BIB] Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Description Logics 2010.
[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC¹ and L. MFCS 2010: 306-317.
[BIB] Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC¹ and L. Electron. Colloquium Comput. Complex. TR10 (2010).
[BIB] Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8(4): 409-421 (2010).
[BIB] Michael Thomas, Heribert Vollmer:
Complexity of non-monotonic logics. Bull. EATCS 102: 53-82 (2010).
[BIB] Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems. Log. Methods Comput. Sci. 8(3) (2010).
[BIB] Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Monoidal and Groupoidal Quantifiers. Log. Methods Comput. Sci. 6(3) (2010).
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. CSL 2010: 411-425.
[BIB] Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43.
[BIB] Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47(2): 454-490 (2010).
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39(7): 3186-3206 (2010).
[BIB] Peter Lohmann, Heribert Vollmer:
Complexity Results for Modal Dependence Logic. Circuits, Logic, and Games 2010.
[BIB] Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010.
[BIB] Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010.
[BIB] Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010.
[BIB] Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010.
[BIB] Arne Meier, Thomas Schneider:
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. CoRR abs/1001.4255 (2010).
[BIB] Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010).
[BIB] Michael Thomas, Heribert Vollmer:
Complexity of Non-Monotonic Logics. CoRR abs/1009.1990 (2010).
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Circuits, Logic, and Games 2010.
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Electronic Colloquium on Computational Complexity (ECCC) 17: 59 (2010).
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Electronic Colloquium on Computational Complexity (ECCC) 17: 81 (2010).
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege is Not Optimal. Electronic Colloquium on Computational Complexity (ECCC) 17: 198 (2010).
[BIB] Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. CoRR abs/1006.4923 (2010).
[BIB] Michael Thomas:
On the Applicability of Post's Lattice. CoRR abs/1007.2924 (2010).
[BIB] Olaf Beyersdorff:
The Deduction Theorem for Strong Propositional Proof Systems. Theory Comput. Syst. 47(1): 162-178 (2010).
[BIB] Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Inf. Process. Lett. 110(23): 1074-1077 (2010).
[BIB] Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129.
[BIB] Olaf Beyersdorff:
Proof Complexity of Non-classical Logics. TAMC 2010: 15-27.
[BIB] Olaf Beyersdorff, Sebastian Müller:
Different Approaches to Proof Systems. TAMC 2010: 50-59.
[BIB] Olaf Beyersdorff, Sebastian Müller:
A tight Karp-Lipton collapse result in bounded arithmetic. ACM Trans. Comput. Log. 11(4): 22:1-22:23 (2010).
[BIB] Michael Thomas:
On the complexity of fragments of nonmonotonic logics. University of Hanover 2010. ISBN 978-3-86955-571-3.
[BIB] Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010.

2009

[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28.
[BIB] Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS 2009: 587-599.
[BIB] Eric 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).
[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Log. Methods Comput. Sci. 5(1) (2009).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64.
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009).
[BIB] Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I. CoRR abs/0906.1489 (2009).
[BIB] Olaf Beyersdorff, Zenon Sadowski:
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. Electronic Colloquium on Computational Complexity (ECCC) 16: 81 (2009).
[BIB] Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Proof Systems that Take Advice. Electronic Colloquium on Computational Complexity (ECCC) 16: 92 (2009).
[BIB] Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. CoRR abs/0912.3134 (2009).
[BIB] Heribert Vollmer:
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis. Theory Comput. Syst. 44(1): 82-90 (2009).
[BIB] Olaf Beyersdorff, Johannes Köbler, Jochen Messner:
Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38-40): 3839-3855 (2009).
[BIB] Olaf Beyersdorff:
Comparing axiomatizations of free pseudospaces. Arch. Math. Log. 48(7): 625-641 (2009).
[BIB] Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice. LATA 2009: 164-175.
[BIB] Michael Thomas:
The Complexity of Circumscriptive Inference in Post's Lattice. LPNMR 2009: 290-302.
[BIB] Olaf Beyersdorff, Sebastian Müller:
Does Advice Help to Prove Propositional Tautologies? SAT 2009: 65-72.
[BIB] Olaf Beyersdorff:
On the Existence of Complete Disjoint NP-Pairs. SYNASC 2009: 282-289.
[BIB] Olaf Beyersdorff, Zenon Sadowski:
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. CSR 2009: 47-58.
[BIB] Olaf Beyersdorff:
On the correspondence between arithmetic theories and propositional proof systems - a survey. Math. Log. Q. 55(2): 116-137 (2009).
[BIB] Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009).
[BIB] Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20(5): 901-918 (2009). Zugehöriges Erratum vorhanden.
[BIB] Olaf Beyersdorff, Yevgen Nebesov:
Edges as Nodes - a New Approach to Timetable Information . ATMOS 2009.

2008

[BIB] Michael 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. Electron. Colloquium Comput. Complex. TR08 (2008).
[BIB] Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL^*. Workshop on Reachability Problems, published in Electron. Notes Theor. Comput. Sci., volume 223, 2008: 201-213.
[BIB] Juha Kontinen, Heribert Vollmer:
On Second-Order Monadic Groupoidal Quantifiers. WoLLIC 2008: 238-248.
[BIB] Nadia Creignou, Heribert Vollmer:
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?. Complexity of Constraints 2008: 3-37.
[BIB] Michael 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).
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CoRR abs/0805.4072 (2008).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008).
[BIB] Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008).
[BIB] Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Nondeterministic Instance Complexity and Proof Systems with Advice. Electronic Colloquium on Computational Complexity (ECCC) 15(075) (2008).
[BIB] Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. CoRR abs/0802.1884 (2008).
[BIB] Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008).
[BIB] Olaf Beyersdorff:
Tuples of Disjoint NP-Sets. Theory Comput. Syst. 43(2): 118-135 (2008).
[BIB] Edith Hemaspaandra, Henning Schnoor:
On the Complexity of Elementary Modal Logics. STACS 2008: 349-360.
[BIB] Nadia Creignou, Henning Schnoor, Ilka Schnoor:
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint. CSL 2008: 109-123.
[BIB] Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78.
[BIB] Olaf Beyersdorff, Sebastian Müller:
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. CSL 2008: 199-214.
[BIB] Olaf Beyersdorff:
Logical Closure Properties of Propositional Proof Systems. TAMC 2008: 318-329.
[BIB] Henning Schnoor, Ilka Schnoor:
Partial Polymorphisms and Constraint Satisfaction Problems. Complexity of Constraints 2008: 229-254.
[BIB] Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Approximability of Manipulating Elections. AAAI 2008: 44-49.
[BIB] (Ed.) Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. Springer 2008. ISBN 978-3-540-76393-2.
[BIB] Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Copeland voting: ties matter. AAMAS (2) 2008: 983-990.
[BIB] Peter Lohmann:
Fragments of Temporal Logic and Formal Languages. 2008. Diplomarbeit.

2007

[BIB] Michael 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. M4M 2007: 277-292.
[BIB] Heribert Vollmer:
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis. Electron. Colloquium Comput. Complex. TR07 (2007).
[BIB] Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007).
[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. FoSSaCS 2007: 48-62.
[BIB] Matthias Becker, Helena Szczerbicka, Michael Thomas:
Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles. Cybernetics and Systems 38(5): 535-548 (2007).
[BIB] Elmar Böhler, Henning Schnoor:
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41(4): 753-777 (2007).
[BIB] Olaf Beyersdorff:
Classes of representable disjoint NP-pairs. Theor. Comput. Sci. 377(1-3): 93-109 (2007).
[BIB] Henning Schnoor, Ilka Schnoor:
Enumerating All Solutions for Constraint Satisfaction Problems. STACS 2007: 694-705.
[BIB] Olaf Beyersdorff:
The Deduction Theorem for Strong Propositional Proof Systems. FSTTCS 2007: 241-252.
[BIB] Philippe Chapdelaine, Miki Hermann, Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR 2007: 58-70.
[BIB] Heribert Vollmer:
Computational Complexity of Constraint Satisfaction. CiE 2007: 748-757.
[BIB] Michael Bauland:
Complexity results for boolean constraint satisfaction problems. University of Hanover 2007. ISBN 978-3-86727-151-6.
[BIB] Arne Meier:
Complexity of Temporal Logics. 2007. Masterarbeit

2006

[BIB] Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Complexity of Generalized Satisfiability for Linear Temporal Logic. Electron. Colloquium Comput. Complex. TR06 (2006).
[BIB] Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006).
[BIB] Friedrich Steimann, Heribert Vollmer:
Exploiting practical limitations of UML diagrams for model validation and execution. Softw. Syst. Model. 5(1): 26-47 (2006).
[BIB] Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006.
[BIB] Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006.
[BIB] Henning Schnoor, Ilka Schnoor:
Enumerating all Solutions for Constraint Satisfaction Problems. Complexity of Constraints 2006.
[BIB] Henning Schnoor, Ilka Schnoor:
New Algebraic Tools for Constraint Satisfaction. Complexity of Constraints 2006.
[BIB] Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. STACS 2006: 500-511.
[BIB] Tanmoy Chakraborty, Samir Datta:
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS 2006: 57-68.
[BIB] Tanmoy Chakraborty, Samir Datta:
One-input-face MPCVP is Hard for L, but in LogDCFL. Electronic Colloquium on Computational Complexity (ECCC) 13(130) (2006).
[BIB] Olaf Beyersdorff:
On the Deduction Theorem and Complete Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC) 13(142) (2006).

2005

[BIB] Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05 (2005).
[BIB] Matthias Galota, Heribert Vollmer:
Functions computable in polynomial space. Inf. Comput. 198(1): 56-70 (2005).
[BIB] Christian Glaßer, Steffen Reith, Heribert Vollmer:
The complexity of base station positioning in cellular networks. Discret. Appl. Math. 148(1): 1-12 (2005).
[BIB] Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005).
[BIB] Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. MFCS 2005: 119-130.
[BIB] Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82.
[BIB] Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy:
Grid Graph Reachability Problems. Electronic Colloquium on Computational Complexity (ECCC)(149) (2005).
[BIB] Olaf Beyersdorff:
Disjoint NP-Pairs from Propositional Proof Systems. Electronic Colloquium on Computational Complexity (ECCC)(083) (2005).
[BIB] Henning Schnoor:
The Complexity of the Boolean Formula Value Problem. (2005).
[BIB] Birgit Schelm:
Complexity of Nonmonotonic Logics – An Incomplete Survey. (2005).

2004

[BIB] Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. Electron. Colloquium Comput. Complex. TR04 (2004).
[BIB] Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004.
[BIB] Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33(6): 1513-1531 (2004).
[BIB] Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. CoRR abs/cs/0412062 (2004).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175.
[BIB] Michael 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.
[BIB] Olaf Beyersdorff:
Representable Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC)(082) (2004).
[BIB] Heribert Vollmer:
First-order logic with groupoidal quantifiers. ESSLLI 2003, Collecium Logicum Vol. VI, Kurt-Gödel-Society 2004: 71-105.
[BIB] Elmar Böhler, Nadia Creignou, Steffen Reith, Heribert Vollmer:
Playing with Boolean Blocks, Part II: Constraint Satisfaction Problems. (2004).

2003

[BIB] Matthias Galota, Heribert Vollmer:
Functions Computable in Polynomial Space. Electron. Colloquium Comput. Complex. TR03 (2003).
[BIB] Steffen Reith, Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003).
[BIB] Matthias Galota, Sven Kosub, Heribert Vollmer:
Generic separations and leaf languages. Math. Log. Q. 49(4): 353-362 (2003).
[BIB] Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. SIAM J. Comput. 32(6): 1542-1569 (2003).
[BIB] Heribert Vollmer:
Complexity Theory Made Easy. Developments in Language Theory 2003: 95-110.
[BIB] Elmar Böhler, Nadia Creignou, Steffen Reith, Heribert Vollmer:
Playing with Boolean Blocks, Part I: Post's Lattice with Applications to Complexity Theory. (2003).

2002

[BIB] Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. Electron. Colloquium Comput. Complex. TR02 (2002).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002).
[BIB] Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426.
[BIB] Elmar Böhler, Heribert Vollmer:
Boolean Functions and Post’s Lattice with Applications to Complexity Theory. (2002). Lecture Notes for Logic and Interaction 2002.

2001

[BIB] Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. Discret. Math. Theor. Comput. Sci. 4(2): 179-192 (2001).
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001).
[BIB] Matthias 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.
[BIB] Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250.
[BIB] Matthias Galota, Heribert Vollmer:
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem. CSL 2001: 355-368.
[BIB] Steffen Reith, Heribert Vollmer:
Ist P=NP? Einführung in die Theorie der NP-Vollständigkeit. (2001). Technischer Bericht.

2000

[BIB] Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chic. J. Theor. Comput. Sci. 2000 (2000).
[BIB] Todd Ebert, Heribert Vollmer:
On the Autoreducibility of Random Sequences. MFCS 2000: 333-342.
[BIB] Steffen Reith, Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649.
[BIB] Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000).
[BIB] Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000).
[BIB] Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178.
[BIB] Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS 2000: 164-175.
[BIB] Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The Many Faces of a Translation. ICALP 2000: 890-901.

1999

[BIB] Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999).
[BIB] Heribert Vollmer:
Uniform characterizations of complexity classes. SIGACT News 30(1): 17-27 (1999).
[BIB] Timo Peichl, Heribert Vollmer:
Finite Automata with Generalized Acceptance Criteria. ICALP 1999: 605-614.
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454.
[BIB] Heribert Vollmer:
Introduction to Circuit Complexity - A Uniform Approach. Springer 1999. ISBN 978-3-662-03927-4.

1998

[BIB] Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electron. Colloquium Comput. Complex. TR98 (1998).
[BIB] Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Types. Electron. Colloquium Comput. Complex. TR98 (1998).
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. Electron. Colloquium Comput. Complex. TR98 (1998).
[BIB] Heribert Vollmer:
Relating Polynomial Time to Constant Depth. Theor. Comput. Sci. 207(1): 159-170 (1998).
[BIB] Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC¹ Computation. J. Comput. Syst. Sci. 57(2): 200-212 (1998).
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. 7(3): 265-289 (1998).
[BIB] Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998).
[BIB] Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. CoRR cs.CC/9809115 (1998).
[BIB] Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998).
[BIB] Sven Kosub, Heinz Schmitz, Heribert Vollmer:
Uniformly Defining Complexity Classes of Functions. STACS 1998: 607-617.
[BIB] K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31(1): 93-108 (1998).
[BIB] Hans-Jörg Burtschick, Heribert Vollmer:
Lindström Quantifiers and Leaf Language Definability. Int. J. Found. Comput. Sci. 9(3): 277-294 (1998).

1997

[BIB] Heribert Vollmer, Klaus W. Wagner:
On Operators of Higher Types. CCC 1997: 174-184.
[BIB] Kenneth W. Regan, Heribert Vollmer:
Gap-Languages and Log-Time Complexity Classes. Theor. Comput. Sci. 188(1-2): 101-116 (1997).
[BIB] Heribert Vollmer:
A Generalized Quantifier Concept in Computational Complexity Theory. ESSLLI 1997: 99-123.
[BIB] Heribert Vollmer, Klaus W. Wagner:
Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity 1997: 285-312.

1996

[BIB] Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269.
[BIB] Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer:
Nondeterministic NC¹ Computation. CCC 1996: 12-21.
[BIB] Hans-Jörg Burtschick, Heribert Vollmer:
Lindstroem Quantifiers and Leaf Language Definability. Electron. Colloquium Comput. Complex. TR96 (1996).
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes. Electron. Colloquium Comput. Complex. TR96 (1996).
[BIB] Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory 29(4): 411-421 (1996).
[BIB] Heribert Vollmer, Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163(1&2): 245-258 (1996).
[BIB] Ronald V. Book, Heribert Vollmer, Klaus W. Wagner:
On Type-2 Probabilistic Quantifiers. ICALP 1996: 369-380.
[BIB] Heribert Vollmer:
Relations Among Parallel and Sequential Computation Models. ASIAN 1996: 23-32.

1995

[BIB] Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting. SCT 1995: 299-314.
[BIB] Heribert Vollmer, Klaus W. Wagner:
Complexity Classes of Optimization Functions. Inf. Comput. 120(2): 198-219 (1995).
[BIB] Lane A. Hemaspaandra, Heribert Vollmer:
The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26(1): 2-13 (1995).

1994

[BIB] Heribert Vollmer:
Komplexitätsklassen von Funktionen. Julius Maximilians University Würzburg, Germany 1994.
[BIB] Heribert Vollmer:
On Different Reducibility Notions for Function Classes. STACS 1994: 449-460.

1993

[BIB] Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT 1993: 200-207.
[BIB] Heribert Vollmer, Klaus W. Wagner:
The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4(4): 293-307 (1993).

1992

[BIB] 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

[BIB] Heribert Vollmer:
The Gap-Language-Technique Revisited. CSL 1990: 389-399.

Bereitgestellt durch die dblp computer science bibliography
Impressum | Datenschutz | Haftungsausschluss