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: Series=LNCS AND Volume=6942
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Preprocess, set, query!
Ely Porat
,
Liam Roditty
Lecture Notes in Computer Science
6942
, 2011, pp. 603-614
Cuckoo hashing with pages
Martin Dietzfelbinger
,
Michael Mitzenmacher
,
Michael Rink
Lecture Notes in Computer Science
6942
, 2011, pp. 615-627
Approximation algorithms and hardness results for the joint replenishment problem with constant demands
Andreas S. Schulz
,
Claudio Telha
Lecture Notes in Computer Science
6942
, 2011, pp. 628-639
Approximation algorithms for conflict-free vehicle routing
Kaspar Schüpbach
,
Rico Zenklusen
Lecture Notes in Computer Science
6942
, 2011, pp. 640-651
A
\frac{3}{2}
approximation for a constrained forest problem
Basile Couëtoux
Lecture Notes in Computer Science
6942
, 2011, pp. 652-663
External-memory network analysis algorithms for naturally sparse graphs
Michael T. Goodrich
,
Paweƚ Pszona
Lecture Notes in Computer Science
6942
, 2011, pp. 664-676
Approximate counting of cycles in streams
Madhusudan Manjunath
,
Kurt Mehlhorn
,
Konstantinos Panagiotou
,
He Sun
Lecture Notes in Computer Science
6942
, 2011, pp. 677-688
Algorithms for solving Rubik's Cubes
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Anna Lubiw
,
Andrew Winslow
Lecture Notes in Computer Science
6942
, 2011, pp. 689-700
Boundary patrolling by mobile agents with distinct maximal speeds
Jurek Czyzowicz
,
Leszek Ga̧sieniec
,
Adrian Kosowski
,
Evangelos Kranakis
Lecture Notes in Computer Science
6942
, 2011, pp. 701-712
Optimal discovery strategies in white space networks
Yossi Azar
,
Ori Gurel-Gurevich
,
Eyal Lubetzky
,
Thomas Moscibroda
Lecture Notes in Computer Science
6942
, 2011, pp. 713-722
Social-aware forwarding improves routing performance in pocket switched networks
Josep Díaz
,
Alberto Marchetti-Spaccamela
,
Dieter Mitsche
,
Paolo Santi
,
Julinda Stefa
Lecture Notes in Computer Science
6942
, 2011, pp. 723-735
Tolerant algorithms
Rolf Klein
,
Rainer Penninger
,
Christian Sohler
,
David P. Woodruff
Lecture Notes in Computer Science
6942
, 2011, pp. 736-747
Alphabet-independent compressed text indexing
Djamal Belazzougui
,
Gonzalo Navarro
Lecture Notes in Computer Science
6942
, 2011, pp. 748-759
Distribution-aware compressed full-text indexes
Paolo Ferragina
,
Jouni Sirén
,
Rossano Venturini
Lecture Notes in Computer Science
6942
, 2011, pp. 760-771
Smoothed performance guarantees for local search
Tobias Brunsch
,
Heiko Röglin
,
Cyriel Rutten
,
Tjark Vredeveld
Lecture Notes in Computer Science
6942
, 2011, pp. 772-783
Improved approximations for
k
-exchange systems
Moran Feldman
,
Joseph (Seffi) Naor
,
Roy Schwartz
,
Justin Ward
Lecture Notes in Computer Science
6942
, 2011, pp. 784-798
Cover-decomposition and polychromatic numbers
Béla Bollobás
,
David Pritchard
,
Thomas Rothvoß
,
Alex Scott
Lecture Notes in Computer Science
6942
, 2011, pp. 799-810
Seiten
<
1
2
3