PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Köbler, Johannes"

Author of the publication

copydeleteadd this publication to your clipboard
Interval Graphs: Canonical Representations in Logspace.

, , , and . SIAM J. Comput., 40 (5): 1292-1315 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Johannes Knittel University of Stuttgart

Univ. -Prof. Dr. Johannes Steidle University of Stuttgart

Johannes Oswald University of Stuttgart

Dr. -Ing. Johannes Engels University of Stuttgart

Johannes Schorr University of Stuttgart

 

Other publications of authors with the same name

If NP has Polynomial-Size Circuits, then MA=AM., , , and . Theor. Comput. Sci., 137 (2): 279-282 (1995)On the Isomorphism Problem for Helly Circular-Arc Graphs., , and . CoRR, (2014)On Helping and Interactive Proof Systems., , and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 137-145. Springer, (1994)The Space Complexity of k -Tree Isomorphism., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 822-833. Springer, (2007)The Complexity of Learning Concept Classes with Polynomial General Dimension., and . ALT, volume 2533 of Lecture Notes in Computer Science, page 149-163. Springer, (2002)Reductions to Sets of Low Information Content., , , , , , , , , and . ICALP, volume 623 of Lecture Notes in Computer Science, page 162-173. Springer, (1992)Helly Circular-Arc Graph Isomorphism Is in Logspace., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 631-642. Springer, (2013)Approximate Graph Isomorphism., , , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 100-111. Springer, (2012)Average-Case Intractability vs. Worst-Case Intractability., and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 493-502. Springer, (1998)Parameterized Complexity of Small Weight Automorphisms., , , and . STACS, volume 66 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)