2:01:08
Bounds on roots of polynomials (and applications) - Adam Marcus
1:06:07
Efficient empirical revenue maximization in single... - Yannai Gonczarowski
1:11:37
Mirror symmetry for moduli of flat bundles and non-abelian Hodge theory - Tony Pantev
1:30:51
Noncommutative probability for computer scientists - Adam Marcus
1:11:31
In pursuit of obfuscation - Allison Bishop
1:16:52
A time-space lower bound for a large class of learning problems - Ran Raz
1:05:26
Applications of monotone constraint satisfaction - Robert Robere
1:10:34
Approximate counting and the Lovasz local lemma - Ankur Moitra
2:04:05
Indistinguishability obfuscation from...to jumping pigs - Nir Bitansky
1:03:50
On the cryptographic hardness of finding a Nash equilibrium - Nir Bitansky
59:09
Interactive coding with...communication blowup - Yael Kalai
1:54:59
Structural and computational aspects of Brascamp-Lieb inequalities - Avi Wigderson
1:05:50
New insights on the (non)-hardness of circuit minimization and related problems - Eric Allender
1:48:13
A unified duality-based approach to Bayesian mechanism design - Matt Weinberg
1:53:49
52:40
Nearest neighbor search for general symmetric norms via embeddings... - Ilya Razenshteyn
1:03:48
Strongly Refuting Random CSPs below the spectral threshold - Prasad Raghavendra
1:19:53
Sketching and embedding are equivalent for norms - Alex Andoni
1:13:44
Quantifying tradeoffs between fairness and accuracy in online learning - Aaron Roth
1:57:19
Robust sensitivity - Shachar Lovett
1:01:07
Active learning with "simple" membership queries - Shachar Lovett
2:35:51
The polynomial method and the cap set problem - Jordan Ellenberg
2:02:51
Sum of squares lower bounds for refuting any CSP - Pravesh Kothari
1:03:22
On gradient complexity of measures on the discrete cube - Ronen Eldan
2:02:05
Approximate constraint satisfaction requires sub-exponential size linear programs - Pravesh Kothari
1:06:45
On the number of ordinary lines determined by sets in complex space - Shubhangi Saraf
1:39:21
Combinatorial rigidity of graphs embedded in R2 - Orit Raz
1:08:43
Stochastic block models and probabilistic reductions - Emmanuel Abbe
1:25:56
Theory of accelerated methods - Zeyuan Allen-Zhu
57:29
On the effect of randomness on planted 3-coloring models - Uri Feige
2:01:13
Non-malleable extractors for constant depth circuits, and affine functions - Eshan Chattopadhyay
2:05:38
Settling the complexity of computing approximate two-player Nash equilibria - Nash equilibria
2:18:46
Sum of squares, quantum entanglement, and log rank - David Steurer
1:00:12
On the query complexity of Boolean monotonicity testing - Xi Chen
1:45:45
Real rooted polynomials and multivariate extensions - Adam Marcus
53:23
Brains are better computers than computers - Eyal Wigderson
45:01
Happy Days - Gil Kalai joint with Einat Wigderson
1:46:25
Algebraic geometric codes and their applications - Gil Cohen
1:52:13
Fourier tails for Boolean functions and their applications - Avishay Tal
1:29:55
Reed-Muller codes for random erasures and errors - Amir Shpilka
1:57:28
A characterization of functions with vanishing averages over products of disjoint sets - Hatami
53:20
An average-case depth hierarchy theorem for Boolean - Li-Yang Tan
1:04:39
A local central limit theorem for triangles in a random graph - Swastik Kopparty
1:59:19
The Resolution proof system - Avi Wigderson
1:12:19
Polynomial-time tensor decompositions via sum-of-squares - Tengyu Ma
Proof complexity - an introduction - Avi Wigderson
1:58:34
Fast learning requires good memory - Ran Raz
1:08:25
Graph isomorphism in quasipolynomial time II - László Babai
1:29:57
Graph isomorphism in quasipolynomial time - László Babai
1:29:38
Minkowski sums, mixed faces and combinatorial isoperimetry - Adiparsito
1:07:49
The deterministic communication complexity of approximate fixed point - Weinstein
2:00:09
The singularity of symbolic matrices (Pt.2) - Avi Wigderson
1:01:50
Bipartite perfect matching is in quasi-NC - Fenner
1:39:10
Constant-round interactive-proofs for delegating computations (continued) - Rothblum
1:00:37
Constant-round interactive-proofs for delegating computations - Rothblum
1:45:06
Proof Complexity Lower Bounds from Algebraic Circuit Complexity - Forbes
1:47:57
Anti-concentration: results and applications - Nguyen
1:20:28
Ramanujan Coverings of Graphs - Doron Puder
1:47:15
Rigidity of random Toeplitz matrices with an application to depth three circuits -Tal
1:00:38
Lower bounds on the size of semidefinite programming relaxations - Steurer
2:03:33
General systems of linear forms: equidistribution and true complexity - Pooya Hatami
59:19
Advances on Ramsey numbers - Jacob Fox
1:53:39
Cohomology for computer science - Alex Lubotzky
55:39
Cutting plane method: A faster algorithm for many (combinatorial) optimization problems - Lee
1:49:39
Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs II - Cohen
1:00:51
Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs I - Cohen
1:51:44
Algorithmic proof of the Lovasz Local Lemma via resampling oracles -Vondrak
1:53:35
CSDM - Noga Alon - October 13, 2015
1:02:24
CSDM - Rafael Oliveira - October 12, 2015
1:43:36
CSDM - Chaim Even Zohar - October 6, 2015
58:36
CSDM - Elad Hazan - October 5, 2015
57:45
CSDM - Choongbum Lee - September 28, 2015
1:49:59
CSDM - Eshan Chattopadhyay - September 22, 2015
1:02:41
CSDM - Eshan Chattopadhyay - Septemeber 21, 2015
