The following pages link to Lorenzo Orecchia (Q2414907):
Displaying 18 items.
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Localized techniques for broadcasting in wireless sensor networks (Q2471711) (← links)
- Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (Q2941511) (← links)
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (Q2941512) (← links)
- (Q3549733) (← links)
- Expanders via Local Edge Flips (Q4575596) (← links)
- Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver (Q4575711) (← links)
- The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
- Fair Packing and Covering on a Relative Scale (Q5139838) (← links)
- Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel (Q5363010) (← links)
- (Q5365061) (← links)
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations (Q5383975) (← links)
- Flow-Based Algorithms for Local Graph Clustering (Q5384056) (← links)
- (Q5405192) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (Q5495863) (← links)
