Klaus W. Wagner

Publication Activity (10 Years)

Years Active: 1973-2015
Publications (10 Years): 1

Top Venues

J. Comput. Syst. Sci.

Algorithms, Probability, Networks, and Games

Publications

Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games (2015)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect correspondences between dot-depth and polynomial-time hierarchies. J. Comput. Syst. Sci. 80 (7) (2014)
Andrei S. Morozov, Klaus W. Wagner
Editorial. Theory Comput. Syst. 49 (2) (2011)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74 (7) (2008)
Sven Kosub, Klaus W. Wagner
The boolean hierarchy of NP-partitions. Inf. Comput. 206 (5) (2008)
Victor L. Selivanov, Klaus W. Wagner
Complexity of Topological Properties of Regular omega-Languages. Fundam. Informaticae 83 (1-2) (2008)
Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Victor L. Selivanov, Klaus W. Wagner
Complexity of Topological Properties of Regular omega-Languages. Developments in Language Theory (2008)
Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations (2008)
Victor L. Selivanov, Klaus W. Wagner
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. CiE (2008)
Pierre McKenzie, Klaus W. Wagner
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. Comput. Complex. 16 (3) (2007)
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. WINE (2007)
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
The Complexity of Computing the Size of an Interval. SIAM J. Comput. 36 (5) (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. STACS (2007)
Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. 13 (069) (2006)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory (2006)
Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
The Complexity of Computing the Size of an Interval CoRR (2005)
Christian Glaßer, Stephen D. Travers, Klaus W. Wagner
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electron. Colloquium Comput. Complex. (035) (2005)
Victor L. Selivanov, Klaus W. Wagner
A reducibility for the dot-depth hierarchy. Theor. Comput. Sci. 345 (2-3) (2005)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation problems. Theor. Comput. Sci. 345 (2-3) (2005)
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Arithmetic Circuits and Polynomial Replacement Systems. SIAM J. Comput. 33 (6) (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems. MFCS (2004)
Klaus W. Wagner
Leaf Language Classes. MCU (2004)
Victor L. Selivanov, Klaus W. Wagner
A Reducibility for the Dot-Depth Hierarchy. MFCS (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems Electron. Colloquium Comput. Complex. (037) (2004)
Pierre McKenzie, Klaus W. Wagner
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. STACS (2003)
Werner Kuich, Klaus W. Wagner
On the Exponentiation of Languages. FCT (2003)
Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
The Complexity of Computing the Size of an Interval. ICALP (2001)
Steffen Reith, Klaus W. Wagner
On boolean lowness and boolean highness. Theor. Comput. Sci. 261 (2) (2001)
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)
Sven Kosub, Klaus W. Wagner
The Boolean Hierarchy of NP-Partitions. STACS (2000)
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Arithmetic Circuits and Polynomial Replacement Systems. FSTTCS (2000)
Herbert Baier, Klaus W. Wagner
Bounding Queries in the Analytic Polynomial-Time Hierarchy. Theor. Comput. Sci. 207 (1) (1998)
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
Probabilistic Type-2 Operators and "Almost"-Classes. Comput. Complex. 7 (3) (1998)
K. Cronauer, Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
The Chain Method to Separate Counting Classes. Theory Comput. Syst. 31 (1) (1998)
Steffen Reith, Klaus W. Wagner
On Boolean Lowness and Boolean Highness. COCOON (1998)
Klaus W. Wagner
A Note on Parallel Queries and the Symmetric-Difference Hierarchy. Inf. Process. Lett. 66 (1) (1998)
Heinz Schmitz, Klaus W. Wagner
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy CoRR (1998)
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. 5 (57) (1998)
Herbert Baier, Klaus W. Wagner
The Analytic Polynomial Time Hierarchy. Math. Log. Q. 44 (1998)
Heribert Vollmer, Klaus W. Wagner
Measure One Results in Computational Complexity Theory. Advances in Algorithms, Languages, and Complexity (1997)
Heribert Vollmer, Klaus W. Wagner
On Operators of Higher Types. Computational Complexity Conference (1997)
Diana Rooß, Klaus W. Wagner
On the Power of DNA-Computing. Inf. Comput. 131 (2) (1996)
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
On Type-2 Probabilistic Quantifiers. ICALP (1996)
Heribert Vollmer, Klaus W. Wagner
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. Theor. Comput. Sci. 163 (1&2) (1996)
Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
Probabilistic Type-2 Operators and "Almost"-Classes Electron. Colloquium Comput. Complex. 3 (35) (1996)
Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
On Balanced Versus Unbalanced Computation Trees. Math. Syst. Theory 29 (4) (1996)
Heribert Vollmer, Klaus W. Wagner
Complexity Classes of Optimization Functions Inf. Comput. 120 (2) (1995)
Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner
On the Power of Number-Theoretic Operations with Respect to Counting. Computational Complexity Conference (1995)
Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
An Observation on Probability Versus Randomness with Applications to Complexity Classes. Math. Syst. Theory 27 (3) (1994)
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Computational Complexity Conference (1993)
Klaus W. Wagner
The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note). STACS (1993)
Heribert Vollmer, Klaus W. Wagner
The Complexity of Finding Middle Elements. Int. J. Found. Comput. Sci. 4 (4) (1993)
Ronald V. Book, Jack H. Lutz, Klaus W. Wagner
On Complexity Classes and Algorithmically Random Languages (Extended Abstract). STACS (1992)
Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner
On the Power of One-Way Synchronized Alternating Machines with Small Space. Int. J. Found. Comput. Sci. 3 (1) (1992)
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
On the Power of Polynomial Bit-Reductions Universität Trier, Mathematik/Informatik, Forschungsbericht (1992)
Thomas Lengauer, Klaus W. Wagner
The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. J. Comput. Syst. Sci. 44 (1) (1992)
Ulrich Hertrampf, Klaus W. Wagner
Interactive Proof Systems: Provers, Rounds, and Error Bounds. CSL (1990)
Eric Allender, Klaus W. Wagner
Counting Hierarchies: Polynomial Time and Constant. Bull. EATCS 40 (1990)
Miroslaw Kowaluk, Klaus W. Wagner
Vector Language: Simple Description of Hard Instances (Extended Abstract). MFCS (1990)
Thomas Lengauer, Klaus W. Wagner
The Binary Network Flow Problem is Logspace Complete for P. Theor. Comput. Sci. 75 (3) (1990)
Klaus W. Wagner
Bounded Query Classes. SIAM J. Comput. 19 (5) (1990)
Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18 (1) (1989)
Klaus W. Wagner
On Restricting the Access to an NP-Oracle. ICALP (1988)
Klaus W. Wagner
Bounded query computations. Computational Complexity Conference (1988)
Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. 17 (6) (1988)
Marek Karpinski, Klaus W. Wagner
The computational complexity of graph problems with succinct multigraph representation. ZOR Methods Model. Oper. Res. 32 (3-4) (1988)
Uwe Schöning, Klaus W. Wagner
Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. STACS (1988)
Thomas Lengauer, Klaus W. Wagner
The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. STACS (1987)
Johannes Köbler, Uwe Schöning, Klaus W. Wagner
The Difference and Truth-Table Hierarchies for NP. RAIRO Theor. Informatics Appl. 21 (4) (1987)
Klaus W. Wagner
More Complicated Questions About Maxima and Minima, and Some Closures of NP. Theor. Comput. Sci. 51 (1987)
Klaus W. Wagner
Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity. Computation Theory and Logic (1987)
Franz-Josef Brandenburg, Andreas Brandstädt, Klaus W. Wagner
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. Math. Syst. Theory 19 (4) (1987)
Klaus W. Wagner
Some Observations on the Connection Between Counting an Recursion. Theor. Comput. Sci. 47 (3) (1986)
Klaus W. Wagner
On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages. Inf. Process. Lett. 23 (3) (1986)
Rainer Bodendiek, Klaus W. Wagner
A characterization of the minimalbasis of the torus. Comb. 6 (3) (1986)
Klaus W. Wagner
The Complexity of Combinatorial Problems with Succinct Input Representation. Acta Informatica 23 (3) (1986)
Klaus W. Wagner
More Complicated Questions About Maxima and Minima, and Some Closures of NP. ICALP (1986)
Rainer Bodendiek, Klaus W. Wagner
Zur Einbettbarkeit von Graphen in den Torus. Eur. J. Comb. 6 (2) (1985)
Jörg Vogel, Klaus W. Wagner
Two-Way Automata with More than one Storage Medium. Theor. Comput. Sci. 39 (1985)
Rainer Bodendiek, Klaus W. Wagner
On some minimal graphs of the torus. J. Graph Theory 9 (3) (1985)
Klaus W. Wagner
Monotonic Coverings of Finite Sets. J. Inf. Process. Cybern. 20 (12) (1984)
Andreas Brandstädt, Klaus W. Wagner
Reversal-Bounded and Visit-Bounded Realtime Computations. FCT (1983)
Dietrich Meinhardt, Klaus W. Wagner
Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten. J. Inf. Process. Cybern. 18 (1/2) (1982)
Klaus W. Wagner
Bounded Recursion and Complexity Classes. MFCS (1979)
Klaus W. Wagner
On omega-Regular Sets Inf. Control. 43 (2) (1979)
Ludwig Staiger, Klaus W. Wagner
Rekursive Folgenmengen I. Math. Log. Q. 24 (31-36) (1978)
Klaus W. Wagner
Arithmetische und Bairesche Operatoren. Math. Log. Q. 23 (7-12) (1977)
Klaus W. Wagner, Ludwig Staiger
Recursive omega-Languages. FCT (1977)
Klaus W. Wagner
Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. 13 (9) (1977)
Klaus W. Wagner, Gerd Wechsung
Complexity Hierarchies of Oracles. MFCS (1977)
Klaus W. Wagner
Arithmetische Operatoren. Math. Log. Q. 22 (1) (1976)
Klaus W. Wagner
Eine Axiomatisierung der Theorie der regulären Folgenmengen. J. Inf. Process. Cybern. 12 (7) (1976)
Klaus W. Wagner
Akzeptierbarkeitsgrade regulärer Folgemengen. J. Inf. Process. Cybern. 11 (10-12) (1975)
Klaus W. Wagner
A Hierarchy of Regular Sequence Sets. MFCS (1975)
Klaus W. Wagner, Ludwig Staiger
Finite Automata Acceptation of Infinite Sequences. MFCS (1974)
Klaus W. Wagner
Zellulare Berechenbarkeit von Funktionen über n-dimensionalen Zeichensystemen. J. Inf. Process. Cybern. 10 (5/6) (1974)
Ludwig Staiger, Klaus W. Wagner
Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. 10 (7) (1974)
Klaus W. Wagner
Universelle Turingmaschinen mit n-dimensionalem Band. J. Inf. Process. Cybern. 9 (7/8) (1973)
Klaus W. Wagner
Die Modellierung der Arbeit von Turingmaschinen mit n-dimensionalem Band durch Turingmaschinen mit eindimensionalem Band. J. Inf. Process. Cybern. 9 (3) (1973)

Klaus W. Wagner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus W. Wagner