Searching for authors named "Till Tantau" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
User’s Guide to the Beamer Class, Version 3.01
- …User’s Guide to the Beamer Class, Version 3.01 http://latex-beamer.sourceforge.net Till Tantau…
- Add To MetaCart
-
Generalizations of the Hartmanis–Immerman–Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets
- … of the Hartmanis–Immerman–Sewelson Theorem and Applications to Infinite Subsets of P-Selective Sets Till Tantau…
- Add To MetaCart
-
User’s Guide to the Beamer Class, Version 2.21
- …User’s Guide to the Beamer Class, Version 2.21 http://latex-beamer.sourceforge.net Till Tantau…
- Add To MetaCart
-
On the Reducibility of Sets Inside NP to Sets with Low Information Content
- … Science University of Rochester Rochester, NY 14627, USA ogihara@(email omitted); Till Tantau y Fakult…
- Cited by 2 (1 self) – Add To MetaCart
-
Computational complexity of perfect-phylogeny-related haplotyping problems
- …@(email omitted); Till Tantau Institut für Theoretische Informatik Universität zu Lübeck D-23538 Lübeck, Germany tantau…
- Cited by 1 (1 self) – Add To MetaCart
-
Perfect path phylogeny haplotyping with missing data is fixed-parameter tractable
- … with Missing Data is Fixed-Parameter Tractable Jens Gramm ⋆ , Till Nierhoff ⋆ , and Till Tantau ⋆ International…
- Cited by 5 (2 self) – Add To MetaCart
-
Haplotyping with missing data via perfect path phylogenies. Discrete Applied Mathematics
- … Till Tantau 1,2,∗ Institut für Theoretische Informatik, Univeristät zu Lübeck, Germany Computational…
- Cited by 3 (3 self) – Add To MetaCart
-
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
- … Elberfeld Ilka Schnoor Till Tantau Institut für Theoretische Informatik Universität zu Lübeck D-23538 Lübeck…
- Add To MetaCart
-
On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model
- … , Tzvika Hartman 2 , Till Nierhoff 3 , Roded Sharan 4 , and Till Tantau 5 1 Wilhelm-Schickard-Institut für…
- Cited by 2 (2 self) – Add To MetaCart
-
Complexity of the Undirected Radius and Diameter Problems for Succinctly Represented Graphs
- …Complexity of the Undirected Radius and Diameter Problems for Succinctly Represented Graphs Till…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
