Swastik Kopparty

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 64

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

SODA

Theory Comput.

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Swastik Kopparty, Aditya Potukuchi, Harry Sha
Error-Correcting Graph Codes. CoRR (2024)
Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch
Character sums over AG codes. Electron. Colloquium Comput. Complex. (2024)
Kiran S. Kedlaya, Swastik Kopparty
On the Degree of Polynomials Computing Square Roots Mod p. CCC (2024)
Swastik Kopparty, Vishvajeet N
Extracting Mergers and Projections of Partitions. APPROX/RANDOM (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52 (3) (2023)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
) over all Finite Fields. SODA (2023)
Kiran Kedlaya, Swastik Kopparty
On the degree of polynomials computing square roots mod p. CoRR (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. (2023)
Kiran Kedlaya, Swastik Kopparty
On the degree of polynomials computing square roots mod p. Electron. Colloquium Comput. Complex. (2023)
Swastik Kopparty, Vishvajeet N
Extracting Mergers and Projections of Partitions. Electron. Colloquium Comput. Complex. (2023)
Swastik Kopparty, Vishvajeet N
Extracting Mergers and Projections of Partitions. CoRR (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR (2023)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. J. ACM 70 (5) (2023)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). IACR Cryptol. ePrint Arch. 2022 (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Electron. Colloquium Comput. Complex. 28 (2021)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67 (1) (2021)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. CoRR (2021)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS (2020)
Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
Geometric rank of tensors and subrank of matrix multiplication. CoRR (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM (2020)
Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
Geometric Rank of Tensors and Subrank of Matrix Multiplication. Electron. Colloquium Comput. Complex. 27 (2020)
Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
Geometric Rank of Tensors and Subrank of Matrix Multiplication. Computational Complexity Conference (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2020 (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. FOCS (2020)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling outside the box improves soundness. CoRR (2019)
Irit Dinur, Or Meir, Swastik Kopparty
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). SIAM J. Comput. 48 (2) (2019)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. 26 (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. 26 (2019)
Ronen Shaltiel, Swastik Kopparty, Jad Silbak
Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. 26 (2019)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. 2019 (2019)
Jad Silbak, Swastik Kopparty, Ronen Shaltiel
Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM (2019)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64 (8) (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR (2018)
Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. 25 (2018)
Swastik Kopparty, Srikanth Srinivasan
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. 14 (1) (2018)
Swastik Kopparty, Aditya Potukuchi
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. SODA (2018)
Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
Worst-Case to Average Case Reductions for the Distance to a Code. Computational Complexity Conference (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS (2018)
Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
Near-optimal approximation algorithm for simultaneous Max-Cut. CoRR (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. 25 (2018)
Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
Near-optimal approximation algorithm for simultaneous Max-Cut. SODA (2018)
Simao Herdade, John Kim, Swastik Kopparty
A Cauchy-Davenport Theorem for Linear Maps. Comb. 38 (3) (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. 25 (2018)
Swastik Kopparty, Shubhangi Saraf
Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex. 24 (2017)
Swastik Kopparty, Aditya Potukuchi
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. CoRR (2017)
John Y. Kim, Swastik Kopparty
Decoding Reed-Muller Codes over Product Sets. Theory Comput. 13 (1) (2017)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM 64 (2) (2017)
Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin
Maximally Recoverable Codes for Grid-like Topologies. SODA (2017)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA (2017)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC (2016)
Alan Guo, Swastik Kopparty
List-Decoding Algorithms for Lifted Codes. IEEE Trans. Inf. Theory 62 (5) (2016)
Justin Gilmer, Swastik Kopparty
A local central limit theorem for triangles in a random graph. Random Struct. Algorithms 48 (4) (2016)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM 63 (4) (2016)
Venkatesan Guruswami, Swastik Kopparty
Explicit subspace designs. Comb. 36 (2) (2016)
John Y. Kim, Swastik Kopparty
Decoding Reed-Muller Codes Over Product Sets. Computational Complexity Conference (2016)
Swastik Kopparty, Shubhangi Saraf
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. SIGACT News 47 (3) (2016)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. 23 (2016)
Ross Berkowitz, Swastik Kopparty
Robust positioning patterns. SODA (2016)
Swastik Kopparty, Mrinal Kumar, Michael E. Saks
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. 12 (1) (2016)
John Y. Kim, Swastik Kopparty
Decoding Reed-Muller codes over product sets. CoRR (2015)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Swastik Kopparty
List-Decoding Multiplicity Codes. Theory Comput. 11 (2015)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR (2015)
Swastik Kopparty, Mrinal Kumar, Michael E. Saks
Efficient indexing of necklaces and irreducible polynomials over finite fields. CoRR (2015)
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
Simultaneous Approximation of Constraint Satisfaction Problems. ICALP (1) (2015)
Swastik Kopparty, Mrinal Kumar, Michael E. Saks
Efficient indexing of necklaces and irreducible polynomials over finite fields. Electron. Colloquium Comput. Complex. 22 (2015)
Swastik Kopparty
Some remarks on multiplicity codes. CoRR (2015)
Amey Bhangale, Swastik Kopparty
The complexity of computing the minimum rank of a sign pattern matrix. CoRR (2015)
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. 24 (2) (2015)
Swastik Kopparty, Mrinal Kumar, Michael E. Saks
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. ICALP (1) (2014)
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Computational Complexity Conference (2014)
Alan Guo, Swastik Kopparty
List-decoding algorithms for lifted codes. CoRR (2014)
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
Simultaneous Approximation of Constraint Satisfaction Problems. CoRR (2014)
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. 21 (2014)
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
High-rate codes with sublinear-time decoding. J. ACM 61 (5) (2014)
Swastik Kopparty, Qiang Wang
Roots and coefficients of polynomials over finite fields. Finite Fields Their Appl. 29 (2014)
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
Simultaneous Approximation of Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. 21 (2014)
Phokion G. Kolaitis, Swastik Kopparty
Random graphs and the parity quantifier. J. ACM 60 (5) (2013)
Swastik Kopparty
Some remarks on multiplicity codes. Discrete Geometry and Algebraic Combinatorics (2013)
Alan Guo, Swastik Kopparty, Madhu Sudan
New affine-invariant codes from lifting. ITCS (2013)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS (2013)
Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC (2013)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. 20 (2013)
Swastik Kopparty, Shubhangi Saraf
Local List-Decoding and Testing of Random Linear Codes from High Error. SIAM J. Comput. 42 (3) (2013)
Venkatesan Guruswami, Swastik Kopparty
Explicit Subspace Designs. Electron. Colloquium Comput. Complex. 20 (2013)
Venkatesan Guruswami, Swastik Kopparty
Explicit Subspace Designs. FOCS (2013)
Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. SIAM J. Comput. 42 (6) (2013)
Swastik Kopparty
List-Decoding Multiplicity Codes. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Swastik Kopparty
Affine Dispersers from Subspace Polynomials. SIAM J. Comput. 41 (4) (2012)
Swastik Kopparty, Srikanth Srinivasan
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ circuits, with applications. Electron. Colloquium Comput. Complex. 19 (2012)
Swastik Kopparty, Srikanth Srinivasan
Certifying polynomials for AC^0(parity) circuits, with applications. FSTTCS (2012)
Alan Guo, Swastik Kopparty, Madhu Sudan
New affine-invariant codes from lifting. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. 19 (2012)
Swastik Kopparty
Review of algebraic function fields and codes by Henning Stichtenoth. SIGACT News 42 (2) (2011)

Swastik Kopparty.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Swastik Kopparty