Playlist: 19 videos Workshops

Fast Algorithms via Spectral Methods

Dec. 1 – Dec. 5, 2014

This workshop aims to bring together researchers interested in the various mathematical and algorithmic tools that underlie dramatic recent developments in fast algorithms for diagonally dominant linear systems and their...

0:54:56

Computing Cut-Based Hierarchical Decompositions in Almost Linear Time

Harald Räcke, Technische Universität München
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/harald-racke-2014-12-01
Visit talk page
1:8:34

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations

Jon Kelner, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/jon-kelner-2014-12-01
Visit talk page
1:8:48

Electrical Flows Primitive and Fast Graph Algorithms

Aleksander Mądry, École Polytechnique Fédérale de Lausanne
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/aleksander-madry-2014-12-01
Visit talk page
0:57:41

Subsampled Power Iteration: A Unified Algorithm for Block Models and Planted CSP's

Santosh Vempala, Georgia Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/santosh-vempala-2014-12-01
Visit talk page
1:2:44

Sketching as a Tool for Numerical Linear Algebra

David Woodruff, IBM Almaden
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/david-woodruff-2014-12-02
Visit talk page
1:6:4

The Sketching Complexity of Graph Cuts

Alexandr Andoni, Microsoft Research
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/alexandr-andoni-2014-12-02
Visit talk page
1:1:53

L_p Row Sampling by Lewis Weights

Richard Peng, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/richard-peng-2014-12-02
Visit talk page
0:36:32

You can be a World Champion!

Sivan Toledo, Tel Aviv University
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/sivan-toledo-2014-12-02
Visit talk page
0:25:48

Empirical Complexity of Laplacian Solvers: A Discussion

Jon Gilbert, UC Santa Barbara
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/john-gilbert-2014-12-02
Visit talk page
1:1:53

Gaussian Free Fields and Computing the Cover Time

James Lee, University of Washington
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/james-lee-2014-12-03
Visit talk page