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="Ferragina, Paolo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bicriteria data compression: Efficient and usable
Andrea Farruggia
,
Paolo Ferragina
,
Rossano Venturini
Lecture Notes in Computer Science
8737
, 2014, pp. 406-417
On the bit-complexity of Lempel-Ziv compression
Paolo Ferragina
,
Igor Nitto
,
Rossano Venturini
SIAM Journal on Computing
42
(4), 2013, pp. 1521-1541
Distribution-aware compressed full-text indexes
Paolo Ferragina
,
Jouni Sirén
,
Rossano Venturini
Algorithmica
67
(4), 2013, pp. 529-546
Compressed cache-oblivious string B-tree
Paolo Ferragina
,
Rossano Venturini
Lecture Notes in Computer Science
8125
, 2013, pp. 469-480
On the weak prefix-search problem
Paolo Ferragina
Theoretical Computer Science
483
, 2013, pp. 75-84
Preemptive coordination mechanisms for unrelated machines
Fidaa Abed
,
Chien-Chung Huang
Lecture Notes in Computer Science
7501
, 2012, pp. 12-23
Hierarchical hub labelings for shortest paths
Ittai Abraham
,
Daniel Delling
,
Andrew V. Goldberg
,
Renato F.Werneck
Lecture Notes in Computer Science
7501
, 2012, pp. 24-35
Bottleneck non-crossing matching in the plane
A. Karim Abu-Affash
,
Paz Carmi
,
Matthew J. Katz
,
Yohai Trabelsi
Lecture Notes in Computer Science
7501
, 2012, pp. 36-47
Lower bounds for sorted geometric queries in the I/O model
Peyman Afshani
,
Norbert Zeh
Lecture Notes in Computer Science
7501
, 2012, pp. 48-59
Constructing street networks from GPS trajectories
Mahmuda Ahmed
,
Carola Wenk
Lecture Notes in Computer Science
7501
, 2012, pp. 60-71
I/O-efficient hierarchical diameter approximation
Deepak Ajwani
,
Ulrich Meyer
,
David Veith
Lecture Notes in Computer Science
7501
, 2012, pp. 72-83
On the value of job migration in online makespan minimization
Susanne Albers
,
Matthias Hellwig
Lecture Notes in Computer Science
7501
, 2012, pp. 84-95
Simplifying massive contour maps
Lars Arge
,
Lasse Deleuran
,
Thomas Mlhave
,
Morten Revsbæk
,
Jakob Truelsen
Lecture Notes in Computer Science
7501
, 2012, pp. 96-107
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Martin Aumüller
,
Martin Dietzfelbinger
,
Philipp Woelfel
Lecture Notes in Computer Science
7501
, 2012, pp. 108-120
On online labeling with polynomially many labels
Martin Babka
,
Jan Bulánek
,
Vladimír C̑unát
,
Michal Koucký
,
Michael Saks
Lecture Notes in Computer Science
7501
, 2012, pp. 121-132
A 5-approximation for capacitated facility location
Manisha Bansal
,
Naveen Garg
,
Neelima Gupta
Lecture Notes in Computer Science
7501
, 2012, pp. 133-144
Weighted geometric set multi-cover via quasi-uniform sampling
Nikhil Bansal
,
Kirk Pruhs
Lecture Notes in Computer Science
7501
, 2012, pp. 145-156
A bicriteria approximation for the reordering buffer problem
Siddharth Barman
,
Shuchi Chawla
,
Seeun Umboh
Lecture Notes in Computer Science
7501
, 2012, pp. 157-168
Time-dependent route planning with generalized objective functions
Gernot Veit Batz
,
Peter Sanders
Lecture Notes in Computer Science
7501
, 2012, pp. 169-180
New lower and upper bounds for representing sequences
Djamal Belazzougui
,
Gonzalo Navarro
Lecture Notes in Computer Science
7501
, 2012, pp. 181-192
Span programs and quantum algorithms for
st
-connectivity and claw detection
Aleksandrs Belovs
,
Ben W. Reichardt
Lecture Notes in Computer Science
7501
, 2012, pp. 193-204
The simplex tree: An efficient data structure for general simplicial complexes
Jean-Daniel Boissonnat
,
Clément Maria
Lecture Notes in Computer Science
7501
, 2012, pp. 731-742
The stretch factor of
L_1
- and
L_{\infty}
-Delaunay triangulations
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
Lecture Notes in Computer Science
7501
, 2012, pp. 205-216
Two dimensional range minimum queries and Fibonacci lattices
Gerth Stlting Brodal
,
Pooya Davoodi
,
Moshe Lewenstein
,
Rajeev Raman
,
Satti Srinivasa Rao
Lecture Notes in Computer Science
7501
, 2012, pp. 217-228
Locally correct Fréchet matchings
Kevin Buchin
,
Maike Buchin
,
Wouter Meulemans
,
Bettina Speckmann
Lecture Notes in Computer Science
7501
, 2012, pp. 229-240
Seiten 1
2
3
4
5
6
7
>