Till Tantau Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Andreas Jakoby, Till Tantau: Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. STACS 2012: 66-77
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Martin Grohe, Till Tantau: Where First-Order and Monadic Second-Order Logic Coincide CoRR abs/1204.6291: (2012)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Till Tantau: Phylogeny- and parsimony-based haplotype inference with constraints. Inf. Comput. 213: 33-47 (2012)
2011
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets. Algorithms Unplugged 2011: 141-146
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Till Tantau: Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. CPM 2010: 177-189
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. FOCS 2010: 143-152
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Andreas Jakoby, Till Tantau: Logspace Versions of the Theorems of Bodlaender and Courcelle. Electronic Colloquium on Computational Complexity (ECCC) 17: 62 (2010)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the complexity of kings. Theor. Comput. Sci. 411(4-5): 783-798 (2010)
2009
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Ilka Schnoor, Till Tantau: Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. TAMC 2009: 201-210
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens 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
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elberfeld, Till Tantau: Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. MFCS 2008: 299-310
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS 2008: 467-478
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus. Taschenbuch der Algorithmen 2008: 149-155
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens Gramm, Arfst Nickelsen, Till Tantau: Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51(1): 79-101 (2008)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill 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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe: On the Complexity of Kings. FCT 2007: 328-340
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Jakoby, Till Tantau: Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. FSTTCS 2007: 216-227
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Probabilistic Methods in the Design and Analysis of Algorithms 2007
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens Gramm, Till Nierhoff, Roded Sharan, Till Tantau: Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics 155(6-7): 788-805 (2007)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electronic Colloquium on Computational Complexity (ECCC) 14(039): (2007)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Logspace Optimization Problems and Their Approximability Properties. Theory Comput. Syst. 41(2): 327-350 (2007)
2006
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Jakoby, Till Tantau: Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Complexity of Boolean Functions 2006
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard M. Karp, Till Nierhoff, Till Tantau: Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Essays in Memory of Shimon Even 2006: 111-128
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill 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
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Logspace Optimization Problems and Their Approximability Properties. FCT 2005: 103-114
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard M. Karp, Till Nierhoff, Till Tantau: Optimal flow distribution among multiple channels with unknown capacities. Electronic Notes in Discrete Mathematics 19: 225-231 (2005)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Context-free languages can be accepted with absolutely no space overhead. Inf. Comput. 203(2): 163-180 (2005)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Weak cardinality theorems. J. Symb. Log. 70(3): 861-878 (2005)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArfst Nickelsen, Till Tantau: The Complexity of Finding Paths in Graphs with Bounded Independence Number. SIAM J. Comput. 34(5): 1176-1195 (2005)
2004
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens Gramm, Till Nierhoff, Till Tantau: Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. IWPEC 2004: 174-186
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. STACS 2004: 326-337
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Overhead-Free Computation, DCFLs, and CFLs CoRR cs.CC/0410035: (2004)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArfst Nickelsen, Till Tantau, Lorenz Weizsäcker: Aggregates with Component Size One Characterize Polynomial Space Electronic Colloquium on Computational Complexity (ECCC)(028): (2004)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMitsunori 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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Comparing Verboseness for Finite Automata and Turing Machines. Theory Comput. Syst. 37(1): 95-109 (2004)
2003
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: On structural similarities of finite automata and Turing machine enumerability classes. Wissenschaft & Technik Verlag 2003: 1-170
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Proshanto Mukherji, Till Tantau: Computation with Absolutely No Space Overhead. Developments in Language Theory 2003: 325-336
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Weak Cardinality Theorems for First-Order Logic. FCT 2003: 400-411
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Weak Cardinality Theorems for First-Order Logic Electronic Colloquium on Computational Complexity (ECCC) 10(024): (2003)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Logspace Optimisation Problems and their Approximation Properties Electronic Colloquium on Computational Complexity (ECCC)(077): (2003)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArfst Nickelsen, Till Tantau: Partial information classes. SIGACT News 34(1): 32-46 (2003)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Query complexity of membership comparable sets. Theor. Comput. Sci. 302(1-3): 467-474 (2003)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: On structural similarities of finite automata and turing machine enumerability classes. Berlin Institute of Technology 2003: 1-170
2002
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArfst Nickelsen, Till Tantau: On Reachability in Graphs with Bounded Independence Number. COCOON 2002: 554-563
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Towards a Cardinality Theorem for Finite Automata. MFCS 2002: 625-636
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: Comparing Verboseness for Finite Automata and Turing Machines. STACS 2002: 465-476
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: A Note on the Power of Extra Queries to Membership Comparable Sets Electronic Colloquium on Computational Complexity (ECCC)(004): (2002)
2001
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArfst Nickelsen, Till Tantau: Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. FCT 2001: 299-310
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: A Note on the Complexity of the Reachability Problem for Tournaments Electronic Colloquium on Computational Complexity (ECCC)(092): (2001)
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTill Tantau: On the Power of Extra Queries to Selective Languages Electronic Colloquium on Computational Complexity (ECCC) 7(77): (2000)
1999
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus 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

Coauthor Index

1Klaus Didrich [1]
2Michael Elberfeld [42] [44] [46] [47] [48] [49] [51] [52] [53]
3Jens Gramm [22] [29] [34] [39] [43]
4Wolfgang Grieskamp [1]
5Martin Grohe [52]
6Tzvika Hartman [29] [43]
7Edith Hemaspaandra (Edith Spaan) [37] [45]
8Lane A. Hemaspaandra (Lane A. Hemachandra) [15] [20] [25] [37] [45]
9Andreas Jakoby [31] [36] [46] [47] [49] [53]
10Richard M. Karp [26] [30]
11Bodo Manthey (Bodo Siebert) [33] [35] [41]
12Proshanto Mukherji [15] [20] [25]
13Arfst Nickelsen [4] [8] [11] [19] [23] [39]
14Till Nierhoff [22] [26] [29] [30] [34] [43]
15Mitsunori Ogihara (Mitsunori Ogiwara) [18]
16Florian Schintke [1]
17Ilka Schnoor [44]
18Roded Sharan [29] [34] [43]
19Baltasar Trancón-y-Widemann [1]
20Osamu Watanabe [37] [45]
21Lorenz Weizsäcker [19]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page