• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
Harald Räcke, Technische Universität München
–
Break
–
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Jon Kelner (Massachusetts Institute of Technology)
–
Lunch
–
Electrical Flows Primitive and Fast Graph Algorithms
Aleksander Mądry (Massachusetts Institute of Technology)
–
Break
–
Subsampled Power Iteration: A Unified Algorithm for Block Models and Planted CSP's
Santosh Vempala (Georgia Institute of Technology)
–
Reception
–
Coffee and Check-In
–
Sketching as a Tool for Numerical Linear Algebra
David Woodruff (Carnegie Mellon University)
–
Break
–
The Sketching Complexity of Graph Cuts
Alex Andoni (Columbia University)
–
Lunch
–
L_p Row Sampling by Lewis Weights
Richard Peng, Massachusetts Institute of Technology
–
Break
–
You can be a World Champion!
Sivan Toledo, Tel-Aviv University
–
Empirical Complexity of Laplacian Solvers: A Discussion
John Gilbert (UC Santa Barbara)
–
Coffee and Check-In
–
Gaussian Free Fields and Computing the Cover Time
David Woodruff (Carnegie Mellon University), James Lee (University of Washington)
–
Break
–
Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities
Yuval Peres, Microsoft Research Redmond
–
Lunch
–
Faster Spectral Algorithms via Approximation Theory
Nisheeth Vishnoi (Yale University)
–
Break
–
Generalized Cheeger Inequalities and Constrained Clustering
Ioannis Koutis (University of Puerto Rico)
–
Coffee and Check-In
–
Solving $1$-Laplacians of Convex Simplicial Complexes
Gary Miller (Carnegie Mellon University)
–
Break
–
First-Order Optimization and Online Learning Techniques in the Design of Fast Spectral Algorithms
Lorenzo Orecchia (Boston University)
–
Lunch
–
A Faster Algorithm for Linear Programming and the Maximum Flow Problem I
Yin Tat Lee (University of Washington)
–
Break
–
A Faster Algorithm for Linear Programming and the Maximum Flow Problem II
Aaron Sidford (Stanford University)
–
Coffee and Check-In
–
Fast Flow Algorithms via Cut-Approximators
Jonah Sherman, UC Berkeley
–
Break
–
Cut-Approximators, Approximating Undirected Max Flows, and Recursion
Richard Peng, Massachusetts Institute of Technology