Stanford Computer Science Theo
Loading...
41
subscribers
3,502
video views
Uploaded videos
1-10 of 31-
Salil Vadhan: Computational Entropy Part 2
StanfordCSTheory
1 views
Talk by Salil Vadhan (Harvard), part of the Rajeev Motwani Distinguished Lecture Series,
From March 8th, 2012 , Stanford, CA, USA
Title: Computational Entropy
Abstract:
...
-
Salil Vadhan: Computational Entropy Part 1
StanfordCSTheory
6 views
Talk by Salil Vadhan (Harvard), part of the Rajeev Motwani Distinguished Lecture Series,
From March 8th, 2012 , Stanford, CA, USA
Title: Computational Entropy
Abstract:
...
-
Daniel Spielman: Part 1 of Spectral Sparsification of Graphs and Approximations of Matrices
StanfordCSTheory
130 views
Rajeev Motwani Distinguished Lecture at Stanford
December 12th 2011
-
Daniel Spielman: Part 2 of Spectral Sparsification of Graphs and Approximations of Matrices
StanfordCSTheory
48 views
Rajeev Motwani Distinguished Lecture at Stanford
December 12th 2011
-
Dan Spielman: Smoothed Analysis of Numerical Algorithms
StanfordCSTheory
185 views
Dan Spielman: Smoothed Analysis of Numerical Algorithms
Smoothed analysis considers the behavior of algorithms assuming that their inputs are subject to slight random pert...
-
Luca Trevisan: Average-case Complexity -- A Survey
StanfordCSTheory
314 views
Luca Trevisan: Average-case Complexity -- A Survey
In this survey talk, we review the many open questions and the few things that are known about the average-case complexi...
-
Anupam Gupta: Solving Optimization Problems Online, with Random Demands
StanfordCSTheory
192 views
Anupam Gupta: Solving Optimization Problems Online, with Random Demands
Consider the online Steiner tree problem: given a metric space, "demand" points arrive online and h...
-
Andrea Montanari: The Set of Solutions of Random XORSAT Formulae
StanfordCSTheory
171 views
Andrea Montanari: The Set of Solutions of Random XORSAT Formulae
The XOR-satisfiability (XORSAT) problem requires finding an assignment of n Boolean variables that satisfi...
-
Avrim Blum: Harnessing implicit assumptions in problem formulations
StanfordCSTheory
110 views
Avrim Blum: Harnessing implicit assumptions in problem formulations: Approximation-stability and proxy objectives
It is often the case in a problem formulation that the ob...
-
Nicole Immorlica: PASS Approximation -- A Framework for Analyzing and Designing Heuristics
StanfordCSTheory
93 views
Nicole Immorlica: PASS Approximation -- A Framework for Analyzing and Designing Heuristics
We introduce a new framework for designing and analyzing algorithms. Our framewo...
Advertisement
About Stanford Computer Science Theo
more
less
Play all(31)