Swastik Kopparty

Most-cited papers

New affine-invariant codes from lifting
Alan J. X. Guo, Swastik Kopparty, M. Sudan
2012Information Technology Convergence and Services114 citations
Semantic Scholar
List-Decoding Multiplicity Codes
Swastik Kopparty
2012Theory of Computing113 citations Open access
Semantic Scholar
Proximity Gaps for Reed–Solomon Codes
E. Ben-Sasson, Dan Carmon, Y. Ishai, Swastik Kopparty +1 more
2020IEEE Annual Symposium on Foundations of Computer Science101 citations Open access
Semantic Scholar
DEEP-FRI: Sampling outside the box improves soundness
E. Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019IACR Cryptology ePrint Archive97 citations
Semantic Scholar
Explicit subspace designs
V. Guruswami, Swastik Kopparty
2013IEEE Annual Symposium on Foundations of Computer Science94 citations
Semantic Scholar
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015Symposium on the Theory of Computing85 citations
Semantic Scholar
Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf +2 more
2016ACM-SIAM Symposium on Discrete Algorithms68 citations Open access
Semantic Scholar
Geometric rank of tensors and subrank of matrix multiplication
Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
2020Electron. Colloquium Comput. Complex.44 citations Open access
Semantic Scholar
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary K. Wootters
2018IEEE Annual Symposium on Foundations of Computer Science44 citations Open access
Semantic Scholar
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
Sivakanth Gopi, Swastik Kopparty, R. Oliveira, Noga Ron-Zewi +1 more
2017IEEE Transactions on Information Theory44 citations Open access
Semantic Scholar
Worst-Case to Average Case Reductions for the Distance to a Code
E. Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
2018Cybersecurity and Cyberforensics Conference43 citations
Semantic Scholar
High-rate codes with sublinear-time decoding
Swastik Kopparty, Shubhangi Saraf, S. Yekhanin
2014Journal of the ACM40 citations Open access
Semantic Scholar
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary K. Wootters
2023SIAM journal on computing (Print)39 citations
Semantic Scholar
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
E. Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir +1 more
2013IEEE Annual Symposium on Foundations of Computer Science36 citations Open access
Semantic Scholar
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2014Cybersecurity and Cyberforensics Conference34 citations
Semantic Scholar
Equivalence of Polynomial Identity Testing and Polynomial Factorization
Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2015Computational Complexity31 citations
Semantic Scholar
Some remarks on multiplicity codes
Swastik Kopparty
2015Discrete Geometry and Algebraic Combinatorics30 citations Open access
Semantic Scholar
On List Recovery of High-Rate Tensor Codes
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf +1 more
2019IEEE Transactions on Information Theory25 citations Open access
Semantic Scholar
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields
E. Ben-Sasson, Dan Carmon, Swastik Kopparty, D. Levit
2021Electron. Colloquium Comput. Complex.23 citations
Semantic Scholar
Robust positioning patterns
R. Berkowitz, Swastik Kopparty
2016ACM-SIAM Symposium on Discrete Algorithms22 citations
Semantic Scholar
A local central limit theorem for triangles in a random graph
J. Gilmer, Swastik Kopparty
2016Random Struct. Algorithms21 citations
Semantic Scholar
Certifying polynomials for AC^0(parity) circuits, with applications
Swastik Kopparty, Srikanth Srinivasan
2012Foundations of Software Technology and Theoretical Computer Science21 citations
Semantic Scholar
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves
E. Ben-Sasson, Dan Carmon, Swastik Kopparty, D. Levit
2022Electron. Colloquium Comput. Complex.20 citations
Semantic Scholar
The complexity of computing the minimum rank of a sign pattern matrix
Amey Bhangale, Swastik Kopparty
2015arXiv.org20 citations
Semantic Scholar
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2017Journal of the ACM18 citations Open access
Semantic Scholar
List-Decoding Algorithms for Lifted Codes
Alan J. X. Guo, Swastik Kopparty
2014IEEE Transactions on Information Theory17 citations Open access
Semantic Scholar
Quasilinear Time List-Decodable Codes for Space Bounded Channels
Jad Silbak, Swastik Kopparty, Ronen Shaltiel
2019IEEE Annual Symposium on Foundations of Computer Science15 citations
Semantic Scholar
Local Testing and Decoding of High-Rate Error-Correcting Codes
Swastik Kopparty, Shubhangi Saraf
2017Electron. Colloquium Comput. Complex.15 citations
Semantic Scholar
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
Swastik Kopparty, Mrinal Kumar, M. Saks
2014Theory of Computing15 citations Open access
Semantic Scholar
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
E. Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty +1 more
2013Symposium on the Theory of Computing15 citations
Semantic Scholar
Decoding Reed-Muller Codes over Product Sets
John Y. Kim, Swastik Kopparty
2015Theory of Computing14 citations Open access
Semantic Scholar
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields
E. Ben-Sasson, Dan Carmon, Swastik Kopparty, D. Levit
2023ACM-SIAM Symposium on Discrete Algorithms13 citations
Semantic Scholar
Improved PIR Schemes using Matching Vectors and Derivatives
Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan
2024Electron. Colloquium Comput. Complex.10 citations Open access
Semantic Scholar
Near-optimal approximation algorithm for simultaneous Max-Cut
Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva +1 more
2018ACM-SIAM Symposium on Discrete Algorithms10 citations
Semantic Scholar
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes
Swastik Kopparty, Shubhangi Saraf
2016SIGA10 citations
Semantic Scholar
Simultaneous Approximation of Constraint Satisfaction Problems
Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2014International Colloquium on Automata, Languages and Programming9 citations Open access
Semantic Scholar
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015Electron. Colloquium Comput. Complex.7 citations
Semantic Scholar
Lecture 5 : k-wise Independent Hashing and Applications
Swastik Kopparty, Yun-Kuen Cheung, Aleksandar Nikolov
20137 citations
Semantic Scholar
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2023Electron. Colloquium Comput. Complex.6 citations
Semantic Scholar
On Multilinear Forms: Bias, Correlation, and Tensor Rank
Abhishek Bhrushundi, P. Harsha, Pooya Hatami, Swastik Kopparty +1 more
2018Electron. Colloquium Comput. Complex.6 citations
Semantic Scholar
A local central limit theorem for the number of triangles in a random graph
J. Gilmer, Swastik Kopparty
20146 citations
Semantic Scholar
Certifying Polynomials for AC0[⊕] circuits, with applications
Swastik Kopparty, Srikanth Srinivasan
2012Electron. Colloquium Comput. Complex.6 citations
Semantic Scholar
High Rate Multivariate Polynomial Evaluation Codes
Swastik Kopparty, Mrinal Kumar, Harry Sha
2024Electron. Colloquium Comput. Complex.4 citations Open access
Semantic Scholar
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression
Swastik Kopparty, Srikanth Srinivasan
2018Theory of Computing4 citations Open access
Semantic Scholar
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
Swastik Kopparty, Aditya Potukuchi
2017ACM-SIAM Symposium on Discrete Algorithms4 citations Open access
Semantic Scholar
Recovering polynomials over finite fields from noisy character values
Swastik Kopparty
2026Electron. Colloquium Comput. Complex.3 citations
Semantic Scholar
UvA-DARE (Digital Academic Repository) Geometric rank of tensors and subrank of matrix multiplication Geometric Rank of Tensors and Subrank of Matrix Multiplication Geometric
Swastik Kopparty
20203 citations
Semantic Scholar
Lecture 3: Finding integer solutions to systems of linear equations
Swastik Kopparty, Abhishek Bhrushundi
20143 citations
Semantic Scholar
Lecture 4 : AC 0 lower bounds and pseudorandomness
Swastik Kopparty, B. Garnett
20133 citations
Semantic Scholar
On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC
Swastik Kopparty, Shubhangi Saraf
2026arXiv.org2 citations
Semantic Scholar