(classification somewhat arbitrary)



L. Becchetti, M. Di Ianni, and A. Marchetti-Spaccamela. Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theoretical Computer Science, 287(2):429--448, 2002. (

L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and K. Pruhs.
Online weighted flow time and deadline scheduling.
To appear in Elsevier Journal of Discrete Algorithms. (

L. Becchetti and S. Leonardi.
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
Journal of the ACM, Volume 51, pp. 517 - 539, 2004. (
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and Kirk Pruhs. Semi-clairvoyant scheduling.
Theoretical Computer Science, accepted for publication, 2004. (
Preliminary version appeared in the Proceedings of the European Symposium on Algorithms, 2003.

L. Becchetti, S. Leonardi, and S. Muthukrishnan. Average stretch without migration.
Journal of Computer and System Sciences, 68:80--95, 2004. (

Wireless Networks

L. Becchetti, F. Delli Priscoli, T. Inzerilli, P. Mahonen, and  L. Munoz.
Enhancing IP service provision over heterogenous wireless networks: A path toward 4G.
IEEE Communications Magazine , 39(8):74--81, 2001. (

L. Becchetti, S. Diggavi, S. Leonardi, A. Marchetti-Spaccamela,   S. Muthukrishnan, T. Nandagopal, and A. Vitaletti. Parallel scheduling problems in next generation wireless networks.
 Elsevier NETWORKS, 45(1): 9-22 2005. (

Probabilistic Analysis

L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schaefer, and  T. Vredeveld. Average case and smoothed competitive analysis of the multi-level feedback algorithm.
Accepted for publication in Mathematics of Operations Research, 2005. (
Preliminary version appeared in Proceedings of the  IEEE Symposium on Foundations of Computer Science, 2003.

L. Becchetti. Modeling locality: A probabilistic analysis of  LRU  and  FWF .
Proceedings of the 12th European Symp. on Algorithms (ESA), 2004. (

Network optimization

L. Becchetti, J. Konemann, S. Leonardi and M. Pal.
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.
Proceedings of the SIAM-ACM Symp. on Discrete Algorithms (SODA), 2005. (
PDF) Final version accepted on ACM Transactions on Algorithms

L. Becchetti, P. Bertolazzi, C. Gaibisso, and G. Gambosi. On the design of efficient ATM routing schemes.
Theoretical Computer Science, 270(1--2):341--359, 2002. (




Go back to the Home Page of Algorithm Engineering.



Go back to the Home Page of Dipartimento di Informatica e Sistemistica.


For problems or comments about this page, please send email to