Videos

Start date cannot be after end date.
A Theory of Cryptographic Complexity Thumbnail

A Theory of Cryptographic Complexity

Presenter
  • Manoj M.
March 1, 2010
IAS
Behavioral Experiments in Strategic Networks Thumbnail

Behavioral Experiments in Strategic Networks

Presenter
  • Michael Kearns
March 8, 2010
IAS
Average Sensitivity of Polynomial Threshold Functions Thumbnail

Average Sensitivity of Polynomial Threshold Functions

Presenter
  • Rocco Servedio
February 22, 2010
IAS
Expanders and Communication-Avoiding Algorithms Thumbnail

Expanders and Communication-Avoiding Algorithms

Presenter
  • Oded Schwartz
January 25, 2010
IAS
A New Approach to the Inverse Littlewood-Offord Problem Thumbnail

A New Approach to the Inverse Littlewood-Offord Problem

Presenter
  • Hoi H.
February 1, 2010
IAS
Interpreting Polynomial Structure Analytically Thumbnail

Interpreting Polynomial Structure Analytically

Presenter
  • Julia Wolf
February 8, 2010
IAS
Complexity of Constraint Satisfaction Problems: Exact and Approximate Thumbnail

Complexity of Constraint Satisfaction Problems: Exact and Approximate

Presenter
  • Prasad Raghavendra
February 16, 2010
IAS
The Completeness of the Permanent Thumbnail

The Completeness of the Permanent

Presenter
  • Amir Yehudayoff
October 6, 2009
IAS
Using Local Conductance to Give Improved Algorithms for Unique Games Thumbnail

Using Local Conductance to Give Improved Algorithms for Unique Games

Presenter
  • William Matthews
October 13, 2009
IAS
A Parallel Repetition Theorem for Any Interactive Argument Thumbnail

A Parallel Repetition Theorem for Any Interactive Argument

Presenter
  • Iftach Ilan
December 14, 2009
IAS
Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems Thumbnail

Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems

Presenter
  • Russell Impagliazzo
December 8, 2009
IAS
Arithmetic Progressions in Primes Thumbnail

Arithmetic Progressions in Primes

Presenter
  • Madhur Tulsiani
November 24, 2009
IAS