( en | de | ru )

 

Disambiguation of "Kopparty, Swastik"

Author of the publication

copydeleteadd this publication to your clipboard
Proximity Gaps for Reed-Solomon Codes.

, , , , and . Electron. Colloquium Comput. Complex., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Swastik Kopparty

 

Other publications of authors with the same name

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields., , , and . SODA, page 700-737. SIAM, (2023)On the degree of polynomials computing square roots mod p., and . CoRR, (2023)Quasilinear time list-decodable codes for space bounded channels., , and . Electron. Colloquium Comput. Complex., (2019)On the Degree of Polynomials Computing Square Roots Mod p., and . CCC, volume 300 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Multilinear Forms: Bias, Correlation, and Tensor Rank., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 29:1-29:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Proximity Gaps for Reed-Solomon Codes., , , , and . FOCS, page 900-909. IEEE, (2020)Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation., , and . Allerton, page 700-707. IEEE, (2009)Character sums over AG codes., , and . Electron. Colloquium Comput. Complex., (2024)On List Recovery of High-Rate Tensor Codes., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 68:1-68:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Error-Correcting Graph Codes., , and . CoRR, (2024)