Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Tantau, Till"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Existential second-order logic over graphs: A complete complexity-theoretic classification
Till Tantau
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 703-715
Graph drawing in Ti
k
Z
Till Tantau
Lecture Notes in Computer Science
7704
, 2013, pp. 517-528
Algorithmic meta theorems for circuit classes of constant and logarithmic depth
Michael Elberfeld
,
Andreas Jakoby
,
Till Tantau
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 66-77
Influence of tree topology restrictions on the complexity of haplotyping with missing data
Michael Elberfeld
,
Ilka Schnoor
,
Till Tantau
Theoretical Computer Science
432
, 2012, pp. 38-51
Phylogeny- and parsimony-based haplotype inference with constraints
Michael Elberfeld
,
Till Tantau
Information and Computation
213
, 2012, pp. 33-47
Phylogeny- and parsimony-based haplotype inference with constraints
Michael Elberfeld
,
Till Tantau
Lecture Notes in Computer Science
6129
, 2010, pp. 177-189
On the complexity of kings
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Till Tantau
,
Osamu Watanabe
Theoretical Computer Science
411
(4-5), 2010, pp. 783-798
Computational complexity of perfect-phylogeny-related haplotyping problems
Michael Elberfeld
,
Till Tantau
Lecture Notes in Computer Science
5162
, 2008, pp. 299-310
Smoothed analysis of binary search trees and quicksort under additive noise
Bodo Manthey
,
Till Tantau
Lecture Notes in Computer Science
5162
, 2008, pp. 467-478
Der One-Time-Pad-Algorithmus: Der einfachste und sicherste Verschlüsselungsalgorithmus
Till Tantau
eXamen.press
, 2008, pp. 149-155
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
Andreas Jakoby
,
Till Tantau
Lecture Notes in Computer Science
4855
, 2007, pp. 216-227
Logspace optimization problems and their approximability properties
Till Tantau
Theory of Computing Systems
41
(2), 2007, pp. 327-350
Context-free languages can be accepted with absolutely no space overhead
Lane A. Hemaspaandra
,
Proshanto Mukherji
,
Till Tantau
Information and Computation
203
(2), 2005, pp. 163-180
The complexity of finding paths in graphs with bounded independence number
Arfst Nickelsen
,
Till Tantau
SIAM Journal on Computing
34
(5), 2005, pp. 1176-1195
On the reducibility of sets inside
NP
to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of Computer and System Sciences
69
(4), 2004, pp. 499-524
A logspace approximation scheme for the shortest path problem for graphs with bounded independence number
Till Tantau
Lecture Notes in Computer Science
2996
, 2004, pp. 326-337
Comparing verboseness for finite automata and Turing machines
Till Tantau
Theory of Computing Systems
37
(1), 2004, pp. 95-109
Query complexity of membership comparable sets
Till Tantau
Theoretical Computer Science
302
(1-3), 2003, pp. 467-474
On reachability in graphs with bounded independence number
Arfst Nickelsen
,
Till Tantau
Lecture Notes in Computer Science
2387
, 2002, pp. 554-563
Comparing verboseness for finite automata and Turing machines
Till Tantau
Lecture Notes in Computer Science
2285
, 2002, pp. 465-476
Towards a cardinality theorem for finite automata
Till Tantau
Lecture Notes in Computer Science
2420
, 2002, pp. 625-636