The following pages link to Till Tantau (Q418169):
Displayed 50 items.
- Phylogeny- and parsimony-based haplotype inference with constraints (Q418170) (← links)
- Influence of tree topology restrictions on the complexity of haplotyping with missing data (Q428852) (← links)
- Comparing verboseness for finite automata and Turing machines (Q705065) (← links)
- On the complexity of kings (Q846367) (← links)
- Haplotyping with missing data via perfect path phylogenies (Q876476) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Drawing graphs with TikZ: in the beginning was the path (Q2250001) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Logspace optimization problems and their approximability properties (Q2642909) (← links)
- Graph Drawing in TikZ (Q2842202) (← links)
- Completeness Results for Parameterized Space Classes (Q2867094) (← links)
- (Q2904750) (← links)
- (Q2955035) (← links)
- Offline Drawing of Dynamic Trees: Algorithmics and Document Integration (Q2961550) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q2986803) (← links)
- Smoothed analysis of left-to-right maxima with applications (Q3189072) (← links)
- (Q3304103) (← links)
- (Q3439687) (← links)
- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints (Q3575246) (← links)
- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136) (← links)
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise (Q3599150) (← links)
- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data (Q3630205) (← links)
- (Q4452073) (← links)
- (Q4634387) (← links)
- (Q4708609) (← links)
- (Q4736863) (← links)
- (Q4785453) (← links)
- (Q4808678) (← links)
- On the Space Complexity of Parameterized Problems (Q4899254) (← links)
- Graph Drawing in TikZ (Q4912235) (← links)
- (Q5009475) (← links)
- (Q5090457) (← links)
- Towards Work-Efficient Parallel Parameterized Algorithms (Q5236174) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- STACS 2004 (Q5309711) (← links)
- Parameterized and Exact Computation (Q5311510) (← links)
- The Complexity of Finding Paths in Graphs with Bounded Independence Number (Q5317191) (← links)
- (Q5363777) (← links)
- On the Complexity of Kings (Q5444973) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Fundamentals of Computation Theory (Q5492920) (← links)
- Weak cardinality theorems (Q5718691) (← links)
- Fundamentals of Computation Theory (Q5900815) (← links)