Lorenzo Orecchia
Orcid: 0000-0001-7558-1397
According to our database1,
Lorenzo Orecchia
authored at least 37 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
CoRR, 2023
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game.
CoRR, 2023
2022
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering.
Proceedings of the International Conference on Machine Learning, 2022
2020
2019
SIAM J. Optim., 2019
Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence.
Math. Program., 2019
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View.
CoRR, 2019
2018
Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms.
CoRR, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2017
Solving Packing and Covering LPs in Õ(1/ε<sup>2</sup>) Distributed Iterations with a Single Algorithm and Simpler Analysis.
CoRR, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$.
CoRR, 2014
A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent.
CoRR, 2014
CoRR, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally.
J. Mach. Learn. Res., 2012
Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.
PhD thesis, 2011
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator
CoRR, 2011
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the 28th International Conference on Machine Learning, 2011
2009
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009
2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
2007
Algorithmica, 2007
2004
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004