| 2025 | WADS | On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms. | Lorenzo De Stefani, Vedant Gupta |
| 2022 | SPAA | Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. | Lorenzo De Stefani |
| 2019 | DSAA | VizCertify: A Framework for Secure Visual Data Exploration. | Lorenzo De Stefani, Leonhard F. Spiegelberg, Eli Upfal, Tim Kraska |
| 2019 | DSAA | A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis. | Lorenzo De Stefani, Eli Upfal |
| 2019 | ISAAC | The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. | Lorenzo De Stefani |
| 2019 | SODA | The I/O complexity of Toom-Cook integer multiplication. | Gianfranco Bilardi, Lorenzo De Stefani |
| 2017 | CIDR | Toward Sustainable Insights, or Why Polygamy is Bad for You. | Carsten Binnig, Lorenzo De Stefani, Tim Kraska, Eli Upfal, Emanuel Zgraggen, Zheguang Zhao |
| 2017 | SIGMOD | Controlling False Discoveries During Interactive Data Exploration. | Zheguang Zhao, Lorenzo De Stefani, Emanuel Zgraggen, Carsten Binnig, Eli Upfal, Tim Kraska |
| 2017 | SIGMOD | Safe Visual Data Exploration. | Zheguang Zhao, Emanuel Zgraggen, Lorenzo De Stefani, Carsten Binnig, Eli Upfal, Tim Kraska |
| 2017 | WADS | The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. | Gianfranco Bilardi, Lorenzo De Stefani |
| 2016 | AAAI | Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic. | Lorenzo De Stefani, Alessandro Epasto, Eli Upfal, Fabio Vandin |
| 2016 | KDD | TRIST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size. | Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, Eli Upfal |