Die Modellierung der Arbeit von Turingmaschinen mit n-dimensionalem Band durch Turingmaschinen mit eindimensionalem Band. - Klaus W. Wagner (J. Inf. Process. Cybern., 1973)

Universelle Turingmaschinen mit n-dimensionalem Band. - Klaus W. Wagner (J. Inf. Process. Cybern., 1973)

Finite Automata Acceptation of Infinite Sequences. - Klaus W. Wagner; Ludwig Staiger (MFCS, 1974)

Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. - Ludwig Staiger; Klaus W. Wagner (J. Inf. Process. Cybern., 1974)

Zellulare Berechenbarkeit von Funktionen über n-dimensionalen Zeichensystemen. - Klaus W. Wagner (J. Inf. Process. Cybern., 1974)

A Hierarchy of Regular Sequence Sets. - Klaus W. Wagner (MFCS, 1975)

Akzeptierbarkeitsgrade regulärer Folgemengen. - Klaus W. Wagner (J. Inf. Process. Cybern., 1975)

Eine Axiomatisierung der Theorie der regulären Folgenmengen. - Klaus W. Wagner (J. Inf. Process. Cybern., 1976)

Arithmetische Operatoren. - Klaus W. Wagner (Math. Log. Q., 1976)

Recursive omega-Languages. - Klaus W. Wagner; Ludwig Staiger (FCT, 1977)

Complexity Hierarchies of Oracles. - Klaus W. Wagner; Gerd Wechsung (MFCS, 1977)

Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. - Klaus W. Wagner (J. Inf. Process. Cybern., 1977)

Arithmetische und Bairesche Operatoren. - Klaus W. Wagner (Math. Log. Q., 1977)

Rekursive Folgenmengen I. - Ludwig Staiger; Klaus W. Wagner (Math. Log. Q., 1978)

Bounded Recursion and Complexity Classes. - Klaus W. Wagner (MFCS, 1979)

On omega-Regular Sets - Klaus W. Wagner (Inf. Control., 1979)

Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten. - Dietrich Meinhardt; Klaus W. Wagner (J. Inf. Process. Cybern., 1982)

Reversal-Bounded and Visit-Bounded Realtime Computations. - Andreas Brandstädt; Klaus W. Wagner (FCT, 1983)

Monotonic Coverings of Finite Sets. - Klaus W. Wagner (J. Inf. Process. Cybern., 1984)

Zur Einbettbarkeit von Graphen in den Torus. - Rainer Bodendiek; Klaus W. Wagner (Eur. J. Comb., 1985)

On some minimal graphs of the torus. - Rainer Bodendiek; Klaus W. Wagner (J. Graph Theory, 1985)

Two-Way Automata with More than one Storage Medium. - Jörg Vogel 001; Klaus W. Wagner (Theor. Comput. Sci., 1985)

More Complicated Questions About Maxima and Minima, and Some Closures of NP. - Klaus W. Wagner (ICALP, 1986)

The Complexity of Combinatorial Problems with Succinct Input Representation. - Klaus W. Wagner (Acta Informatica, 1986)

A characterization of the minimalbasis of the torus. - Rainer Bodendiek; Klaus W. Wagner (Comb., 1986)

On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages. - Klaus W. Wagner (Inf. Process. Lett., 1986)

Some Observations on the Connection Between Counting an Recursion. - Klaus W. Wagner (Theor. Comput. Sci., 1986)

Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity. - Klaus W. Wagner (Computation Theory and Logic, 1987)

The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. - Thomas Lengauer; Klaus W. Wagner (STACS, 1987)

The Difference and Truth-Table Hierarchies for NP. - Johannes Köbler; Uwe Schöning; Klaus W. Wagner (RAIRO Theor. Informatics Appl., 1987)

Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines. - Franz-Josef Brandenburg; Andreas Brandstädt; Klaus W. Wagner (Math. Syst. Theory, 1987)

Bounded query computations. - Klaus W. Wagner (SCT, 1988)

On Restricting the Access to an NP-Oracle. - Klaus W. Wagner (ICALP, 1988)

Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. - Uwe Schöning; Klaus W. Wagner (STACS, 1988)

