Johannes Köbler

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Martin Mundhenk

> Home > Persons > Johannes Köbler

Publications

2000
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/ArvindKMT00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/ArvindKMT00
Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán:
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
1996
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/ita/ArvindKM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/ArvindKM96
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Monotonous and Randomized Reductions to Sparse Sets. RAIRO Theor. Informatics Appl. 30(2): 155-179 (1996)
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/ArvindKM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/ArvindKM96
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory 29(1): 63-94 (1996)
1995
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/ArvindKM95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ArvindKM95
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995)
1993
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/ArvindKM93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/ArvindKM93
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241
1992
[c8]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/ArvindHHKLMOSST92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/ArvindHHKLMOSST92
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. Complexity Theory: Current Research 1992: 1-46
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/ArvindKM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/ArvindKM92
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/ArvindHHKLMOSST92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ArvindHHKLMOSST92
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. ICALP 1992: 162-173
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/ArvindKM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ArvindKM92
Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.