Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Johannes Köbler" ( http://dblp.L3S.de/Authors/Johannes_Köbler )

URL (Homepage):  http://www.informatik.hu-berlin.de/~koebler  Author page on DBLP  Author page in RDF  Community of Johannes Köbler in ASPL-2

Publication years (Num. hits)
1987-1993 (17) 1994-1997 (16) 1998-2002 (17) 2003-2008 (15) 2009-2012 (15)
Publication types (Num. hits)
article(39) inproceedings(40) phdthesis(1)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(8) STACS(7) J. Comput. Syst. Sci.(6) Theor. Comput. Sci.(6) FSTTCS(5) Structure in Complexity Theory...(5) ALT(4) ICALP(3) Inf. Comput.(3) ISAAC(3) MFCS(3) SIAM J. Comput.(3) CoRR(2) CSR(2) IEEE Conference on Computation...(2) Int. J. Found. Comput. Sci.(2) More (+10 of total 29)
Authors
Johannes Köbler(80) Vikraman Arvind(25) Jacobo Torán(13) Uwe Schöning(11) Wolfgang Lindner(11) Martin Mundhenk(9) Rainer Schuler(8) Sebastian Kuhnert(7) Oleg Verbitsky(6) Seinosuke Toda(6) Olaf Beyersdorff(5) Bireswar Das(4) Jochen Messner(4) Sebastian Müller(4) Thomas Thierauf(4) Bastian Laubner(3) More (+10 of total 32)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords
Results
Found 80 publication records. Showing 80 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Sebastian Kuhnert, Johannes Köbler, Osamu Watanabe Interval graph representation with given interval and intersection lengths. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Log-Space Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Proof systems that take advice. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky Interval Graphs: Canonical Representations in Logspace. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler Canonizing Hypergraphs under Abelian Group Action. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky Interval Graphs: Canonical Representation in Logspace. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky Interval Graphs: Canonical Representation in Logspace. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Proof Systems that Take Advice. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert The Isomorphism Problem for k-Trees is Complete for Logspace. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Jochen Messner Nondeterministic functions and the existence of optimal proof systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Wolfgang Lindner Parameterized learnability of juntas. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Nondeterministic Instance Complexity and Proof Systems with Advice. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Sebastian Kuhnert The Isomorphism Problem for k-Trees Is Complete for Logspace. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees
1Olaf Beyersdorff, Johannes Köbler, Sebastian Müller Nondeterministic Instance Complexity and Proof Systems with Advice. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Vikraman Arvind, Bireswar Das, Johannes Köbler A Logspace Algorithm for Partial 2-Tree Canonization. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Oleg Verbitsky From Invariants to Canonization in Parallel. Search on Bibsonomy CSR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner A general dimension for query learning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Wolfgang Lindner Parameterized Learnability of k -Juntas and Related Problems. Search on Bibsonomy ALT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Subject Classification Learning theory, computational complexity
1Vikraman Arvind, Bireswar Das, Johannes Köbler The Space Complexity of k -Tree Isomorphism. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner The complexity of learning concept classes with polynomial general dimension. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Oleg Verbitsky From Invariants to Canonization in Parallel Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner Learning Boolean Functions under the Uniform. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2006 DBLP  BibTeX  RDF
1Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler On Hypergraph and Graph Isomorphism with Bounded Color Classes. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Johannes Köbler On Graph Isomorphism for Restricted Graph Classes. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Rainer Schuler Average-case intractability vs. worst-case intractability. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Jochen Messner, Jacobo Torán Optimal proof systems imply complete sets for promise classes. Search on Bibsonomy Inf. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán Completeness results for graph isomorphism. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler New Lowness Results for ZPPNP and Other Complexity Classes. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Jacobo Torán The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner A General Dimension for Approximately Learning Boolean Functions. Search on Bibsonomy ALT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner The Complexity of Learning Concept Classes with Polynomial General Dimension. Search on Bibsonomy ALT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler On pseudorandomness and resource-bounded measure. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner Oracles in Sp2 are Sufficient for Exact Learning. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2000 DBLP  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Jochen Messner Is the Standard Proof System for SAT P-Optimal? Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler Graph Isomorphism is Low for ZPPNP and other Lowness results. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Christoph Karg, Johannes Köbler, Rainer Schuler The Complexity of Generating Test Instances. Search on Bibsonomy Chicago J. Theor. Comput. Sci. The full citation details ... 1999 DBLP  BibTeX  RDF
1Johannes Köbler, Rainer Schuler Average-Case Intractability vs. Worst-Case Intractability Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Johannes Köbler, Osamu Watanabe New Collapse Consequences of NP Having Small Circuits. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Rainer Schuler Average-Case Intractability vs. Worst-Case Intractability. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner On the Resource Bounded Measure of P/poly. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Jochen Messner Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Christoph Karg, Johannes Köbler, Rainer Schuler The Complexity of Generating Test Instances. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Uwe Schöning High Sets for NP. Search on Bibsonomy Advances in Algorithms, Languages, and Complexity The full citation details ... 1997 DBLP  BibTeX  RDF
1Johannes Köbler, Wolfgang Lindner Oracles in Sigmap2 are Sufficient for Exact Learning. Search on Bibsonomy ALT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler On Resource-Bounded Measure and Pseudorandomness. Search on Bibsonomy FSTTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk Monotonous and Randomized Reductions to Sparse Sets. Search on Bibsonomy ITA The full citation details ... 1996 DBLP  BibTeX  RDF
1Johannes Köbler, Seinosuke Toda On the Power of Generalized MOD-Classes. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk Upper Bounds for the Complexity of Sparse and Tally Descriptions. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk On Reductions to Sets that Avoid EXPSPACE. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler If NP has Polynomial-Size Circuits, then MA=AM. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Rainer Schuler On Helping and Interactive Proof Systems. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 1995 DBLP  BibTeX  RDF
1Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán The Power of the Middle Bit of a #P Function. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Osamu Watanabe New Collapse Consequences of NP Having Small Circuits. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Johannes Köbler On the Structure of Low Sets. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1995 DBLP  BibTeX  RDF
1Johannes Köbler Locating P/poly Optimally in the Extended Low Hierarchy. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Thomas Thierauf Complexity-Restricted Advice Functions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Rainer Schuler On Helping and Interactive Proof Systems. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Johannes Köbler Locating P/poly Optimally in the Extended Low Hierarchy. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Seinosuke Toda On the Power of Generalized MOD-Classes. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1993 DBLP  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Jacobo Torán Graph Isomorphism is Low for PP. Search on Bibsonomy Computational Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán Turing Machines with Few Accepting Computations and Low Sets for PP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Vikraman 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. Search on Bibsonomy ICALP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Jacobo Torán Graph Isomorphism is Low for PP. Search on Bibsonomy STACS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Vikraman 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. Search on Bibsonomy Complexity Theory: Current Research The full citation details ... 1992 DBLP  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk Lowness and the Complexity of Sparse and Tally Descriptions. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Frederic Green, Johannes Köbler, Jacobo Torán The Power of the Middle Bit. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1992 DBLP  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Martin Mundhenk On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. Search on Bibsonomy FSTTCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Thomas Thierauf Complexity Classes with Advice. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1990 DBLP  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Jacobo Torán On Counting and Approximation. Search on Bibsonomy Acta Inf. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Johannes Köbler Strukturelle Komplexität von Anzahlproblemen. Search on Bibsonomy 1989   RDF
1Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán Turing Machines with few Accepting Computations and low Sets for PP. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1989 DBLP  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Jacobo Torán On Counting and Approximation. Search on Bibsonomy CAAP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Johannes Köbler, Uwe Schöning, Klaus W. Wagner The Difference and Truth-Table Hierarchies for NP. Search on Bibsonomy ITA The full citation details ... 1987 DBLP  BibTeX  RDF
Displaying result #1 - #80 of 80 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.