The computational complexity of graph problems with succinct multigraph representation. - Marek Karpinski; Klaus W. Wagner (ZOR Methods Model. Oper. Res., 1988)

The Boolean Hierarchy I: Structural Properties. - Jin-yi Cai; Thomas Gundermann; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner; Gerd Wechsung (SIAM J. Comput., 1988)

The Boolean Hierarchy II: Applications. - Jin-yi Cai; Thomas Gundermann; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner; Gerd Wechsung (SIAM J. Comput., 1989)

Interactive Proof Systems: Provers, Rounds, and Error Bounds. - Ulrich Hertrampf; Klaus W. Wagner (CSL, 1990)

Vector Language: Simple Description of Hard Instances (Extended Abstract). - Miroslaw Kowaluk; Klaus W. Wagner (MFCS, 1990)

Counting Hierarchies: Polynomial Time and Constant. - Eric Allender; Klaus W. Wagner (Bull. EATCS, 1990)

Bounded Query Classes. - Klaus W. Wagner (SIAM J. Comput., 1990)

The Binary Network Flow Problem is Logspace Complete for P. - Thomas Lengauer; Klaus W. Wagner (Theor. Comput. Sci., 1990)

On Complexity Classes and Algorithmically Random Languages (Extended Abstract). - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (STACS, 1992)

On the Power of One-Way Synchronized Alternating Machines with Small Space. - Juraj Hromkovic; Katsushi Inoue; Branislav Rovan; Anna Slobodová; Itsuo Takanami; Klaus W. Wagner (Int. J. Found. Comput. Sci., 1992)

On the Power of Polynomial Bit-Reductions - Ulrich Hertrampf; Clemens Lautemann; Thomas Schwentick; Heribert Vollmer; Klaus W. Wagner (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992)

On the Power of Polynomial Time Bit-Reductions (Extended Abstract). - Ulrich Hertrampf; Clemens Lautemann; Thomas Schwentick; Heribert Vollmer; Klaus W. Wagner (SCT, 1993)

The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note). - Klaus W. Wagner (STACS, 1993)

The Complexity of Finding Middle Elements. - Heribert Vollmer; Klaus W. Wagner (Int. J. Found. Comput. Sci., 1993)

Counting Hierarchies: Polynomial Time and Constant Depth Circuits. - Eric Allender; Klaus W. Wagner (Current Trends in Theoretical Computer Science, 1993)

Einführung in die theoretische Informatik - Grundlagen und Modelle. - Klaus W. Wagner (Springer, 1994)

An Observation on Probability Versus Randomness with Applications to Complexity Classes. - Ronald V. Book; Jack H. Lutz; Klaus W. Wagner (Math. Syst. Theory, 1994)

On the Power of Number-Theoretic Operations with Respect to Counting. - Ulrich Hertrampf; Heribert Vollmer; Klaus W. Wagner (SCT, 1995)

Complexity Classes of Optimization Functions - Heribert Vollmer; Klaus W. Wagner (Inf. Comput., 1995)

On Type-2 Probabilistic Quantifiers. - Ronald V. Book; Heribert Vollmer; Klaus W. Wagner (ICALP, 1996)

On the Power of DNA-Computing. - Diana Rooß; Klaus W. Wagner (Inf. Comput., 1996)

On Balanced Versus Unbalanced Computation Trees. - Ulrich Hertrampf; Heribert Vollmer; Klaus W. Wagner (Math. Syst. Theory, 1996)

Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. - Heribert Vollmer; Klaus W. Wagner (Theor. Comput. Sci., 1996)

Measure One Results in Computational Complexity Theory. - Heribert Vollmer; Klaus W. Wagner (Advances in Algorithms, Languages, and Complexity, 1997)

On Operators of Higher Types. - Heribert Vollmer; Klaus W. Wagner (CCC, 1997)

On Boolean Lowness and Boolean Highness. - Steffen Reith; Klaus W. Wagner (COCOON, 1998)

