Publications

Found 7 results
Author Title Type [ Year(Desc)]
Filters: Author is Till Tantau  [Clear All Filters]
2004
Tantau, T. (2004).  Comparing Verboseness for Finite Automata and Turing Machines. Theory of Computing Systems. 31(1), 95-109.
Gramm, J., Nierhoff T., Sharan R., & Tantau T. (2004).  On the Complexity of Haplotyping via Perfect Phylogeny. Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes. 35-46.
Tantau, T. (2004).  A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.
Gramm, J., Nierhoff T., & Tantau T. (2004).  Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable. Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004).
Ogihara, M.., & Tantau T. (2004).  On the Reducibility of Sets Inside with Low Information Content.
2005
Karp, R. M., Nierhoff T., & Tantau T. (2005).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
2006
Karp, R. M., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.