| 2025 | ICALP | Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. | Antares Chen, Lorenzo Orecchia, Erasmo Tani |
| 2024 | COLT | Top-K ranking with a monotone adversary. | Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma |
| 2024 | ICML | Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning. | Konstantinos Ameranis, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani |
| 2022 | ICML | Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. | Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar |
| 2018 | ICML | On Acceleration with Noise-Corrupted Gradients. | Michael Cohen, Jelena Diakonikolas, Lorenzo Orecchia |
| 2018 | ICML | Alternating Randomized Block Coordinate Descent. | Jelena Diakonikolas, Lorenzo Orecchia |
| 2017 | ICML | Connected Subgraph Detection with Mirror Descent on SDPs. | Cem Aksoylar, Lorenzo Orecchia, Venkatesh Saligrama |
| 2016 | SODA | Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. | Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia |
| 2016 | SODA | Expanders via Local Edge Flips. | Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia |
| 2015 | SODA | Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. | Zeyuan Allen Zhu, Lorenzo Orecchia |
| 2015 | STOC | Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. | Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia |
| 2015 | STOC | Nearly-Linear Time Positive LP Solver with Faster Convergence Rate. | Zeyuan Allen Zhu, Lorenzo Orecchia |
| 2014 | SODA | An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. | Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford |
| 2014 | SODA | Flow-Based Algorithms for Local Graph Clustering. | Lorenzo Orecchia, Zeyuan Allen Zhu |
| 2013 | STOC | A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. | Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu |
| 2012 | STOC | Approximating the exponential, the lanczos method and an ( | Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi |
| 2011 | ICML | Implementing regularization implicitly via approximate eigenvector computation. | Michael W. Mahoney, Lorenzo Orecchia |
| 2011 | SODA | Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. | Lorenzo Orecchia, Nisheeth K. Vishnoi |
| 2008 | STOC | On partitioning graphs via single commodity flows. | Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi |