Localized techniques for broadcasting in wireless sensor networks. - Lorenzo Orecchia; Alessandro Panconesi; Chiara Petrioli; Andrea Vitaletti (DIALM-POMC, 2004)

Localized Techniques for Broadcasting in Wireless Sensor Networks. - Devdatt P. Dubhashi; Olle Häggström; Lorenzo Orecchia; Alessandro Panconesi; Chiara Petrioli; Andrea Vitaletti (Algorithmica, 2007)

On partitioning graphs via single commodity flows. - Lorenzo Orecchia; Leonard J. Schulman; Umesh V. Vazirani; Nisheeth K. Vishnoi (STOC, 2008)

Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. - Kevin J. Lang; Michael W. Mahoney; Lorenzo Orecchia (SEA, 2009)

A Spectral Algorithm for Improving Graph Partitions - Michael W. Mahoney; Lorenzo Orecchia; Nisheeth K. Vishnoi (CoRR, 2009)

Implementing regularization implicitly via approximate eigenvector computation. - Michael W. Mahoney; Lorenzo Orecchia (ICML, 2011)

Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. - Lorenzo Orecchia; Nisheeth K. Vishnoi (SODA, 2011)

Approximating the Exponential, the Lanczos Method and an tilde{O}(m)-Time Spectral Algorithm for Balanced Separator - Lorenzo Orecchia; Sushant Sachdeva; Nisheeth K. Vishnoi (CoRR, 2011)

Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. - Lorenzo Orecchia (2011)

Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. - Lorenzo Orecchia; Sushant Sachdeva; Nisheeth K. Vishnoi (STOC, 2012)

A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. - Michael W. Mahoney; Lorenzo Orecchia; Nisheeth K. Vishnoi (J. Mach. Learn. Res., 2012)

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. - Jonathan A. Kelner; Lorenzo Orecchia; Aaron Sidford; Zeyuan Allen Zhu (STOC, 2013)

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 (SODA, 2014)

Flow-Based Algorithms for Local Graph Clustering. - Lorenzo Orecchia; Zeyuan Allen Zhu (SODA, 2014)

Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls. - Zeyuan Allen Zhu; Zhenyu Liao; Lorenzo Orecchia (CoRR, 2014)

A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent. - Zeyuan Allen Zhu; Lorenzo Orecchia (CoRR, 2014)

Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/ varepsilon^2)$. - Zeyuan Allen Zhu; Lorenzo Orecchia (CoRR, 2014)

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 (SODA, 2015)

Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. - Zeyuan Allen Zhu; Zhenyu Liao; Lorenzo Orecchia (STOC, 2015)

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate. - Zeyuan Allen Zhu; Lorenzo Orecchia (STOC, 2015)

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. - Zeyuan Allen Zhu; Yin Tat Lee; Lorenzo Orecchia (SODA, 2016)

Expanders via Local Edge Flips. - Zeyuan Allen Zhu; Aditya Bhaskara; Silvio Lattanzi; Vahab S. Mirrokni; Lorenzo Orecchia (SODA, 2016)

Connected Subgraph Detection with Mirror Descent on SDPs. - Cem Aksoylar; Lorenzo Orecchia; Venkatesh Saligrama (ICML, 2017)

Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent. - Zeyuan Allen Zhu; Lorenzo Orecchia (ITCS, 2017)

Solving Packing and Covering LPs in Õ(1/ε2) Distributed Iterations with a Single Algorithm and Simpler Analysis. - Jelena Diakonikolas; Lorenzo Orecchia (CoRR, 2017)

On Acceleration with Noise-Corrupted Gradients. - Michael Cohen 001; Jelena Diakonikolas; Lorenzo Orecchia (ICML, 2018)

Alternating Randomized Block Coordinate Descent. - Jelena Diakonikolas; Lorenzo Orecchia (ICML, 2018)

Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. - Jelena Diakonikolas; Lorenzo Orecchia (ITCS, 2018)

Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms. - Jelena Diakonikolas; Maryam Fazel; Lorenzo Orecchia (CoRR, 2018)

Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View. - Jelena Diakonikolas; Lorenzo Orecchia (CoRR, 2019)

Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence. - Zeyuan Allen-Zhu; Lorenzo Orecchia (Math. Program., 2019)

The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. - Jelena Diakonikolas; Lorenzo Orecchia (SIAM J. Optim., 2019)

Fair Packing and Covering on a Relative Scale. - Jelena Diakonikolas; Maryam Fazel; Lorenzo Orecchia (SIAM J. Optim., 2020)

Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. - Lorenzo Orecchia; Konstantinos Ameranis; Charalampos E. Tsourakakis; Kunal Talwar (ICML, 2022)

Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. - Konstantinos Ameranis; Antares Chen; Lorenzo Orecchia; Erasmo Tani (CoRR, 2023)

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians. - Konstantinos Ameranis; Antares Chen; Adela Frances DePavia; Lorenzo Orecchia; Erasmo Tani (CoRR, 2023)

Top-K ranking with a monotone adversary. - Yuepeng Yang; Antares Chen; Lorenzo Orecchia; Cong Ma 001 (COLT, 2024)

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning. - Konstantinos Ameranis; Adela Frances DePavia; Lorenzo Orecchia; Erasmo Tani (ICML, 2024)

Training Binary Neural Networks via Gaussian Variational Inference and Low-Rank Semidefinite Programming. - Lorenzo Orecchia; Jiawei Hu; Xue He; Wang Mark; Xulei Yang; Min Wu 008; Xue Geng (NeurIPS, 2024)

Top-K ranking with a monotone adversary. - Yuepeng Yang; Antares Chen; Lorenzo Orecchia; Cong Ma (CoRR, 2024)

Geometry and Duality of Alternating Markov Chains. - Deven Mithal; Lorenzo Orecchia (CoRR, 2024)

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. - Antares Chen; Lorenzo Orecchia; Erasmo Tani (ICALP, 2025)

Manifold learning and optimization using tangent space proxies. - Ryan A. Robinett; Lorenzo Orecchia; Samantha J. Riesenfeld (CoRR, 2025)