| 2008 |
|---|
| 85 | EE | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.
CiE 2008: 533-543 |
| 84 | EE | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages.
Developments in Language Theory 2008: 529-542 |
| 83 | EE | Victor L. Selivanov,
Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages.
Fundam. Inform. 83(1-2): 197-217 (2008) |
| 82 | EE | Sven Kosub,
Klaus W. Wagner:
The boolean hierarchy of NP-partitions.
Inf. Comput. 206(5): 538-568 (2008) |
| 81 | EE | 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): 1173-1187 (2008) |
| 2007 |
|---|
| 80 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets.
STACS 2007: 248-259 |
| 79 | EE | Marios Mavronicolas,
Burkhard Monien,
Klaus W. Wagner:
Weighted Boolean Formula Games.
WINE 2007: 469-481 |
| 78 | EE | Pierre McKenzie,
Klaus W. Wagner:
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers.
Computational Complexity 16(3): 211-244 (2007) |
| 77 | EE | 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): 1264-1300 (2007) |
| 2006 |
|---|
| 76 | EE | Christian Glaßer,
Stephen D. Travers,
Klaus W. Wagner:
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
Developments in Language Theory 2006: 408-419 |
| 75 | EE | Christian Glaßer,
Alan L. Selman,
Stephen D. Travers,
Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets.
Electronic Colloquium on Computational Complexity (ECCC) 13(069): (2006) |
| 2005 |
|---|
| 74 | EE | Lane A. Hemaspaandra,
Christopher M. Homan,
Sven Kosub,
Klaus W. Wagner:
The Complexity of Computing the Size of an Interval
CoRR abs/cs/0502058: (2005) |
| 73 | EE | Christian Glaßer,
Stephen D. Travers,
Klaus W. Wagner:
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
Electronic Colloquium on Computational Complexity (ECCC)(035): (2005) |
| 72 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation problems.
Theor. Comput. Sci. 345(2-3): 260-295 (2005) |
| 71 | EE | Victor L. Selivanov,
Klaus W. Wagner:
A reducibility for the dot-depth hierarchy.
Theor. Comput. Sci. 345(2-3): 448-472 (2005) |
| 2004 |
|---|
| 70 | EE | Klaus W. Wagner:
Leaf Language Classes.
MCU 2004: 60-81 |
| 69 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation Problems.
MFCS 2004: 392-403 |
| 68 | EE | Victor L. Selivanov,
Klaus W. Wagner:
A Reducibility for the Dot-Depth Hierarchy.
MFCS 2004: 783-793 |
| 67 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation Problems
Electronic Colloquium on Computational Complexity (ECCC)(037): (2004) |
| 66 | EE | Pierre McKenzie,
Heribert Vollmer,
Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems.
SIAM J. Comput. 33(6): 1513-1531 (2004) |
| 2003 |
|---|
| 65 | EE | Werner Kuich,
Klaus W. Wagner:
On the Exponentiation of Languages.
FCT 2003: 376-386 |
| 64 | EE | Pierre McKenzie,
Klaus W. Wagner:
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers.
STACS 2003: 571-582 |
| 2001 |
|---|
| 63 | EE | Lane A. Hemaspaandra,
Sven Kosub,
Klaus W. Wagner:
The Complexity of Computing the Size of an Interval.
ICALP 2001: 1040-1051 |
| 62 | EE | Steffen Reith,
Klaus W. Wagner:
On boolean lowness and boolean highness.
Theor. Comput. Sci. 261(2): 305-321 (2001) |
| 2000 |
|---|
| 61 | EE | Pierre McKenzie,
Heribert Vollmer,
Klaus W. Wagner:
Arithmetic Circuits and Polynomial Replacement Systems.
FSTTCS 2000: 164-175 |
| 60 | EE | Sven Kosub,
Klaus W. Wagner:
The Boolean Hierarchy of NP-Partitions.
STACS 2000: 157-168 |
| 59 | EE | Manindra Agrawal,
Eric Allender,
Samir Datta,
Heribert Vollmer,
Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Type.
Chicago J. Theor. Comput. Sci. 2000: (2000) |
| 1998 |
|---|
| 58 | EE | Steffen Reith,
Klaus W. Wagner:
On Boolean Lowness and Boolean Highness.
COCOON 1998: 147-156 |
| 57 | EE | Heinz Schmitz,
Klaus W. Wagner:
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
CoRR cs.CC/9809118: (1998) |
| 56 | EE | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
Probabilistic Type-2 Operators and "Almost"-Classes.
Computational Complexity 7(3): 265-289 (1998) |
| 55 | EE | Manindra Agrawal,
Eric Allender,
Samir Datta,
Heribert Vollmer,
Klaus W. Wagner:
Characterizing Small Depth and Small Space Classes by Operators of Higher Types
Electronic Colloquium on Computational Complexity (ECCC) 5(57): (1998) |
| 54 | EE | Klaus W. Wagner:
A Note on Parallel Queries and the Symmetric-Difference Hierarchy.
Inf. Process. Lett. 66(1): 13-20 (1998) |
| 53 | | Herbert Baier,
Klaus W. Wagner:
The Analytic Polynomial Time Hierarchy.
Math. Log. Q. 44: 529-544 (1998) |
| 52 | EE | Herbert Baier,
Klaus W. Wagner:
Bounding Queries in the Analytic Polynomial-Time Hierarchy.
Theor. Comput. Sci. 207(1): 89-104 (1998) |
| 51 | | K. Cronauer,
Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
The Chain Method to Separate Counting Classes.
Theory Comput. Syst. 31(1): 93-108 (1998) |
| 1997 |
|---|
| 50 | | Heribert Vollmer,
Klaus W. Wagner:
Measure One Results in Computational Complexity Theory.
Advances in Algorithms, Languages, and Complexity 1997: 285-312 |
| 49 | EE | Heribert Vollmer,
Klaus W. Wagner:
On Operators of Higher Types.
IEEE Conference on Computational Complexity 1997: 174-184 |
| 1996 |
|---|
| 48 | | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
On Type-2 Probabilistic Quantifiers.
ICALP 1996: 369-380 |
| 47 | EE | Ronald V. Book,
Heribert Vollmer,
Klaus W. Wagner:
Probabilistic Type-2 Operators and ``Almost''-Classes
Electronic Colloquium on Computational Complexity (ECCC) 3(35): (1996) |
| 46 | | Diana Rooß,
Klaus W. Wagner:
On the Power of DNA-Computing.
Inf. Comput. 131(2): 95-109 (1996) |
| 45 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On Balanced Versus Unbalanced Computation Trees.
Mathematical Systems Theory 29(4): 411-421 (1996) |
| 44 | EE | Heribert Vollmer,
Klaus W. Wagner:
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions.
Theor. Comput. Sci. 163(1&2): 245-258 (1996) |
| 1995 |
|---|
| 43 | | Ulrich Hertrampf,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Number-Theoretic Operations with Respect to Counting.
Structure in Complexity Theory Conference 1995: 299-314 |
| 42 | | Heribert Vollmer,
Klaus W. Wagner:
Complexity Classes of Optimization Functions
Inf. Comput. 120(2): 198-219 (1995) |
| 1994 |
|---|
| 41 | | Patrice Enjalbert,
Ernst W. Mayr,
Klaus W. Wagner:
STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings
Springer 1994 |
| 40 | | Ronald V. Book,
Jack H. Lutz,
Klaus W. Wagner:
An Observation on Probability Versus Randomness with Applications to Complexity Classes.
Mathematical Systems Theory 27(3): 201-209 (1994) |
| 1993 |
|---|
| 39 | | Patrice Enjalbert,
Alain Finkel,
Klaus W. Wagner:
STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings
Springer 1993 |
| 38 | | Klaus W. Wagner:
The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note).
STACS 1993: 2-4 |
| 37 | | Ulrich Hertrampf,
Clemens Lautemann,
Thomas Schwentick,
Heribert Vollmer,
Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
Structure in Complexity Theory Conference 1993: 200-207 |
| 36 | | Heribert Vollmer,
Klaus W. Wagner:
The Complexity of Finding Middle Elements.
Int. J. Found. Comput. Sci. 4(4): 293-307 (1993) |
| 1992 |
|---|
| 35 | | Ronald V. Book,
Jack H. Lutz,
Klaus W. Wagner:
On Complexity Classes and Algorithmically Random Languages (Extended Abstract).
STACS 1992: 319-328 |
| 34 | | 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): 65-79 (1992) |
| 33 | | 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): 63-93 (1992) |
| 32 | | 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 |
|---|
| 31 | | Ulrich Hertrampf,
Klaus W. Wagner:
Interactive Proof Systems: Provers, Rounds, and Error Bounds.
CSL 1990: 261-273 |
| 30 | | Miroslaw Kowaluk,
Klaus W. Wagner:
Vector Language: Simple Description of Hard Instances (Extended Abstract).
MFCS 1990: 378-384 |
| 29 | | Eric Allender,
Klaus W. Wagner:
Counting Hierarchies: Polynomial Time and Constant.
Bulletin of the EATCS 40: 182-194 (1990) |
| 28 | | Klaus W. Wagner:
Bounded Query Classes.
SIAM J. Comput. 19(5): 833-846 (1990) |
| 27 | | Thomas Lengauer,
Klaus W. Wagner:
The Binary Network Flow Problem is Logspace Complete for P.
Theor. Comput. Sci. 75(3): 357-363 (1990) |
| 1989 |
|---|
| 26 | | 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): 95-111 (1989) |
| 1988 |
|---|
| 25 | | Klaus W. Wagner:
On Restricting the Access to an NP-Oracle.
ICALP 1988: 682-696 |
| 24 | | Uwe Schöning,
Klaus W. Wagner:
Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries.
STACS 1988: 91-97 |
| 23 | | 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): 1232-1252 (1988) |
| 1987 |
|---|
| 22 | | Klaus W. Wagner:
Do There Exist Languages With an Arbitrarily Small Amount of Context-Sensitivity.
Computation Theory and Logic 1987: 427-432 |
| 21 | | Thomas Lengauer,
Klaus W. Wagner:
The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems.
STACS 1987: 100-113 |
| 20 | | Johannes Köbler,
Uwe Schöning,
Klaus W. Wagner:
The Difference and Truth-Table Hierarchies for NP.
ITA 21(4): 419-435 (1987) |
| 19 | | Franz-Josef Brandenburg,
Andreas Brandstädt,
Klaus W. Wagner:
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines.
Mathematical Systems Theory 19(4): 277-299 (1987) |
| 18 | | Klaus W. Wagner:
More Complicated Questions About Maxima and Minima, and Some Closures of NP.
Theor. Comput. Sci. 51: 53-80 (1987) |
| 1986 |
|---|
| 17 | | Klaus W. Wagner:
More Complicated Questions About Maxima and Minima, and Some Closures of NP.
ICALP 1986: 434-443 |
| 16 | | Klaus W. Wagner:
The Complexity of Combinatorial Problems with Succinct Input Representation.
Acta Inf. 23(3): 325-356 (1986) |
| 15 | | R. Bodendiek,
Klaus W. Wagner:
A characterization of the minimalbasis of the torus.
Combinatorica 6(3): 245-260 (1986) |
| 14 | | 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): 143-146 (1986) |
| 13 | | Klaus W. Wagner:
Some Observations on the Connection Between Counting an Recursion.
Theor. Comput. Sci. 47(3): 131-147 (1986) |
| 1983 |
|---|
| 12 | | Andreas Brandstädt,
Klaus W. Wagner:
Reversal-Bounded and Visit-Bounded Realtime Computations.
FCT 1983: 26-39 |
| 1979 |
|---|
| 11 | | Klaus W. Wagner:
Bounded Recursion and Complexity Classes.
MFCS 1979: 492-498 |
| 1977 |
|---|
| 10 | | Klaus W. Wagner,
Ludwig Staiger:
Recursive omega-Languages.
FCT 1977: 532-537 |
| 9 | | Klaus W. Wagner,
Gerd Wechsung:
Complexity Hierarchies of Oracles.
MFCS 1977: 543-548 |
| 8 | | Klaus W. Wagner:
Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen.
Elektronische Informationsverarbeitung und Kybernetik 13(9): 473-487 (1977) |
| 1976 |
|---|
| 7 | | Klaus W. Wagner:
Eine Axiomatisierung der Theorie der regulären Folgenmengen.
Elektronische Informationsverarbeitung und Kybernetik 12(7): 337-354 (1976) |
| 1975 |
|---|
| 6 | | Klaus W. Wagner:
A Hierarchy of Regular Sequence Sets.
MFCS 1975: 445-449 |
| 1974 |
|---|
| 5 | | Klaus W. Wagner,
Ludwig Staiger:
Finite Automata Acceptation of Infinite Sequences.
MFCS 1974: 69-72 |
| 4 | | Klaus W. Wagner:
Zellulare Berechenbarkeit von Funktionen über n-dimensionalen Zeichensystemen.
Elektronische Informationsverarbeitung und Kybernetik 10(5/6): 259-269 (1974) |
| 3 | | Ludwig Staiger,
Klaus W. Wagner:
Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen.
Elektronische Informationsverarbeitung und Kybernetik 10(7): 379-392 (1974) |
| 1973 |
|---|
| 2 | | Klaus W. Wagner:
Die Modellierung der Arbeit von Turingmaschinen mit n-dimensionalem Band durch Turingmaschinen mit eindimensionalem Band.
Elektronische Informationsverarbeitung und Kybernetik 9(3): 121-135 (1973) |
| 1 | | Klaus W. Wagner:
Universelle Turingmaschinen mit n-dimensionalem Band.
Elektronische Informationsverarbeitung und Kybernetik 9(7/8): 423-431 (1973) |
