Till Tantau

Michael Elberfeld, Till Tantau: Phylogeny- and parsimony-based haplotype inference with constraints. Inf. Comput. 213: 33-47 (2012)

Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau: Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms 8(3): 30 (2012)

Michael Elberfeld, Ilka Schnoor, Till Tantau: Influence of tree topology restrictions on the complexity of haplotyping with missing data. Theor. Comput. Sci. 432: 38-51 (2012)

Till Tantau: Graph Drawing in TikZ. Graph Drawing 2012: 517-528

Michael Elberfeld, Christoph Stockhusen, Till Tantau: On the Space Complexity of Parameterized Problems. IPEC 2012: 206-217

Michael Elberfeld, Martin Grohe, Till Tantau: Where First-Order and Monadic Second-Order Logic Coincide. LICS 2012: 265-274

Michael Elberfeld, Andreas Jakoby, Till Tantau: Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77

Michael Elberfeld, Martin Grohe, Till Tantau: Where First-Order and Monadic Second-Order Logic Coincide. CoRR abs/1204.6291 (2012)

Michael Elberfeld, Christoph Stockhusen, Till Tantau: On the Space Complexity of Parameterized Problems. Electronic Colloquium on Computational Complexity (ECCC) 19: 150 (2012)

Till Tantau: The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets. Algorithms Unplugged 2011: 141-146

Michael Elberfeld, Andreas Jakoby, Till Tantau: Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Electronic Colloquium on Computational Complexity (ECCC) 18: 128 (2011)

Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010)

Michael Elberfeld, Till Tantau: Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. CPM 2010: 177-189

Michael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152

Michael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. Electronic Colloquium on Computational Complexity (ECCC) 17: 62 (2010)

Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau: On the complexity of SNP block partitioning under the perfect phylogeny model. Discrete Mathematics 309(18): 5610-5617 (2009)

Michael Elberfeld, Ilka Schnoor, Till Tantau: Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210

Jens Gramm, Arfst Nickelsen, Till Tantau: Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51(1): 79-101 (2008)

Michael Elberfeld, Till Tantau: Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. MFCS 2008: 299-310

Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS 2008: 467-478

Till Tantau: Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus. Taschenbuch der Algorithmen 2008: 149-155

Till Tantau: Generalizations of the Hartmanis-Immerman-Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets. Electronic Colloquium on Computational Complexity (ECCC) 15(027) (2008)

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)

Till Tantau: Logspace Optimization Problems and Their Approximability Properties. Theory Comput. Syst. 41(2): 327-350 (2007)

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

Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340

Andreas Jakoby, Till Tantau: Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS 2007: 216-227

Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electronic Colloquium on Computational Complexity (ECCC) 14(039) (2007)

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

Andreas Jakoby, Till Tantau: Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions 2006

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

Till Tantau: The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters. Electronic Colloquium on Computational Complexity (ECCC) 13(035) (2006)

Richard M. Karp, Till Nierhoff, Till Tantau: Optimal flow distribution among multiple channels with unknown capacities. Electronic Notes in Discrete Mathematics 19: 225-231 (2005)

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)

Till Tantau: Weak cardinality theorems. J. Symb. Log. 70(3): 861-878 (2005)

Arfst Nickelsen, Till Tantau: The Complexity of Finding Paths in Graphs with Bounded Independence Number. SIAM J. Comput. 34(5): 1176-1195 (2005)

Till Tantau: Logspace Optimization Problems and Their Approximability Properties. FCT 2005: 103-114

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)

Till Tantau: Comparing Verboseness for Finite Automata and Turing Machines. Theory Comput. Syst. 37(1): 95-109 (2004)

Jens Gramm, Till Nierhoff, Till Tantau: Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186

Till Tantau: A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. STACS 2004: 326-337

Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Overhead-Free Computation, DCFLs, and CFLs. CoRR cs.CC/0410035 (2004)

Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker: Aggregates with Component Size One Characterize Polynomial Space. Electronic Colloquium on Computational Complexity (ECCC)(028) (2004)

Till Tantau: On structural similarities of finite automata and Turing machine enumerability classes. Wissenschaft & Technik Verlag 2003, isbn 978-3-89685-200-7, pp. 1-170

Till Tantau: On structural similarities of finite automata and turing machine enumerability classes. Berlin Institute of Technology 2003, isbn 3-89685-200-0, pp. 1-170

Arfst Nickelsen, Till Tantau: Partial information classes. SIGACT News 34(1): 32-46 (2003)

Till Tantau: Query complexity of membership comparable sets. Theor. Comput. Sci. 302(1-3): 467-474 (2003)

Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336

Till Tantau: Weak Cardinality Theorems for First-Order Logic. FCT 2003: 400-411

Till Tantau: Weak Cardinality Theorems for First-Order Logic. Electronic Colloquium on Computational Complexity (ECCC) 10(024) (2003)

Till Tantau: Logspace Optimisation Problems and their Approximation Properties. Electronic Colloquium on Computational Complexity (ECCC)(077) (2003)

Arfst Nickelsen, Till Tantau: On Reachability in Graphs with Bounded Independence Number. COCOON 2002: 554-563

Till Tantau: Towards a Cardinality Theorem for Finite Automata. MFCS 2002: 625-636

Till Tantau: Comparing Verboseness for Finite Automata and Turing Machines. STACS 2002: 465-476

Till Tantau: A Note on the Power of Extra Queries to Membership Comparable Sets. Electronic Colloquium on Computational Complexity (ECCC)(004) (2002)

Arfst Nickelsen, Till Tantau: Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. FCT 2001: 299-310

Till Tantau: A Note on the Complexity of the Reachability Problem for Tournaments. Electronic Colloquium on Computational Complexity (ECCC)(092) (2001)

Till Tantau: On the Power of Extra Queries to Selective Languages. Electronic Colloquium on Computational Complexity (ECCC) 7(77) (2000)

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