The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johannes Köbler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Köbler, Wolfgang Lindner
    A General Dimension for Approximately Learning Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:139-148 [Conf]
  2. Johannes Köbler, Wolfgang Lindner
    The Complexity of Learning Concept Classes with Polynomial General Dimension. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:149-163 [Conf]
  3. Johannes Köbler, Wolfgang Lindner
    Oracles in Sigmap2 are Sufficient for Exact Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:277-290 [Conf]
  4. Johannes Köbler, Uwe Schöning
    High Sets for NP. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:139-156 [Conf]
  5. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:40-51 [Conf]
  6. Johannes Köbler
    On Graph Isomorphism for Restricted Graph Classes. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:241-256 [Conf]
  7. Frederic Green, Johannes Köbler, Jacobo Torán
    The Power of the Middle Bit. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:111-117 [Conf]
  8. Johannes Köbler, Wolfgang Lindner
    On the Resource Bounded Measure of P/poly. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:182-185 [Conf]
  9. Johannes Köbler, Jochen Messner
    Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:132-140 [Conf]
  10. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with few Accepting Computations and low Sets for PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:208-215 [Conf]
  11. Johannes Köbler, Thomas Thierauf
    Complexity Classes with Advice. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:305-315 [Conf]
  12. Johannes Köbler, Seinosuke Toda
    On the Power of Generalized MOD-Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:147-155 [Conf]
  13. Johannes Köbler
    On the Structure of Low Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:246-261 [Conf]
  14. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
  15. Vikraman Arvind, Johannes Köbler
    On Resource-Bounded Measure and Pseudorandomness. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:235-249 [Conf]
  16. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:140-151 [Conf]
  17. Johannes Köbler, Wolfgang Lindner
    On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:336-347 [Conf]
  18. Johannes Köbler, Jochen Messner
    Is the Standard Proof System for SAT P-Optimal? [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:361-372 [Conf]
  19. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:162-173 [Conf]
  20. Johannes Köbler, Osamu Watanabe
    New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:196-207 [Conf]
  21. Vikraman Arvind, Johannes Köbler, Rainer Schuler
    On Helping and Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:137-145 [Conf]
  22. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    Lowness and the Complexity of Sparse and Tally Descriptions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:249-258 [Conf]
  23. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:232-241 [Conf]
  24. Johannes Köbler, Rainer Schuler
    Average-Case Intractability vs. Worst-Case Intractability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:493-502 [Conf]
  25. Vikraman Arvind, Johannes Köbler
    Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:431-442 [Conf]
  26. Vikraman Arvind, Johannes Köbler
    On Hypergraph and Graph Isomorphism with Bounded Color Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:384-395 [Conf]
  27. Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
    Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:314-323 [Conf]
  28. Christoph Karg, Johannes Köbler, Rainer Schuler
    The Complexity of Generating Test Instances. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:375-386 [Conf]
  29. Johannes Köbler
    Locating P/poly Optimally in the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:28-37 [Conf]
  30. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:401-411 [Conf]
  31. Johannes Köbler, Jacobo Torán
    The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:121-132 [Conf]
  32. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:26, n:4, pp:363-379 [Journal]
  33. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:301-330 [Journal]
  34. Christoph Karg, Johannes Köbler, Rainer Schuler
    The Complexity of Generating Test Instances. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  35. Vikraman Arvind, Johannes Köbler
    Graph Isomorphism is Low for ZPPNP and other Lowness results. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:33, pp:- [Journal]
  36. Johannes Köbler, Jochen Messner, Jacobo Torán
    Optimal proof systems imply complete sets for promise classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:71-92 [Journal]
  37. Johannes Köbler, Rainer Schuler
    Average-case intractability vs. worst-case intractability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:1, pp:1-17 [Journal]
  38. Vikraman Arvind, Johannes Köbler, Rainer Schuler
    On Helping and Interactive Proof Systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:137-153 [Journal]
  39. Johannes Köbler, Wolfgang Lindner
    Oracles in Sp2 are Sufficient for Exact Learning. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:4, pp:615-632 [Journal]
  40. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    On Reductions to Sets that Avoid EXPSPACE. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:109-114 [Journal]
  41. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    Monotonous and Randomized Reductions to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:2, pp:155-179 [Journal]
  42. 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]
  43. Vikraman Arvind, Johannes Köbler
    New Lowness Results for ZPPNP and Other Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:257-277 [Journal]
  44. Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
    The Power of the Middle Bit of a #P Function. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:456-467 [Journal]
  45. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
    Completeness results for graph isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:549-566 [Journal]
  46. Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
    Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:783- [Journal]
  47. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with Few Accepting Computations and Low Sets for PP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:272-286 [Journal]
  48. Vikraman Arvind, Johannes Köbler, Martin Mundhenk
    Upper Bounds for the Complexity of Sparse and Tally Descriptions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:1, pp:63-94 [Journal]
  49. Johannes Köbler, Seinosuke Toda
    On the Power of Generalized MOD-Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:1, pp:33-46 [Journal]
  50. Johannes Köbler, Thomas Thierauf
    Complexity-Restricted Advice Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:261-275 [Journal]
  51. Johannes Köbler, Osamu Watanabe
    New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:311-324 [Journal]
  52. Vikraman Arvind, Johannes Köbler
    On pseudorandomness and resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:205-221 [Journal]
  53. Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
    If NP has Polynomial-Size Circuits, then MA=AM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:279-282 [Journal]
  54. Johannes Köbler
    Locating P/poly Optimally in the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:2, pp:263-285 [Journal]
  55. Johannes Köbler, Wolfgang Lindner
    The complexity of learning concept classes with polynomial general dimension. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:49-62 [Journal]
  56. Vikraman Arvind, Johannes Köbler, Wolfgang Lindner
    Parameterized Learnability of k -Juntas and Related Problems. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:120-134 [Conf]
  57. Johannes Köbler, Oleg Verbitsky
    From Invariants to Canonization in Parallel [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  58. José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner
    A general dimension for query learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:924-940 [Journal]

  59. From Invariants to Canonization in Parallel. [Citation Graph (, )][DBLP]


  60. A Logspace Algorithm for Partial 2-Tree Canonization. [Citation Graph (, )][DBLP]


  61. Interval Graphs: Canonical Representation in Logspace. [Citation Graph (, )][DBLP]


  62. The Space Complexity of k -Tree Isomorphism. [Citation Graph (, )][DBLP]


  63. The Isomorphism Problem for k-Trees Is Complete for Logspace. [Citation Graph (, )][DBLP]


  64. Nondeterministic Instance Complexity and Proof Systems with Advice. [Citation Graph (, )][DBLP]


  65. Nondeterministic Instance Complexity and Proof Systems with Advice. [Citation Graph (, )][DBLP]


Search in 1.209secs, Finished in 1.211secs
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