Swastik Kopparty

  1. Title:
    Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound

    Speaker:

    Link:

  2. Title:
    Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

    Speaker:

    Link:

  3. Title:
    Improved List-Decoding and Local List-Decoding Algorithms for Polynomial Codes

    Speaker:

    Link:

  4. Title:
    A local central limit theorem for triangles in a random graph

    Speaker:

    Link:

  5. Title:
    List-Decoding Multiplicity Codes

    Speaker:

    Link:

  6. Title:
    The Correlation of Multiplicative Characters with Polynomials over Finite Fields

    Speaker:

    Link:

  7. Title:
    Error-Correcting Codes

    Speaker:

    Link:

  8. Title:
    On The Complexity of Computing Roots and Residuosity Over Finite Fields

    Speaker:

    Link:

  9. Title:
    High-Rate Codes with Sublinear Time Decoding

    Speaker:

    Link:

  10. Title:
    STPM - Topics in Randomness and Error-Correcting Codes

    Speaker:

    Link:

  11. Title:
    CSDM - Affine Dispersers from Subspace Polynomials

    Speaker:

    Link: