1:29:57
Graph isomorphism in quasipolynomial time - László Babai
Institute for Advanced Study
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
