Birs- 18w5197: Analytic Techniques in Theoretical Computer Science

  1. Title:
    Tutorial - 2-2 Games Conjecture

    Speaker:

    Link:

  2. Title:
    Small set expansion in Johnson graphs (=slices of hypercube)

    Speaker:

    Link:

  3. Title:
    Discrete harmonic analysis

    Speaker:

    Link:

  4. Title:
    Kindler-Safra Theorem on the p-biased hypercube via agreement theorems

    Speaker:

    Link:

  5. Title:
    (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

    Speaker:

    Link:

  6. Title:
    Approximability of Matrix Norms

    Speaker:

    Link:

  7. Title:
    Tutorial - Counting algorithms over matroids

    Speaker:

    Link:

  8. Title:
    The hardest halfspace

    Speaker:

    Link:

  9. Title:
    Approximate Degree: A Survey

    Speaker:

    Link:

  10. Title:
    Approximate degree and quantum query lower bounds via dual polynomials

    Speaker:

    Link:

  11. Title:
    Tutorial - Quantum PCP

    Speaker:

    Link:

  12. Title:
    (Quasi)-Efficiently Learning Mixtures of Gaussians at the Statistically Optimal Separation

    Speaker:

    Link:

  13. Title:
    Superresolution and Extremal Functions

    Speaker:

    Link:

  14. Title:
    Tutorial - Constant factor approximation to edit distance in truly subquadratic time

    Speaker:

    Link:

  15. Title:
    Fooling polytopes

    Speaker:

    Link:

  16. Title:
    Oracle Separation of BQP and the Polynomial Hierarchy

    Speaker:

    Link:

  17. Title:
    Proof of the GM-MDS conjecture

    Speaker:

    Link:

  18. Title:
    Constructing tree codes

    Speaker:

    Link: