Shubhangi Saraf
-
Title: Factors of sparse polynomials: structural results and some algorithms
Speaker:
Link:
-
Title: High rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Speaker:
Link:
-
Title: Factors of sparse polynomials: structural results and some algorithms
Speaker:
Link:
-
Title: Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
Speaker:
Link:
-
Title: On the number of ordinary lines determined by sets in complex space
Speaker:
Link:
-
Title: The Chasm at Depth 3
Speaker:
Link:
-
Title: Incidence Geometry and Connections to Theoretical Computer Science
Speaker:
Link:
-
Title: Tight Lower Bounds for 2-query LCCs Over Finite fields
Speaker:
Link:
-
Title: Local Testing and Decoding of Sparse Linear Codes
Speaker:
Link:
-
Title: Lower Bounds for Set-Multilinear Branching Programs
Speaker:
Link: