Shubhangi Saraf

  1. Title:
    Factors of sparse polynomials: structural results and some algorithms

    Speaker:

    Link:

  2. Title:
    High rate locally-correctable and locally-testable codes with sub-polynomial query complexity

    Speaker:

    Link:

  3. Title:
    Factors of sparse polynomials: structural results and some algorithms

    Speaker:

    Link:

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

    Speaker:

    Link:

  5. Title:
    On the number of ordinary lines determined by sets in complex space

    Speaker:

    Link:

  6. Title:
    The Chasm at Depth 3

    Speaker:

    Link:

  7. Title:
    Incidence Geometry and Connections to Theoretical Computer Science

    Speaker:

    Link:

  8. Title:
    Tight Lower Bounds for 2-query LCCs Over Finite fields

    Speaker:

    Link:

  9. Title:
    Local Testing and Decoding of Sparse Linear Codes

    Speaker:

    Link:

  10. Title:
    Lower Bounds for Set-Multilinear Branching Programs

    Speaker:

    Link: