Stefano Leonardi
January 2005 - Full Professor, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.
August 2005 - December 2005, Visiting Scholar, Carnegie Mellon University, USA, Aladdin Center, Department of Computer Science.
November 2001 - December 2004, Associate Professor, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.
September 2000 - October 2001, Researcher, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.
May 1997 - October 1997, February 1997 - June 1997, Post-doc in the “Algorithms and Complexity” group at the Max-Planck-Institut fuer Informatik, Saarbreucken, Germany.
January 1996 - September 1996, Post-doc in the Theory Group at the International Computer Science Institute (ICSI), Berkeley, USA.
October 1997 - August 2000, Research fellow, Sapienza University of Rome, Department of Computer and Systems Sciences, Faculty of Enigineering.
Ph.D. Degree in Computer Science, University of Rome “La Sapienza” (Advisor: Prof. Giorgio Ausiello): “On-line Resource Management with Application to Routing and Scheduling”, February 1996.
- Award Committee, EATCS Presburger Award, 2010-2012∞
- Program Chair, 5th Workshop on Internet and network Economics, Rome, December 2009
- Program Chair, 13th Annual European Symposium on Algorithms - ESA 2005, Ibiza, Spain, October 2005.
- Program Chair, 2nd Workshop on Algorithms and Models for the Web-Graph WAW2004, in conjunction with IEEE FOCS04, Roma, October 16, 2004.
- Editorial board, Journal of Interconnection Networks, since 2003.
- Member of Steering Committee, European Symposium on Algorithms, 2004 - 2007.
- Editorial board, ACM Transactions on Algorithms, since 2008.
Membro di
Awards
Ultime pubblicazioni
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness on Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2022 |
| A Regret Analysis of Bilateral Trade on Proceedings of the 22nd {ACM} Conference on Economics and Computation | 2021 |
| Algorithms for fair k-clustering with multiple protected attributes on OPERATIONS RESEARCH LETTERS | 2021 |
| Efficient two-sided markets with limited information on STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2021 |
| Flow time scheduling with uncertain processing time on STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2021 |
| Stochastic bandits for multi-platform budget optimization in online advertising on The Web Conference 2021 - Proceedings of the World Wide Web Conference, WWW 2021 | 2021 |
| Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity on Proceedings of the 38th International Conference on Machine Learning | 2021 |