Birs- 18w5197: Analytic Techniques in Theoretical Computer Science
-
Title: Tutorial - 2-2 Games Conjecture
Speaker:
Link:
-
Title: Small set expansion in Johnson graphs (=slices of hypercube)
Speaker:
Link:
-
Title: Discrete harmonic analysis
Speaker:
Link:
-
Title: Kindler-Safra Theorem on the p-biased hypercube via agreement theorems
Speaker:
Link:
-
Title: (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
Speaker:
Link:
-
Title: Approximability of Matrix Norms
Speaker:
Link:
-
Title: Tutorial - Counting algorithms over matroids
Speaker:
Link:
-
Title: The hardest halfspace
Speaker:
Link:
-
Title: Approximate Degree: A Survey
Speaker:
Link:
-
Title: Approximate degree and quantum query lower bounds via dual polynomials
Speaker:
Link:
-
Title: Tutorial - Quantum PCP
Speaker:
Link:
-
Title: (Quasi)-Efficiently Learning Mixtures of Gaussians at the Statistically Optimal Separation
Speaker:
Link:
-
Title: Superresolution and Extremal Functions
Speaker:
Link:
-
Title: Tutorial - Constant factor approximation to edit distance in truly subquadratic time
Speaker:
Link:
-
Title: Fooling polytopes
Speaker:
Link:
-
Title: Oracle Separation of BQP and the Polynomial Hierarchy
Speaker:
Link:
-
Title: Proof of the GM-MDS conjecture
Speaker:
Link:
-
Title: Constructing tree codes
Speaker:
Link: