The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Klaus W. Wagner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. Complexity of Aperiodicity for Topological Properties of Regular omega-Languages. [Citation Graph (, )][DBLP]


  76. Complexity of Topological Properties of Regular omega-Languages. [Citation Graph (, )][DBLP]


  77. Weighted Boolean Formula Games. [Citation Graph (, )][DBLP]


  78. The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. [Citation Graph (, )][DBLP]


  79. The Complexity of Unions of Disjoint Sets. [Citation Graph (, )][DBLP]


Search in 1.049secs, Finished in 1.052secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002