PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Orecchia, Lorenzo"

Author of the publication

copydeleteadd this publication to your clipboard
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow.

, , and . SEA, volume 5526 of Lecture Notes in Computer Science, page 197-208. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. -Ing. Lorenzo Zanon University of Stuttgart

Lorenzo Tesi University of Stuttgart

Martina De Lorenzo University of Stuttgart

 

Other publications of authors with the same name

Flow-Based Algorithms for Local Graph Clustering., and . SODA, page 1267-1286. SIAM, (2014)A Novel, Simple Interpretation of Nesterov's Accelerated Method as a Combination of Gradient and Mirror Descent., and . CoRR, (2014)Solving Packing and Covering LPs in Õ(1/ε2) Distributed Iterations with a Single Algorithm and Simpler Analysis., and . CoRR, (2017)Alternating Randomized Block Coordinate Descent., and . ICML, volume 80 of Proceedings of Machine Learning Research, page 1232-1240. PMLR, (2018)Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel., and . CoRR, (2014)Width-Independence Beyond Linear Objectives: Distributed Fair Packing and Covering Algorithms., , and . CoRR, (2018)A Spectral Algorithm for Improving Graph Partitions, , and . CoRR, (2009)Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$., and . CoRR, (2014)Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method., and . ITCS, volume 94 of LIPIcs, page 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations., , , and . SODA, page 217-226. SIAM, (2014)