Additive Combinatorics in Fine-Grained Algorithms and Complexity
ETH Algorithms and Complexity Seminar
Additive Combinatorics in Fine-Grained Algorithms and Complexity
58:19
Open problems about the simplex method
ETH Algorithms and Complexity Seminar
Open problems about the simplex method
57:08
Randomized Algorithms for Linear Systems: Going Beyond Krylov Subspace Methods
ETH Algorithms and Complexity Seminar
Randomized Algorithms for Linear Systems: Going Beyond Krylov Subspace Methods
46:30
Optimal Algorithms for Bounded Weighted Edit Distance
ETH Algorithms and Complexity Seminar
Optimal Algorithms for Bounded Weighted Edit Distance
1:05:52
A simple deterministic near-linear time approximation scheme for transshipment
ETH Algorithms and Complexity Seminar
A simple deterministic near-linear time approximation scheme for transshipment
1:04:20
Fast Algorithms via Dynamic-Oracle Matroids
ETH Algorithms and Complexity Seminar
Fast Algorithms via Dynamic-Oracle Matroids
59:34
Bagging is an Optimal PAC Learner
ETH Algorithms and Complexity Seminar
Bagging is an Optimal PAC Learner
59:24
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
ETH Algorithms and Complexity Seminar
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
1:13:33
Hardness of Approximate Diameter
ETH Algorithms and Complexity Seminar
Hardness of Approximate Diameter
50:30
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
ETH Algorithms and Complexity Seminar
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
53:02
Negative-Weight Single-Source Shortest Paths in Near-linear Time
ETH Algorithms and Complexity Seminar
Negative-Weight Single-Source Shortest Paths in Near-linear Time
1:18:06
Testing thresholds for sparse random geometric graphs
ETH Algorithms and Complexity Seminar
Testing thresholds for sparse random geometric graphs
1:02:48
Matrix anti-concentration inequalities with application in solving sparse linear systems
ETH Algorithms and Complexity Seminar
Matrix anti-concentration inequalities with application in solving sparse linear systems
59:41
Pseudorandomness for Unbounded-Width Branching Programs
ETH Algorithms and Complexity Seminar
Pseudorandomness for Unbounded-Width Branching Programs
57:40
Entropic Independence and Its Applications: Optimal Mixing for Glauber Dynamics on Ising models
ETH Algorithms and Complexity Seminar
Entropic Independence and Its Applications: Optimal Mixing for Glauber Dynamics on Ising models
59:54
The Minimum Isolating Cuts Problem with Applications
ETH Algorithms and Complexity Seminar
The Minimum Isolating Cuts Problem with Applications
58:50
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization
ETH Algorithms and Complexity Seminar
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization
43:55
A Faster Algorithm for Solving General LPs
ETH Algorithms and Complexity Seminar
A Faster Algorithm for Solving General LPs
54:45
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
ETH Algorithms and Complexity Seminar
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
1:04:38
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
ETH Algorithms and Complexity Seminar
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
1:06:43
Minimizing Convex Functions with Integral Minimizers
ETH Algorithms and Complexity Seminar
Minimizing Convex Functions with Integral Minimizers
48:53
k-Forrelation Optimally Separates Quantum and Classical Query Complexity
ETH Algorithms and Complexity Seminar
k-Forrelation Optimally Separates Quantum and Classical Query Complexity
1:17:22
Pseudospectral Shattering, Sign Function, and Diagonalization in Nearly Matrix Multiplication Time
ETH Algorithms and Complexity Seminar
Pseudospectral Shattering, Sign Function, and Diagonalization in Nearly Matrix Multiplication Time
1:06:03
Deterministic Directed Expander Decomposition and Congestion Balancing with Applications
ETH Algorithms and Complexity Seminar
Deterministic Directed Expander Decomposition and Congestion Balancing with Applications
54:07
Discrepancy Minimization via a Self-Balancing Random Walk
ETH Algorithms and Complexity Seminar
Discrepancy Minimization via a Self-Balancing Random Walk
56:07
The Numerics of Solving Sparse Linear Systems Faster than Matrix Multiplication
ETH Algorithms and Complexity Seminar
The Numerics of Solving Sparse Linear Systems Faster than Matrix Multiplication
1:06:11