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
[2]
Hilfe
Suche: Author="Becchetti, Luca"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Physarum can compute shortest paths: Convergence proofs and complexity bounds
Luca Becchetti
,
Vincenzo Bonifaci
,
Michael Dirnberger
,
Andreas Karrenbauer
,
Kurt Mehlhorn
Lecture Notes in Computer Science
7966
, 2013, pp. 472-483
Competitive analysis of aggregate max in windowed streaming
Luca Becchetti
,
Elias Koutsoupias
Lecture Notes in Computer Science
5555
, 2009, pp. 156-170
Latency constrained aggregation in sensor networks
Luca Becchetti
,
Peter Korteweg
,
Alberto Marchetti-Spaccamela
,
Martin Skutella
,
Leen Stougie
,
Andrea Vitaletti
Lecture Notes in Computer Science
4168
, 2006, pp. 88-99
Semi-clairvoyant scheduling
Luca Becchetti
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Theoretical Computer Science
324
(2-3), 2004, pp. 325-335
Average stretch without migration
Luca Becchetti
,
Stefano Leonardi
,
S. Muthukrishnan
Journal of Computer and System Sciences
68
(1), 2004, pp. 80-95
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Luca Becchetti
,
Stefano Leonardi
Journal of the ACM
51
(4), 2004, pp. 517-539
Modeling locality: A probabilistic analysis of LRU and FWF
Luca Becchetti
Lecture Notes in Computer Science
3221
, 2004, pp. 98-109
Semi-clairvoyant scheduling
Luca Becchetti
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Lecture Notes in Computer Science
2832
, 2003, pp. 67-77
On the design of efficient ATM routing schemes
Luca Becchetti
,
Paola Bertolazzi
,
Carlo Gaibisso
,
Giorgio Gambosi
Theoretical Computer Science
270
(1-2), 2002, pp. 341-359
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Luca Becchetti
,
Mriam di Ianni
,
Alberto Marchetti-Spaccamela
Theoretical Computer Science
287
(2), 2002, pp. 429-448
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
Luca Becchetti
,
Stefano Leonardi
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 94-103
Approximating call-scheduling makespan in all-optical networks
Luca Becchetti
,
Miriam di Ianni
,
Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science
1928
, 2000, pp. 13-22
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Luca Becchetti
,
Miriam di Ianni
,
Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science
1738
, 1999, pp. 201-212