Salil Vadhan: Derandomizing Algorithms Via Spectral Graph Theory

2025 49:56
Synopsis
Abstract: Randomization is a powerful tool for algorithms; it is often easier to design efficient algorithms if we allow the algorithms ...

You Might Also Like

Spectral Graph Theory For Dummies 28:17
Spectral Graph Theory For Dummies
2025
Salil Vadhan 1:06:57
Salil Vadhan
2024
Computational Entropy - Salil Vadhan 57:49
Computational Entropy - Salil Vadhan
2017
Salil Vadhan: Computational Entropy Part 1 49:09
Salil Vadhan: Computational Entropy Part 1
2013
On some fine-grained questions in algorithms and complexity – V. Vassilevska Williams – ICM2018 47:27
On Some Fine-grained Questions In Algorithms And Complexity ...
2019
Pseudorandom Walks in Directed Graphs and the RL vs. L Question [1/3] 59:58
Pseudorandom Walks In Directed Graphs And The Rl Vs. L Quest...
2017
Pseudorandomness 1:10:35
Pseudorandomness
2021
D3.B — Spectral Sparsification via Bounded-Independence Sampling 21:14
D3.b — Spectral Sparsification Via Bounded-independence Sa...
2021
Salil Vadhan: Computational Entropy Part 2 13:04
Salil Vadhan: Computational Entropy Part 2
2013
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs 26:12
Pseudorandom Generators For Unbounded-width Permutation Bran...
2021
Pseudorandomness in Data Structures 1:00:42
Pseudorandomness In Data Structures
2018
Download Options
Choose a download method below. All links open in new tabs.
Service Features Action
Ssvid
MP4 & MP3 • HD Quality • Browser Extension Available
Download
SaveFrom
MP4 & MP3 • HD Quality • Browser Extension Available
Download
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.