Klaus W. Wagner

108 papers A* 4A 10B 11C 4Misc 2Journal 63Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	The Forty Nine Kuratowski Lattices in the Cantor Space. J. Autom. Lang. Comb. Ludwig Staiger, Klaus W. Wagner
2015	—	`conf`	Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2014	J	`jnl`	Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2011	J	`jnl`	Editorial. Theory Comput. Syst. Andrei S. Morozov, Klaus W. Wagner
2009	Misc	`ed.`	Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings CSR Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner
2008	—	`conf`	08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008	—	`conf`	08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2008	C	`conf`	Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. CiE Victor L. Selivanov, Klaus W. Wagner
2008	C	`conf`	Complexity of Topological Properties of Regular omega-Languages. Developments in Language Theory Victor L. Selivanov, Klaus W. Wagner
2008	J	`jnl`	Complexity of Topological Properties of Regular omega-Languages. Fundam. Informaticae Victor L. Selivanov, Klaus W. Wagner
2008	J	`jnl`	The boolean hierarchy of NP-partitions. Inf. Comput. Sven Kosub, Klaus W. Wagner
2008	J	`jnl`	The complexity of unions of disjoint sets. J. Comput. Syst. Sci. Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2008	—	`ed.`	Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008 Topological and Game-Theoretic Aspects of Infinite Computations Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
2007	J	`jnl`	The Complexity of Computing the Size of an Interval. SIAM J. Comput. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2007	J	`jnl`	The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. Comput. Complex. Pierre McKenzie, Klaus W. Wagner
2007	A	`conf`	The Complexity of Unions of Disjoint Sets. STACS Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2007	—	`conf`	Weighted Boolean Formula Games. WINE Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
2006	C	`conf`	Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2006	J	`jnl`	The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
2005	J	`jnl`	A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electron. Colloquium Comput. Complex. Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
2005	J	`jnl`	A reducibility for the dot-depth hierarchy. Theor. Comput. Sci. Victor L. Selivanov, Klaus W. Wagner
2005	J	`jnl`	Generation problems. Theor. Comput. Sci. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2005	J	`jnl`	The Complexity of Computing the Size of an Interval CoRR Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
2004	B	`conf`	A Reducibility for the Dot-Depth Hierarchy. MFCS Victor L. Selivanov, Klaus W. Wagner
2004	J	`jnl`	Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
2004	J	`jnl`	Generation Problems Electron. Colloquium Comput. Complex. Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2004	B	`conf`	Generation Problems. MFCS Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2004	C	`conf`	Leaf Language Classes. MCU Klaus W. Wagner
2003	B	`conf`	On the Exponentiation of Languages. FCT Werner Kuich, Klaus W. Wagner
2003	A	`conf`	The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. STACS Pierre McKenzie, Klaus W. Wagner
2003	—	`book`	Theoretische Informatik - eine kompakte Einführung (2. Aufl.). Klaus W. Wagner
2001	J	`jnl`	On boolean lowness and boolean highness. Theor. Comput. Sci. Steffen Reith, Klaus W. Wagner
2001	A*	`conf`	The Complexity of Computing the Size of an Interval. ICALP Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
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	A	`conf`	The Boolean Hierarchy of NP-Partitions. STACS Sven Kosub, Klaus W. Wagner
1998	J	`jnl`	A Note on Parallel Queries and the Symmetric-Difference Hierarchy. Inf. Process. Lett. Klaus W. Wagner
1998	J	`jnl`	Bounding Queries in the Analytic Polynomial-Time Hierarchy. Theor. Comput. Sci. Herbert Baier, Klaus W. Wagner
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	Misc	`conf`	On Boolean Lowness and Boolean Highness. COCOON Steffen Reith, Klaus W. Wagner
1998	J	`jnl`	Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
1998	J	`jnl`	The Analytic Polynomial Time Hierarchy. Math. Log. Q. Herbert Baier, Klaus W. Wagner
1998	J	`jnl`	The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy CoRR Heinz Schmitz, Klaus W. Wagner
1998	J	`jnl`	The Chain Method to Separate Counting Classes. Theory Comput. Syst. K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
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	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`	On the Power of DNA-Computing. Inf. Comput. Diana Rooß, 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
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
1994	J	`jnl`	An Observation on Probability Versus Randomness with Applications to Complexity Classes. Math. Syst. Theory Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
1994	—	`book`	Einführung in die theoretische Informatik - Grundlagen und Modelle. Klaus W. Wagner
1994	A	`ed.`	STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings STACS Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner
1993	—	`ch.`	Counting Hierarchies: Polynomial Time and Constant Depth Circuits. Current Trends in Theoretical Computer Science Eric Allender, Klaus W. Wagner
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	A	`ed.`	STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings STACS Patrice Enjalbert, Alain Finkel, Klaus W. Wagner
1993	A	`conf`	The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note). STACS Klaus W. Wagner
1993	J	`jnl`	The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. Heribert Vollmer, Klaus W. Wagner
1992	A	`conf`	On Complexity Classes and Algorithmically Random Languages (Extended Abstract). STACS Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
1992	J	`jnl`	On the Power of One-Way Synchronized Alternating Machines with Small Space. Int. J. Found. Comput. Sci. Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, 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
1992	J	`jnl`	The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. J. Comput. Syst. Sci. Thomas Lengauer, Klaus W. Wagner
1990	J	`jnl`	Bounded Query Classes. SIAM J. Comput. Klaus W. Wagner
1990	J	`jnl`	Counting Hierarchies: Polynomial Time and Constant. Bull. EATCS Eric Allender, Klaus W. Wagner
1990	B	`conf`	Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL Ulrich Hertrampf, Klaus W. Wagner
1990	J	`jnl`	The Binary Network Flow Problem is Logspace Complete for P. Theor. Comput. Sci. Thomas Lengauer, Klaus W. Wagner
1990	B	`conf`	Vector Language: Simple Description of Hard Instances (Extended Abstract). MFCS Miroslaw Kowaluk, Klaus W. Wagner
1989	J	`jnl`	The Boolean Hierarchy II: Applications. SIAM J. Comput. Jin-Yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
1988	—	`conf`	Bounded query computations. SCT Klaus W. Wagner
1988	A	`conf`	Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. STACS Uwe Schöning, Klaus W. Wagner
1988	A*	`conf`	On Restricting the Access to an NP-Oracle. ICALP Klaus W. Wagner
1988	J	`jnl`	The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. Jin-Yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
1988	J	`jnl`	The computational complexity of graph problems with succinct multigraph representation. ZOR Methods Model. Oper. Res. Marek Karpinski, Klaus W. Wagner
1987	—	`conf`	Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity. Computation Theory and Logic Klaus W. Wagner
1987	J	`jnl`	More Complicated Questions About Maxima and Minima, and Some Closures of NP. Theor. Comput. Sci. Klaus W. Wagner
1987	A	`conf`	The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. STACS Thomas Lengauer, Klaus W. Wagner
1987	J	`jnl`	The Difference and Truth-Table Hierarchies for NP. RAIRO Theor. Informatics Appl. Johannes Köbler, Uwe Schöning, Klaus W. Wagner
1987	J	`jnl`	Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Math. Syst. Theory Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner
1986	J	`jnl`	A characterization of the minimalbasis of the torus. Comb. Rainer Bodendiek, Klaus W. Wagner
1986	A*	`conf`	More Complicated Questions About Maxima and Minima, and Some Closures of NP. ICALP Klaus W. Wagner
1986	J	`jnl`	On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages. Inf. Process. Lett. Klaus W. Wagner
1986	J	`jnl`	Some Observations on the Connection Between Counting an Recursion. Theor. Comput. Sci. Klaus W. Wagner
1986	J	`jnl`	The Complexity of Combinatorial Problems with Succinct Input Representation. Acta Informatica Klaus W. Wagner
1985	J	`jnl`	On some minimal graphs of the torus. J. Graph Theory Rainer Bodendiek, Klaus W. Wagner
1985	J	`jnl`	Two-Way Automata with More than one Storage Medium. Theor. Comput. Sci. Jörg Vogel, Klaus W. Wagner
1985	J	`jnl`	Zur Einbettbarkeit von Graphen in den Torus. Eur. J. Comb. Rainer Bodendiek, Klaus W. Wagner
1984	J	`jnl`	Monotonic Coverings of Finite Sets. J. Inf. Process. Cybern. Klaus W. Wagner
1983	B	`conf`	Reversal-Bounded and Visit-Bounded Realtime Computations. FCT Andreas Brandstädt, Klaus W. Wagner
1982	J	`jnl`	Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten. J. Inf. Process. Cybern. Dietrich Meinhardt, Klaus W. Wagner
1979	B	`conf`	Bounded Recursion and Complexity Classes. MFCS Klaus W. Wagner
1979	J	`jnl`	On omega-Regular Sets Inf. Control. Klaus W. Wagner
1978	J	`jnl`	Rekursive Folgenmengen I. Math. Log. Q. Ludwig Staiger, Klaus W. Wagner
1977	J	`jnl`	Arithmetische und Bairesche Operatoren. Math. Log. Q. Klaus W. Wagner
1977	B	`conf`	Complexity Hierarchies of Oracles. MFCS Klaus W. Wagner, Gerd Wechsung
1977	J	`jnl`	Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. Klaus W. Wagner
1977	B	`conf`	Recursive omega-Languages. FCT Klaus W. Wagner, Ludwig Staiger
1976	J	`jnl`	Arithmetische Operatoren. Math. Log. Q. Klaus W. Wagner
1976	J	`jnl`	Eine Axiomatisierung der Theorie der regulären Folgenmengen. J. Inf. Process. Cybern. Klaus W. Wagner
1975	B	`conf`	A Hierarchy of Regular Sequence Sets. MFCS Klaus W. Wagner
1975	J	`jnl`	Akzeptierbarkeitsgrade regulärer Folgemengen. J. Inf. Process. Cybern. Klaus W. Wagner
1974	J	`jnl`	Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. Ludwig Staiger, Klaus W. Wagner
1974	B	`conf`	Finite Automata Acceptation of Infinite Sequences. MFCS Klaus W. Wagner, Ludwig Staiger
1974	J	`jnl`	Zellulare Berechenbarkeit von Funktionen über n-dimensionalen Zeichensystemen. J. Inf. Process. Cybern. Klaus W. Wagner
1973	J	`jnl`	Die Modellierung der Arbeit von Turingmaschinen mit n-dimensionalem Band durch Turingmaschinen mit eindimensionalem Band. J. Inf. Process. Cybern. Klaus W. Wagner
1973	J	`jnl`	Universelle Turingmaschinen mit n-dimensionalem Band. J. Inf. Process. Cybern. Klaus W. Wagner