| 2008 |
|---|
| 31 | EE | Jens Gramm,
Arfst Nickelsen,
Till Tantau:
Fixed-Parameter Algorithms in Phylogenetics.
Comput. J. 51(1): 79-101 (2008) |
| 2007 |
|---|
| 30 | EE | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Till Tantau,
Osamu Watanabe:
On the Complexity of Kings.
FCT 2007: 328-340 |
| 29 | EE | Andreas Jakoby,
Till Tantau:
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.
FSTTCS 2007: 216-227 |
| 28 | EE | Bodo Manthey,
Till Tantau:
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.
Probabilistic Methods in the Design and Analysis of Algorithms 2007 |
| 27 | EE | Jens Gramm,
Till Nierhoff,
Roded Sharan,
Till Tantau:
Haplotyping with missing data via perfect path phylogenies.
Discrete Applied Mathematics 155(6-7): 788-805 (2007) |
| 26 | EE | Till Tantau:
Logspace Optimization Problems and Their Approximability Properties.
Theory Comput. Syst. 41(2): 327-350 (2007) |
| 2006 |
|---|
| 25 | EE | Andreas Jakoby,
Till Tantau:
Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space.
Complexity of Boolean Functions 2006 |
| 24 | EE | Richard M. Karp,
Till Nierhoff,
Till Tantau:
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities .
Essays in Memory of Shimon Even 2006: 111-128 |
| 23 | EE | Jens Gramm,
Tzvika Hartman,
Till Nierhoff,
Roded Sharan,
Till Tantau:
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model.
WABI 2006: 92-102 |
| 2005 |
|---|
| 22 | EE | Till Tantau:
Logspace Optimization Problems and Their Approximability Properties.
FCT 2005: 103-114 |
| 21 | EE | Lane A. Hemaspaandra,
Proshanto Mukherji,
Till Tantau:
Context-free languages can be accepted with absolutely no space overhead.
Inf. Comput. 203(2): 163-180 (2005) |
| 20 | EE | Arfst Nickelsen,
Till Tantau:
The Complexity of Finding Paths in Graphs with Bounded Independence Number.
SIAM J. Comput. 34(5): 1176-1195 (2005) |
| 2004 |
|---|
| 19 | EE | Jens Gramm,
Till Nierhoff,
Till Tantau:
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable.
IWPEC 2004: 174-186 |
| 18 | EE | Till Tantau:
A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.
STACS 2004: 326-337 |
| 17 | EE | Lane A. Hemaspaandra,
Proshanto Mukherji,
Till Tantau:
Overhead-Free Computation, DCFLs, and CFLs
CoRR cs.CC/0410035: (2004) |
| 16 | EE | Arfst Nickelsen,
Till Tantau,
Lorenz Weizsäcker:
Aggregates with Component Size One Characterize Polynomial Space
Electronic Colloquium on Computational Complexity (ECCC)(028): (2004) |
| 15 | EE | Mitsunori Ogihara,
Till Tantau:
On the reducibility of sets inside NP to sets with low information content.
J. Comput. Syst. Sci. 69(4): 499-524 (2004) |
| 14 | EE | Till Tantau:
Comparing Verboseness for Finite Automata and Turing Machines.
Theory Comput. Syst. 37(1): 95-109 (2004) |
| 2003 |
|---|
| 13 | EE | Lane A. Hemaspaandra,
Proshanto Mukherji,
Till Tantau:
Computation with Absolutely No Space Overhead.
Developments in Language Theory 2003: 325-336 |
| 12 | EE | Till Tantau:
Weak Cardinality Theorems for First-Order Logic.
FCT 2003: 400-411 |
| 11 | EE | Till Tantau:
Weak Cardinality Theorems for First-Order Logic
Electronic Colloquium on Computational Complexity (ECCC) 10(024): (2003) |
| 10 | EE | Till Tantau:
Logspace Optimisation Problems and their Approximation Properties
Electronic Colloquium on Computational Complexity (ECCC)(077): (2003) |
| 9 | EE | Till Tantau:
Query complexity of membership comparable sets.
Theor. Comput. Sci. 302(1-3): 467-474 (2003) |
| 2002 |
|---|
| 8 | EE | Arfst Nickelsen,
Till Tantau:
On Reachability in Graphs with Bounded Independence Number.
COCOON 2002: 554-563 |
| 7 | EE | Till Tantau:
Towards a Cardinality Theorem for Finite Automata.
MFCS 2002: 625-636 |
| 6 | EE | Till Tantau:
Comparing Verboseness for Finite Automata and Turing Machines.
STACS 2002: 465-476 |
| 5 | EE | Till Tantau:
A Note on the Power of Extra Queries to Membership Comparable Sets
Electronic Colloquium on Computational Complexity (ECCC)(004): (2002) |
| 2001 |
|---|
| 4 | EE | Arfst Nickelsen,
Till Tantau:
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.
FCT 2001: 299-310 |
| 3 | EE | Till Tantau:
A Note on the Complexity of the Reachability Problem for Tournaments
Electronic Colloquium on Computational Complexity (ECCC)(092): (2001) |
| 2000 |
|---|
| 2 | EE | Till Tantau:
On the Power of Extra Queries to Selective Languages
Electronic Colloquium on Computational Complexity (ECCC) 7(77): (2000) |
| 1999 |
|---|
| 1 | | Klaus Didrich,
Wolfgang Grieskamp,
Florian Schintke,
Till Tantau,
Baltasar Trancón-y-Widemann:
Reflections in Opal - Meta Information in a Functional Programming Language.
IFL 1999: 149-164 |
