Lorenzo Orecchia - Selected Recent TalksA User-Friendly Primal-Dual View of First Order Methods Random Walks as a Stable Analogue of Eigenvectors (with Applications to Nearly-Linear-Time Graph Partitioning) Almost-Linear-Time Algorithms for Fundamental Graph Problems: A New Framework and Its Applications A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time Iterative Methods and Regularization in the Design of Fast Algorithms A Nearly-linear-time Spectral Algorithm for Balanced Graph Partitioning |