Probabilistic Type-2 Operators and "Almost"-Classes. - Ronald V. Book; Heribert Vollmer; Klaus W. Wagner (Comput. Complex., 1998)

The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy - Heinz Schmitz; Klaus W. Wagner (CoRR, 1998)

Characterizing Small Depth and Small Space Classes by Operators of Higher Types - Manindra Agrawal; Eric Allender; Samir Datta; Heribert Vollmer; Klaus W. Wagner (Electron. Colloquium Comput. Complex., 1998)

A Note on Parallel Queries and the Symmetric-Difference Hierarchy. - Klaus W. Wagner (Inf. Process. Lett., 1998)

The Analytic Polynomial Time Hierarchy. - Herbert Baier; Klaus W. Wagner (Math. Log. Q., 1998)

The Chain Method to Separate Counting Classes. - K. Cronauer; Ulrich Hertrampf; Heribert Vollmer; Klaus W. Wagner (Theory Comput. Syst., 1998)

Bounding Queries in the Analytic Polynomial-Time Hierarchy. - Herbert Baier; Klaus W. Wagner (Theor. Comput. Sci., 1998)

Arithmetic Circuits and Polynomial Replacement Systems. - Pierre McKenzie; Heribert Vollmer; Klaus W. Wagner (FSTTCS, 2000)

The Boolean Hierarchy of NP-Partitions. - Sven Kosub; Klaus W. Wagner (STACS, 2000)

Characterizing Small Depth and Small Space Classes by Operators of Higher Type. - Manindra Agrawal; Eric Allender; Samir Datta; Heribert Vollmer; Klaus W. Wagner (Chic. J. Theor. Comput. Sci., 2000)

The Complexity of Computing the Size of an Interval. - Lane A. Hemaspaandra; Sven Kosub; Klaus W. Wagner (ICALP, 2001)

Theoretische Informatik - eine kompakte Einführung (2. Aufl.). - Klaus W. Wagner (Springer, 2003)

On the Exponentiation of Languages. - Werner Kuich; Klaus W. Wagner (FCT, 2003)

The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. - Pierre McKenzie; Klaus W. Wagner (STACS, 2003)

Leaf Language Classes. - Klaus W. Wagner (MCU, 2004)

Generation Problems. - Elmar Böhler; Christian Glaßer; Bernhard Schwarz; Klaus W. Wagner (MFCS, 2004)

A Reducibility for the Dot-Depth Hierarchy. - Victor L. Selivanov; Klaus W. Wagner (MFCS, 2004)

A Reducibility that Corresponds to Unbalanced Leaf-Language Classes - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (Electron. Colloquium Comput. Complex., 2005)

Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (Developments in Language Theory, 2006)

The Complexity of Unions of Disjoint Sets. - Christian Glaßer; Alan L. Selman; Stephen D. Travers; Klaus W. Wagner (STACS, 2007)

Weighted Boolean Formula Games. - Marios Mavronicolas; Burkhard Monien; Klaus W. Wagner (WINE, 2007)

The Complexity of Computing the Size of an Interval. - Lane A. Hemaspaandra; Christopher M. Homan; Sven Kosub; Klaus W. Wagner (SIAM J. Comput., 2007)

Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. - Victor L. Selivanov; Klaus W. Wagner (CiE, 2008)

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. - Peter Hertling; Victor L. Selivanov; Wolfgang Thomas; William W. Wadge; Klaus W. Wagner (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. - Peter Hertling; Victor L. Selivanov; Wolfgang Thomas; William W. Wadge; Klaus W. Wagner (Topological and Game-Theoretic Aspects of Infinite Computations, 2008)

Complexity of Topological Properties of Regular omega-Languages. - Victor L. Selivanov; Klaus W. Wagner (Developments in Language Theory, 2008)

Editorial. - Andrei S. Morozov; Klaus W. Wagner (Theory Comput. Syst., 2011)

Perfect correspondences between dot-depth and polynomial-time hierarchies. - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (J. Comput. Syst. Sci., 2014)

The Forty Nine Kuratowski Lattices in the Cantor Space. - Ludwig Staiger; Klaus W. Wagner (J. Autom. Lang. Comb., 2024)