| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Stefano Leonardi Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Kirk Pruhs : Semi-clairvoyant Scheduling. ESA 2003 : 67-77 Luigi Laura , Stefano Leonardi, Stefano Millozzi , Ulrich Meyer , Jop F. Sibeyn : Algorithms and Experiments for the Webgraph. ESA 2003 : 703-714 Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Guido Schäfer , Tjark Vredevel : Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003 : 462-471 Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Guido Schäfer : Scheduling to Minimize Flow Time Metrics. IPDPS 2003 : 223 Monika Rauch Henzinger , Stefano Leonardi: Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66 (3): 567-611 (2003) Klaus Jansen , Stefano Leonardi, Vijay V. Vazirani : Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings Springer 2002 Massimiliano Curcio , Stefano Leonardi, Andrea Vitaletti : An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. ALENEX 2002 : 71-85 Luca Becchetti , Suhas N. Diggavi , Stefano Leonardi, Alberto Marchetti-Spaccamela , S. Muthukrishnan , Thyagarajan Nandagopal , Andrea Vitaletti : Parallel scheduling problems in next generation wireless networks. SPAA 2002 : 238-247 Baruch Awerbuch , Yossi Azar , Stefano Leonardi, Oded Regev : Minimizing the Flow Time Without Migration. SIAM J. Comput. 31 (5): 1370-1382 (2002) Luca Becchetti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Kirk Pruhs : Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001 : 36-47 Luca Becchetti , Stefano Leonardi: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001 : 94-103 Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Algorithms for the On-Line Travelling Salesman. Algorithmica 29 (4): 560-581 (2001) Baruch Awerbuch , Yossi Azar , Amos Fiat , Stefano Leonardi, Adi Rosén : On-Line Competitive Algorithms for Call Admission in Optical Networks. Algorithmica 31 (1): 29-43 (2001) Stefano Leonardi, Alberto Marchetti-Spaccamela , Alessio Presciutti , Adi Rosén : On-line Randomized Call Control Revisited . SIAM J. Comput. 31 (1): 86-112 (2001) Stefano Leonardi, Alberto Marchetti-Spaccamela : Preface. Theor. Comput. Sci. 268 (1): 1 (2001) Giorgio Ausiello , Stefano Leonardi, Alberto Marchetti-Spaccamela : On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000 : 1-16 Stefano Leonardi, Alberto Marchetti-Spaccamela , Andrea Vitaletti : Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. FSTTCS 2000 : 409-420 Luca Becchetti , Stefano Leonardi, S. Muthukrishnan : Scheduling to minimize average stretch without migration. SODA 2000 : 548-557 Susanne Albers , Naveen Garg , Stefano Leonardi: Minimizing stall time in single and parallel disk systems. J. ACM 47 (6): 969-986 (2000) Yair Bartal , Stefano Leonardi, Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie : Multiprocessor Scheduling with Rejection. SIAM J. Discrete Math. 13 (1): 64-78 (2000) Monika Rauch Henzinger , Stefano Leonardi: Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999 : 438-447 Baruch Awerbuch , Yossi Azar , Stefano Leonardi, Oded Regev : Minimizing the Flow Time Without Migration. STOC 1999 : 198-205 Susanne Albers , Stefano Leonardi: On-line Algorithms. ACM Comput. Surv. 31 (3es): 4 (1999) Stefano Leonardi, Alberto Marchetti-Spaccamela : On-Line Resource Management with Application to Routing and Scheduling. Algorithmica 24 (1): 29-49 (1999) Yossi Azar , Yair Bartal , Esteban Feuerstein , Amos Fiat , Stefano Leonardi, Adi Rosén : On Capital Investment. Algorithmica 25 (1): 22-36 (1999) Yair Bartal , Stefano Leonardi: On-Line Routing in All-Optical Networks. Theor. Comput. Sci. 221 (1-2): 19-39 (1999) Stefano Leonardi, Andrea Vitaletti : Randomized Lower Bounds for Online Path Coloring. RANDOM 1998 : 232-247 Stefano Leonardi, Alberto Marchetti-Spaccamela , Alessio Presciutti , Adi Rosén : On-line Randomized Call Control Revisited. SODA 1998 : 323-332 Susanne Albers , Naveen Garg , Stefano Leonardi: Minimizing Stall Time in Single and Parallel Disk Systems. STOC 1998 : 454-462 Esteban Feuerstein , Stefano Leonardi, Alberto Marchetti-Spaccamela , Nicola Santoro : Efficient Token-Based Control in Rings. Inf. Process. Lett. 66 (4): 175-180 (1998) Yair Bartal , Stefano Leonardi: On-Line Routing in All-Optical Networks. ICALP 1997 : 516-526 Stefano Leonardi, Danny Raz : Approximating Total Flow Time on Parallel Machines. STOC 1997 : 110-119 Maurizio A. Bonuccelli , Stefano Leonardi: On scheduling variable length broadcasts in wireless networks. Telecommunication Systems 8 (2-4): 211-227 (1997) Baruch Awerbuch , Yossi Azar , Amos Fiat , Stefano Leonardi, Adi Rosén : On-line Competive Algorithms for Call Admission in Optical Networks. ESA 1996 : 431-444 Yossi Azar , Yair Bartal , Esteban Feuerstein , Amos Fiat , Stefano Leonardi, Adi Rosén : On Capital Investment. ICALP 1996 : 429-441 Stefano Leonardi: On-line Network Routing. Online Algorithms 1996 : 242-267 Esteban Feuerstein , Stefano Leonardi, Alberto Marchetti-Spaccamela , Nicola Santoro : Efficient Token-Based Control in Rings (Abstract). PODC 1996 : 154 Yair Bartal , Stefano Leonardi, Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie : Multiprocessor Scheduling with Rejection. SODA 1996 : 95-103 Yair Bartal , Amos Fiat , Stefano Leonardi: Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. STOC 1996 : 531-540 Paola Alimonti , Stefano Leonardi, Alberto Marchetti-Spaccamela : Average Case Analysis of Fully Dynamic Reachability for Directed Graphs. ITA 30 (4): 305-318 (1996) Bruno Becker , Paolo Giulio Franciosa , Stephan Gschwind , Stefano Leonardi, Thomas Ohler , Peter Widmayer : Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21 (3): 520-541 (1996) Stefano Leonardi, Alberto Marchetti-Spaccamela : On-line Resource Management with Applications to Routing and Scheduling. ICALP 1995 : 303-314 Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Competitive Algorithms for the On-line Traveling Salesman. WADS 1995 : 206-217 Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi, Leen Stougie , Maurizio Talamo : Serving Requests with On-line Routing. SWAT 1994 : 37-48 Paola Alimonti , Stefano Leonardi, Alberto Marchetti-Spaccamela , Xavier Messeguer : Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993 : 87-98 1 [ 17 ] [ 23 ] [ 27 ] 2 [ 1 ] [ 6 ] 3 [ 2 ] [ 3 ] [ 30 ] [ 34 ] 4 [ 12 ] [ 24 ] [ 33 ] [ 37 ] 5 [ 11 ] [ 12 ] [ 21 ] [ 24 ] [ 33 ] [ 37 ] 6 [ 7 ] [ 8 ] [ 11 ] [ 15 ] [ 20 ] [ 21 ] [ 26 ] 7 [ 28 ] [ 35 ] [ 36 ] [ 38 ] [ 42 ] [ 43 ] [ 45 ] 8 [ 5 ] 9 [ 13 ] 10 [ 39 ] 11 [ 38 ] 12 [ 2 ] [ 3 ] [ 9 ] [ 11 ] [ 16 ] [ 21 ] [ 34 ] 13 [ 7 ] [ 11 ] [ 12 ] [ 21 ] [ 33 ] 14 [ 5 ] 15 [ 17 ] [ 27 ] 16 [ 5 ] 17 [ 25 ] [ 41 ] 18 [ 40 ] 19 [ 44 ] 20 [ 1 ] [ 4 ] [ 6 ] [ 8 ] [ 9 ] [ 16 ] [ 18 ] [ 22 ] [ 26 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 36 ] [ 38 ] [ 42 ] [ 43 ] [ 45 ] 21 [ 1 ] 22 [ 44 ] 23 [ 44 ] 24 [ 28 ] [ 38 ] 25 [ 38 ] 26 [ 5 ] 27 [ 18 ] [ 32 ] 28 [ 36 ] [ 45 ] 29 [ 14 ] 30 [ 24 ] [ 37 ] 31 [ 11 ] [ 12 ] [ 18 ] [ 21 ] [ 32 ] [ 33 ] 32 [ 9 ] [ 16 ] 33 [ 42 ] [ 43 ] 34 [ 8 ] [ 26 ] 35 [ 44 ] 36 [ 2 ] [ 3 ] [ 8 ] [ 26 ] [ 34 ] 37 [ 2 ] [ 3 ] [ 34 ] 38 [ 40 ] 39 [ 19 ] [ 29 ] [ 38 ] [ 39 ] 40 [ 43 ] 41 [ 5 ]  ©2004 Association for Computing Machinery |
