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.
Membro di
Awards
Ultime pubblicazioni
| A Data-Driven Approach to Refine Predictions of Differentiated Thyroid Cancer Outcomes: A Prospective Multicenter Study on THE JOURNAL OF CLINICAL ENDOCRINOLOGY AND METABOLISM | 2023 |
| Bilateral Trade: A Regret Minimization Perspective on MATHEMATICS OF OPERATIONS RESEARCH | 2023 |
| Deep active learning for misinformation detection using geometric deep learning on ONLINE SOCIAL NETWORKS AND MEDIA | 2023 |
| Pandora's Box Problem with Order Constraints on MATHEMATICS OF OPERATIONS RESEARCH | 2023 |
| Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria on Proceedings of the 24th {ACM} Conference on Economics and Computation, {EC} 2023, London, United Kingdom, July 9-12, 2023}, pages = {67--87} | 2023 |
| 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 |
| Distortion-Oblivious Algorithms for Minimizing Flow Time on Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022 | 2022 |