Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Till Tantau" ( http://dblp.L3S.de/Authors/Till_Tantau )

URL (Homepage):  http://www.tcs.uni-luebeck.de/de/mitarbeiter/tantau/  Author page on DBLP  Author page in RDF  Community of Till Tantau in ASPL-2

Publication years (Num. hits)
1999-2003 (16) 2004-2006 (15) 2007-2010 (17) 2011-2012 (5)
Publication types (Num. hits)
article(27) book(1) incollection(2) inproceedings(22) phdthesis(1)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(11) FCT(4) MFCS(3) STACS(3) CoRR(2) Inf. Comput.(2) Theor. Comput. Sci.(2) Theory Comput. Syst.(2) Algorithms Unplugged(1) COCOON(1) Complexity of Boolean Function...(1) Comput. J.(1) CPM(1) Developments in Language Theor...(1) Discrete Applied Mathematics(1) Discrete Mathematics(1) More (+10 of total 30)
Authors
Till Tantau(53) Michael Elberfeld(9) Andreas Jakoby(6) Arfst Nickelsen(6) Till Nierhoff(6) Jens Gramm(5) Lane A. Hemaspaandra(5) Bodo Manthey(3) Proshanto Mukherji(3) Roded Sharan(3) Edith Hemaspaandra(2) Osamu Watanabe(2) Richard M. Karp(2) Tzvika Hartman(2) Baltasar Trancón-y-Widemann(1) Florian Schintke(1) More (+10 of total 22)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 10 keywords
Results
Found 53 publication records. Showing 53 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Michael Elberfeld, Till Tantau Phylogeny- and parsimony-based haplotype inference with constraints. Search on Bibsonomy Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Martin Grohe, Till Tantau Where First-Order and Monadic Second-Order Logic Coincide Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Michael Elberfeld, Andreas Jakoby, Till Tantau Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Andreas Jakoby, Till Tantau Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Till Tantau The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets. Search on Bibsonomy Algorithms Unplugged The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Andreas Jakoby, Till Tantau Logspace Versions of the Theorems of Bodlaender and Courcelle. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe On the complexity of kings. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Till Tantau Phylogeny- and Parsimony-Based Haplotype Inference with Constraints. Search on Bibsonomy CPM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Andreas Jakoby, Till Tantau Logspace Versions of the Theorems of Bodlaender and Courcelle. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau On the complexity of SNP block partitioning under the perfect phylogeny model. Search on Bibsonomy Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Ilka Schnoor, Till Tantau Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Till Tantau Generalizations of the Hartmanis-Immerman-Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Jens Gramm, Arfst Nickelsen, Till Tantau Fixed-Parameter Algorithms in Phylogenetics. Search on Bibsonomy Comput. J. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Till Tantau Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus. Search on Bibsonomy Taschenbuch der Algorithmen The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Bodo Manthey, Till Tantau Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Michael Elberfeld, Till Tantau Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF circuit classes, computational complexity, bioinformatics, haplotyping, perfect phylogenies
1Bodo Manthey, Till Tantau Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jens Gramm, Till Nierhoff, Roded Sharan, Till Tantau Haplotyping with missing data via perfect path phylogenies. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Bodo Manthey, Till Tantau Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Search on Bibsonomy Probabilistic Methods in the Design and Analysis of Algorithms The full citation details ... 2007 DBLP  BibTeX  RDF
1Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe On the Complexity of Kings. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
1Till Tantau The Descriptive Complexity of the Reachability Problem As a Function of Different Graph Parameters. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Andreas Jakoby, Till Tantau Computing Shortest Paths in Series-Parallel Graphs in Logarithmic Space. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model. Search on Bibsonomy WABI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Richard M. Karp, Till Nierhoff, Till Tantau Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Search on Bibsonomy Essays in Memory of Shimon Even The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Richard M. Karp, Till Nierhoff, Till Tantau Optimal flow distribution among multiple channels with unknown capacities. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau Context-free languages can be accepted with absolutely no space overhead. Search on Bibsonomy Inf. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Till Tantau Weak cardinality theorems. Search on Bibsonomy J. Symb. Log. The full citation details ... 2005 DBLP  BibTeX  RDF
1Arfst Nickelsen, Till Tantau The Complexity of Finding Paths in Graphs with Bounded Independence Number. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker Aggregates with Component Size One Characterize Polynomial Space Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau Overhead-Free Computation, DCFLs, and CFLs Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Till Tantau Comparing Verboseness for Finite Automata and Turing Machines. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Mitsunori Ogihara, Till Tantau On the reducibility of sets inside NP to sets with low information content. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jens Gramm, Till Nierhoff, Till Tantau Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Till Tantau A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Till Tantau On structural similarities of finite automata and turing machine enumerability classes. Search on Bibsonomy 2003   RDF
1Till Tantau Weak Cardinality Theorems for First-Order Logic Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Till Tantau Logspace Optimisation Problems and their Approximation Properties Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Till Tantau Query complexity of membership comparable sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Arfst Nickelsen, Till Tantau Partial information classes. Search on Bibsonomy SIGACT News The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Till Tantau On structural similarities of finite automata and Turing machine enumerability classes. Search on Bibsonomy 2003   RDF
1Till Tantau Weak Cardinality Theorems for First-Order Logic. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau Computation with Absolutely No Space Overhead. Search on Bibsonomy Developments in Language Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF space overhead, space reuse, overhead-free computation, deterministic linear languages, metalinear languages, context-free languages, linear space, context-sensitive languages
1Till Tantau A Note on the Power of Extra Queries to Membership Comparable Sets Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Till Tantau Towards a Cardinality Theorem for Finite Automata. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Till Tantau Comparing Verboseness for Finite Automata and Turing Machines. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Arfst Nickelsen, Till Tantau On Reachability in Graphs with Bounded Independence Number. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Till Tantau A Note on the Complexity of the Reachability Problem for Tournaments Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Arfst Nickelsen, Till Tantau Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information
1Till Tantau On the Power of Extra Queries to Selective Languages Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Klaus Didrich, Wolfgang Grieskamp, Florian Schintke, Till Tantau, Baltasar Trancón-y-Widemann Reflections in Opal - Meta Information in a Functional Programming Language. Search on Bibsonomy IFL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #53 of 53 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.