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="Husfeldt, Thore"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weak parity
Scott Aaronson
,
Andris Ambainis
,
Kaspars Balodis
,
Mohammad Bavarian
Lecture Notes in Computer Science
8572
, 2014, pp. 26-38
Consequences of faster alignment of sequences
Amir Abboud
,
Virginia Vassilevska Williams
,
Oren Weimann
Lecture Notes in Computer Science
8572
, 2014, pp. 39-51
Distance labels with optimal local stretch
Ittai Abraham
,
Shiri Chechik
Lecture Notes in Computer Science
8572
, 2014, pp. 52-63
Time-expanded packings
David Adjiashvili
,
Sandro Bosio
,
Robert Weismantel
,
Rico Zenklusen
Lecture Notes in Computer Science
8572
, 2014, pp. 64-76
Labeling schemes for bounded degree graphs
David Adjiashvili
,
Noy Rotbart
Lecture Notes in Computer Science
8573
, 2014, pp. 375-386
Deterministic rectangle enclosure and offline dominance reporting on the RAM
Peyman Afshani
,
Timothy M. Chan
,
Konstantinos Tsakalidis
Lecture Notes in Computer Science
8572
, 2014, pp. 77-88
The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average
Xavier Allamigeon
,
Pascal Benchimol
,
Stéphane Gaubert
Lecture Notes in Computer Science
8572
, 2014, pp. 89-100
Tighter relations between sensitivity and other complexity measures
Andris Ambainis
,
Mohammad Bavarian
,
Yihan Gao
,
Jieming Mao
,
Xiaoming Sun
,
Song Zuo
Lecture Notes in Computer Science
8572
, 2014, pp. 101-113
On hardness of jumbled indexing
Amihood Amir
,
Timothy M. Chan
,
Moshe Lewenstein
,
Noa Lewenstein
Lecture Notes in Computer Science
8572
, 2014, pp. 114-125
Morphing planar graph drawings optimally
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
,
Vincenzo Roselli
Lecture Notes in Computer Science
8572
, 2014, pp. 126-137
Bounded-angle spanning tree: Modeling networks with angular constraints
Rom Aschner
,
Matthew J. Katz
Lecture Notes in Computer Science
8573
, 2014, pp. 387-398
Distributed computing on core-periphery networks: Axiom-based design
Chen Avin
,
Michael Borokhovich
,
Zvi Lotker
,
David Peleg
Lecture Notes in Computer Science
8573
, 2014, pp. 399-410
Parameterized algorithms to preserve connectivity
Manu Basavaraju
,
Fedor V. Fomin
,
Petr Golovach
,
Pranabendu Misra
,
M.S. Ramanujan
,
Saket Saurabh
Lecture Notes in Computer Science
8572
, 2014, pp. 800-811
Incremental algorithm for maintaining DFS tree for undirected graphs
Surender Baswana
,
Shahbaz Khan
Lecture Notes in Computer Science
8572
, 2014, pp. 138-149
On the role of shared randomness in simultaneous communication
Mohammad Bavarian
,
Dmitry Gavinsky
,
Tsuyoshi Ito
Lecture Notes in Computer Science
8572
, 2014, pp. 150-162
Symmetric groups and quotient complexity of Boolean operations
Jason Bell
,
Janusz Brzozowski
,
Nelma Moreira
,
Rogério Reis
Lecture Notes in Computer Science
8573
, 2014, pp. 1-12
Sampling-based proofs of almost-periodicity results and algorithmic applications
Eli Ben-Sasson
,
Noga Ron-Zewi
,
Madhur Tulsiani
,
Julia Wolf
Lecture Notes in Computer Science
8572
, 2014, pp. 955-966
Short PCPs with projection queries
Eli Ben-Sasson
,
Emanuele Viola
Lecture Notes in Computer Science
8572
, 2014, pp. 163-173
Coordination mechanisms for selfish routing over time on a tree
Sayan Bhattacharya
,
Janardhan Kulkarni
,
Vahab Mirrokni
Lecture Notes in Computer Science
8572
, 2014, pp. 186-197
On area-optimal planar graph drawings
Therese Biedl
Lecture Notes in Computer Science
8572
, 2014, pp. 198-210
Shortest two disjoint paths in polynomial time
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
8572
, 2014, pp. 211-222
Listing triangles
Andreas Björklund
,
Rasmus Pagh
,
Virginia Vassilevska Williams
,
Uri Zwick
Lecture Notes in Computer Science
8572
, 2014, pp. 223-234
On DNF approximators for monotone Boolean functions
Eric Blais
,
Johan Håstad
,
Rocco A. Servedio
,
Li-Yang Tan
Lecture Notes in Computer Science
8572
, 2014, pp. 235-246
Handling infinitely branching WSTS
Michael Blondin
,
Alain Finkel
,
Pierre McKenzie
Lecture Notes in Computer Science
8573
, 2014, pp. 13-25
On the decidability of MSO+U on infinite trees
Mikoƚaj Bojańczyk
,
Tomasz Gogacz
,
Henryk Michalewski
,
Michaƚ Skrzypczak
Lecture Notes in Computer Science
8573
, 2014, pp. 50-61
Seiten 1
2
3
4
5
6
7
>