The Sketching Complexity of Graph Cuts

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=PzSteuCzC_8


Duration: 1:06:04
589 views
2

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



Other Videos By Simons Institute for the Theory of Computing


2014-12-08Faster Spectral Algorithms via Approximation Theory
2014-12-08Electrical Flows Primitive and Fast Graph Algorithms
2014-12-08A Faster Algorithm for Linear Programming and the Maximum Flow Problem II
2014-12-08L_p Row Sampling by Lewis Weights
2014-12-08Gaussian Free Fields and Computing the Cover Time
2014-12-08Sketching as a Tool for Numerical Linear Algebra
2014-12-08An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicom...
2014-12-08Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities
2014-12-08Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
2014-12-08Solving $1$-Laplacians of Convex Simplicial Complexes
2014-12-08The Sketching Complexity of Graph Cuts
2014-12-08Generalized Cheeger Inequalities and Constrained Clustering
2014-12-08Empirical Complexity of Laplacian Solvers: A Discussion
2014-12-08You can be a World Champion!
2014-12-08A Faster Algorithm for Linear Programming and the Maximum Flow Problem I
2014-12-08Subsampled Power Iteration: A Unified Algorithm for Block Models and Planted CSP's
2014-12-08Cut-Approximators, Approximating Undirected Max Flows, and Recursion
2014-12-08Fast Flow Algorithms via Cut-Approximators
2014-12-03Tensors: A Geometric View
2014-11-21Kronecker Coefficients — Computation and Bounds
2014-11-21A Few Computational Tools for Tensor Rank and Tensor Decomposition


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Alexandr Andoni