An Optimal Algorithm to Find Champions of Tournament Graphs. - Lorenzo Beretta 001; Franco Maria Nardini; Roberto Trani; Rossano Venturini (SPIRE, 2019)

Online Packing to Minimize Area or Perimeter. - Mikkel Abrahamsen; Lorenzo Beretta 001 (SoCG, 2021)

Locally Uniform Hashing. - Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; Jakob Bæk Tejs Houen; Mikkel Thorup (FOCS, 2023)

Multi-Swap k-Means++. - Lorenzo Beretta 001; Vincent Cohen-Addad; Silvio Lattanzi; Nikos Parotsidis (NeurIPS, 2023)

Online Sorting and Translational Packing of Convex Polygons. - Anders Aamand; Mikkel Abrahamsen; Lorenzo Beretta 001; Linda Kleist (SODA, 2023)

An Optimal Algorithm for Finding Champions in Tournament Graphs. - Lorenzo Beretta 001; Franco Maria Nardini; Roberto Trani; Rossano Venturini (IEEE Trans. Knowl. Data Eng., 2023)

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. - Mikkel Abrahamsen; Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; László Kozma 002 (ESA, 2024)

Sketched Lanczos uncertainty score: a low-memory summary of the Fisher information. - Marco Miani; Lorenzo Beretta 001; Søren Hauberg (NeurIPS, 2024)

Approximate Earth Mover's Distance in Truly-Subquadratic Time. - Lorenzo Beretta 001; Aviad Rubinstein (STOC, 2024)

Better Sum Estimation via Weighted Sampling. - Lorenzo Beretta 001; Jakub Tetek (ACM Trans. Algorithms, 2024)

New Statistical and Computational Results for Learning Junta Distributions. - Lorenzo Beretta 001 (APPROX/RANDOM, 2025)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair. - Lorenzo Beretta 001; Vincent Cohen-Addad; Rajesh Jayaram; Erik Waingarten (CoRR, 2025)