default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Orecchia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma:
Top-K ranking with a monotone adversary. COLT 2024: 5123-5162- [c21]Konstantinos Ameranis, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani:
Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning. ICML 2024 - [i24]Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma:
Top-K ranking with a monotone adversary. CoRR abs/2402.07445 (2024) - [i23]Deven Mithal, Lorenzo Orecchia:
Geometry and Duality of Alternating Markov Chains. CoRR abs/2410.12721 (2024) - 2023
- [i22]Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani:
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. CoRR abs/2301.08920 (2023) - [i21]Konstantinos Ameranis, Antares Chen, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani:
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians. CoRR abs/2307.11042 (2023) - 2022
- [c20]Lorenzo Orecchia, Konstantinos Ameranis, Charalampos E. Tsourakakis, Kunal Talwar:
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. ICML 2022: 17071-17093 - 2020
- [j5]Jelena Diakonikolas
, Maryam Fazel, Lorenzo Orecchia:
Fair Packing and Covering on a Relative Scale. SIAM J. Optim. 30(4): 3284-3314 (2020)
2010 – 2019
- 2019
- [j4]Zeyuan Allen-Zhu, Lorenzo Orecchia:
Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence. Math. Program. 175(1-2): 307-353 (2019) - [j3]Jelena Diakonikolas, Lorenzo Orecchia:
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. SIAM J. Optim. 29(1): 660-689 (2019) - [i20]Jelena Diakonikolas, Lorenzo Orecchia:
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View. CoRR abs/1907.00289 (2019) - 2018
- [c19]Michael Cohen, Jelena Diakonikolas, Lorenzo Orecchia:
On Acceleration with Noise-Corrupted Gradients. ICML 2018: 1018-1027 - [c18]Jelena Diakonikolas, Lorenzo Orecchia:
Alternating Randomized Block Coordinate Descent. ICML 2018: 1232-1240 - [c17]Jelena Diakonikolas, Lorenzo Orecchia:
Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. ITCS 2018: 23:1-23:19 - [i19]Michael B. Cohen, Jelena Diakonikolas, Lorenzo Orecchia:
On Acceleration with Noise-Corrupted Gradients. CoRR abs/1805.12591 (2018) - [i18]Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia:
Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms. CoRR abs/1808.02517 (2018) - 2017
- [c16]Cem Aksoylar, Lorenzo Orecchia, Venkatesh Saligrama:
Connected Subgraph Detection with Mirror Descent on SDPs. ICML 2017: 51-59 - [c15]Zeyuan Allen Zhu, Lorenzo Orecchia:
Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent. ITCS 2017: 3:1-3:22 - [i17]Jelena Diakonikolas, Lorenzo Orecchia:
Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method. CoRR abs/1706.04680 (2017) - [i16]Jelena Diakonikolas, Lorenzo Orecchia:
Solving Packing and Covering LPs in Õ(1/ε2) Distributed Iterations with a Single Algorithm and Simpler Analysis. CoRR abs/1710.09002 (2017) - [i15]Jelena Diakonikolas, Lorenzo Orecchia:
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods. CoRR abs/1712.02485 (2017) - 2016
- [c14]Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia:
Expanders via Local Edge Flips. SODA 2016: 259-269 - [c13]Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia:
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. SODA 2016: 1824-1831 - 2015
- [c12]Zeyuan Allen Zhu, Lorenzo Orecchia:
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. SODA 2015: 1439-1456 - [c11]Zeyuan Allen Zhu, Lorenzo Orecchia:
Nearly-Linear Time Positive LP Solver with Faster Convergence Rate. STOC 2015: 229-236 - [c10]Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. STOC 2015: 237-245 - [i14]Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. CoRR abs/1506.04838 (2015) - [i13]Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia:
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. CoRR abs/1507.02259 (2015) - [i12]Zeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia:
Expanders via Local Edge Flips. CoRR abs/1510.07768 (2015) - 2014
- [c9]Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford:
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. SODA 2014: 217-226 - [c8]Lorenzo Orecchia, Zeyuan Allen Zhu:
Flow-Based Algorithms for Local Graph Clustering. SODA 2014: 1267-1286 - [i11]Zeyuan Allen Zhu, Lorenzo Orecchia:
A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent. CoRR abs/1407.1537 (2014) - [i10]Zeyuan Allen Zhu, Lorenzo Orecchia:
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel. CoRR abs/1407.1925 (2014) - [i9]Zeyuan Allen Zhu, Lorenzo Orecchia:
Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$. CoRR abs/1411.1124 (2014) - [i8]Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls. CoRR abs/1412.1001 (2014) - 2013
- [c7]Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu:
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. STOC 2013: 911-920 - [i7]Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu:
A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time. CoRR abs/1301.6628 (2013) - [i6]Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee, Aaron Sidford:
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. CoRR abs/1304.2338 (2013) - [i5]Lorenzo Orecchia, Zeyuan Allen Zhu:
Flow-Based Algorithms for Local Graph Clustering. CoRR abs/1307.2855 (2013) - 2012
- [j2]Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi:
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. 13: 2339-2365 (2012) - [c6]Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi:
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. STOC 2012: 1141-1160 - 2011
- [b1]Lorenzo Orecchia:
Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. University of California, Berkeley, USA, 2011 - [c5]Michael W. Mahoney, Lorenzo Orecchia:
Implementing regularization implicitly via approximate eigenvector computation. ICML 2011: 121-128 - [c4]Lorenzo Orecchia, Nisheeth K. Vishnoi:
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. SODA 2011: 532-545 - [i4]Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi:
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator. CoRR abs/1111.1491 (2011) - 2010
- [i3]Michael W. Mahoney, Lorenzo Orecchia:
Implementing regularization implicitly via approximate eigenvector computation. CoRR abs/1010.0703 (2010) - [i2]Lorenzo Orecchia, Nisheeth K. Vishnoi:
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. CoRR abs/1010.4108 (2010)
2000 – 2009
- 2009
- [c3]Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia:
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA 2009: 197-208 - [i1]Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi:
A Spectral Algorithm for Improving Graph Partitions. CoRR abs/0912.0681 (2009) - 2008
- [c2]Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi:
On partitioning graphs via single commodity flows. STOC 2008: 461-470 - 2007
- [j1]Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007) - 2004
- [c1]Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized techniques for broadcasting in wireless sensor networks. DIALM-POMC 2004: 41-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
