Swastik Kopparty
-
Title: Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
Speaker:
Link:
-
Title: Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
Speaker:
Link:
-
Title: Improved List-Decoding and Local List-Decoding Algorithms for Polynomial Codes
Speaker:
Link:
-
Title: A local central limit theorem for triangles in a random graph
Speaker:
Link:
-
Title: List-Decoding Multiplicity Codes
Speaker:
Link:
-
Title: The Correlation of Multiplicative Characters with Polynomials over Finite Fields
Speaker:
Link:
-
Title: Error-Correcting Codes
Speaker:
Link:
-
Title: On The Complexity of Computing Roots and Residuosity Over Finite Fields
Speaker:
Link:
-
Title: High-Rate Codes with Sublinear Time Decoding
Speaker:
Link:
-
Title: STPM - Topics in Randomness and Error-Correcting Codes
Speaker:
Link:
-
Title: CSDM - Affine Dispersers from Subspace Polynomials
Speaker:
Link: