- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 53 |      | Michael Elberfeld, Andreas Jakoby, Till Tantau: Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77 |
| 52 | | Michael Elberfeld, Martin Grohe, Till Tantau: Where First-Order and Monadic Second-Order Logic Coincide CoRR abs/1204.6291: (2012) |
| 51 | | Michael Elberfeld, Till Tantau: Phylogeny- and parsimony-based haplotype inference with constraints. Inf. Comput. 213: 33-47 (2012) |
| 2011 | ||
| 50 | | Till Tantau: The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets. Algorithms Unplugged 2011: 141-146 |
| 49 | | 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) |
| 2010 | ||
| 48 | | Michael Elberfeld, Till Tantau: Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. CPM 2010: 177-189 |
| 47 | | Michael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152 |
| 46 | | Michael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. Electronic Colloquium on Computational Complexity (ECCC) 17: 62 (2010) |
| 45 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010) |
| 2009 | ||
| 44 | | Michael Elberfeld, Ilka Schnoor, Till Tantau: Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210 |
| 43 | | 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) |
| 2008 | ||
| 42 | | Michael Elberfeld, Till Tantau: Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. MFCS 2008: 299-310 |
| 41 | | Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS 2008: 467-478 |
| 40 | | Till Tantau: Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus. Taschenbuch der Algorithmen 2008: 149-155 |
| 39 | | Jens Gramm, Arfst Nickelsen, Till Tantau: Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51(1): 79-101 (2008) |
| 38 | | 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) |
| 2007 | ||
| 37 | | Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340 |
| 36 | | Andreas Jakoby, Till Tantau: Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS 2007: 216-227 |
| 35 | | 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 |
| 34 | | 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) |
| 33 | | Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electronic Colloquium on Computational Complexity (ECCC) 14(039): (2007) |
| 32 | | Till Tantau: Logspace Optimization Problems and Their Approximability Properties. Theory Comput. Syst. 41(2): 327-350 (2007) |
| 2006 | ||
| 31 | | Andreas Jakoby, Till Tantau: Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions 2006 |
| 30 | | 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 |
| 29 | | 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 |
| 28 | | 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) |
| 2005 | ||
| 27 | | Till Tantau: Logspace Optimization Problems and Their Approximability Properties. FCT 2005: 103-114 |
| 26 | | 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) |
| 25 | | 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) |
| 24 | | Till Tantau: Weak cardinality theorems. J. Symb. Log. 70(3): 861-878 (2005) |
| 23 | | Arfst Nickelsen, Till Tantau: The Complexity of Finding Paths in Graphs with Bounded Independence Number. SIAM J. Comput. 34(5): 1176-1195 (2005) |
| 2004 | ||
| 22 | | Jens Gramm, Till Nierhoff, Till Tantau: Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186 |
| 21 | | Till Tantau: A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. STACS 2004: 326-337 |
| 20 | | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Overhead-Free Computation, DCFLs, and CFLs CoRR cs.CC/0410035: (2004) |
| 19 | | Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker: Aggregates with Component Size One Characterize Polynomial Space Electronic Colloquium on Computational Complexity (ECCC)(028): (2004) |
| 18 | | 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) |
| 17 | | Till Tantau: Comparing Verboseness for Finite Automata and Turing Machines. Theory Comput. Syst. 37(1): 95-109 (2004) |
| 2003 | ||
| 16 |  | Till Tantau: On structural similarities of finite automata and Turing machine enumerability classes. Wissenschaft & Technik Verlag 2003: 1-170 |
| 15 | | Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336 |
| 14 | | Till Tantau: Weak Cardinality Theorems for First-Order Logic. FCT 2003: 400-411 |
| 13 | | Till Tantau: Weak Cardinality Theorems for First-Order Logic Electronic Colloquium on Computational Complexity (ECCC) 10(024): (2003) |
| 12 | | Till Tantau: Logspace Optimisation Problems and their Approximation Properties Electronic Colloquium on Computational Complexity (ECCC)(077): (2003) |
| 11 | | Arfst Nickelsen, Till Tantau: Partial information classes. SIGACT News 34(1): 32-46 (2003) |
| 10 | | Till Tantau: Query complexity of membership comparable sets. Theor. Comput. Sci. 302(1-3): 467-474 (2003) |
| 9 | | Till Tantau: On structural similarities of finite automata and turing machine enumerability classes. Berlin Institute of Technology 2003: 1-170 |
| 2002 | ||
| 8 | | Arfst Nickelsen, Till Tantau: On Reachability in Graphs with Bounded Independence Number. COCOON 2002: 554-563 |
| 7 | | Till Tantau: Towards a Cardinality Theorem for Finite Automata. MFCS 2002: 625-636 |
| 6 | | Till Tantau: Comparing Verboseness for Finite Automata and Turing Machines. STACS 2002: 465-476 |
| 5 | | Till Tantau: A Note on the Power of Extra Queries to Membership Comparable Sets Electronic Colloquium on Computational Complexity (ECCC)(004): (2002) |
| 2001 | ||
| 4 | | Arfst Nickelsen, Till Tantau: Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. FCT 2001: 299-310 |
| 3 | | Till Tantau: A Note on the Complexity of the Reachability Problem for Tournaments Electronic Colloquium on Computational Complexity (ECCC)(092): (2001) |
| 2000 | ||
| 2 | | 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 |
| 1 | Klaus Didrich | [1] |
| 2 | Michael Elberfeld | [42] [44] [46] [47] [48] [49] [51] [52] [53] |
| 3 | Jens Gramm | [22] [29] [34] [39] [43] |
| 4 | Wolfgang Grieskamp | [1] |
| 5 | Martin Grohe | [52] |
| 6 | Tzvika Hartman | [29] [43] |
| 7 | Edith Hemaspaandra (Edith Spaan) | [37] [45] |
| 8 | Lane A. Hemaspaandra (Lane A. Hemachandra) | [15] [20] [25] [37] [45] |
| 9 | Andreas Jakoby | [31] [36] [46] [47] [49] [53] |
| 10 | Richard M. Karp | [26] [30] |
| 11 | Bodo Manthey (Bodo Siebert) | [33] [35] [41] |
| 12 | Proshanto Mukherji | [15] [20] [25] |
| 13 | Arfst Nickelsen | [4] [8] [11] [19] [23] [39] |
| 14 | Till Nierhoff | [22] [26] [29] [30] [34] [43] |
| 15 | Mitsunori Ogihara (Mitsunori Ogiwara) | [18] |
| 16 | Florian Schintke | [1] |
| 17 | Ilka Schnoor | [44] |
| 18 | Roded Sharan | [29] [34] [43] |
| 19 | Baltasar Trancón-y-Widemann | [1] |
| 20 | Osamu Watanabe | [37] [45] |
| 21 | Lorenz Weizsäcker | [19] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page