Swastik Kopparty

158 papers A* 27A 13B 1Journal 104Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algebraic Expander Codes. CoRR Swastik Kopparty, Itzhak Tamo
2026	A	`conf`	Fourier Sparsity of Delta Functions and Matching Vector PIRs. ITCS Fatemeh Ghasemi, Swastik Kopparty
2026	J	`jnl`	Recovering polynomials over finite fields from noisy character values. CoRR Swastik Kopparty
2026	J	`jnl`	Recovering polynomials over finite fields from noisy character values. Electron. Colloquium Comput. Complex. Swastik Kopparty
2025	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 25111). Dagstuhl Reports Swastik Kopparty, Meena Mahajan, Rahul Santhanam, Till Tantau, Ian Mertz
2025	A	`conf`	Error-Correcting Graph Codes. ITCS Swastik Kopparty, Aditya Potukuchi, Harry Sha
2025	J	`jnl`	Fourier Sparsity of Delta Functions and Matching Vector PIRs. CoRR Fatemeh Ghasemi, Swastik Kopparty
2025	J	`jnl`	Fourier Sparsity of Delta Functions and Matching Vector PIRs. Electron. Colloquium Comput. Complex. Fatemeh Ghasemi, Swastik Kopparty
2025	J	`jnl`	Fourier Sparsity of Delta Functions and Matching Vector PIRs. IACR Cryptol. ePrint Arch. Fatemeh Ghasemi, Swastik Kopparty
2025	A*	`conf`	High Rate Multivariate Polynomial Evaluation Codes. STOC Swastik Kopparty, Mrinal Kumar, Harry Sha
2025	A*	`conf`	Improved PIR Schemes using Matching Vectors and Derivatives. STOC Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan
2025	J	`jnl`	On Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf
2025	J	`jnl`	On Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf
2025	A	`conf`	Permanental Rank vs Determinantal Rank of Random Matrices over Finite Fields. APPROX/RANDOM Fatemeh Ghasemi, Gal Gross, Swastik Kopparty
2025	J	`jnl`	Permanental rank versus determinantal rank of random matrices over finite fields. CoRR Fatemeh Ghasemi, Gal Gross, Swastik Kopparty
2025	J	`jnl`	Permanental rank versus determinantal rank of random matrices over finite fields. Electron. Colloquium Comput. Complex. Fatemeh Ghasemi, Gal Gross, Swastik Kopparty
2024	J	`jnl`	Character sums over AG codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch
2024	J	`jnl`	Error-Correcting Graph Codes. CoRR Swastik Kopparty, Aditya Potukuchi, Harry Sha
2024	J	`jnl`	High Rate Multivariate Polynomial Evaluation Codes. CoRR Swastik Kopparty, Mrinal Kumar, Harry Sha
2024	J	`jnl`	High Rate Multivariate Polynomial Evaluation Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Mrinal Kumar, Harry Sha
2024	J	`jnl`	Improved PIR Schemes using Matching Vectors and Derivatives. CoRR Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan
2024	J	`jnl`	Improved PIR Schemes using Matching Vectors and Derivatives. Electron. Colloquium Comput. Complex. Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan
2024	J	`jnl`	Improved PIR Schemes using Matching Vectors and Derivatives. IACR Cryptol. ePrint Arch. Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan
2024	A	`conf`	On the Degree of Polynomials Computing Square Roots Mod p. CCC Kiran S. Kedlaya, Swastik Kopparty
2024	J	`jnl`	Small Shadow Partitions. CoRR Swastik Kopparty, Harry Sha
2024	J	`jnl`	Small Shadow Partitions. Electron. Colloquium Comput. Complex. Swastik Kopparty, Harry Sha
2023	A*	`conf`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time SODA Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2023	A	`conf`	Extracting Mergers and Projections of Partitions. APPROX/RANDOM Swastik Kopparty, Vishvajeet N
2023	J	`jnl`	Extracting Mergers and Projections of Partitions. CoRR Swastik Kopparty, Vishvajeet N
2023	J	`jnl`	Extracting Mergers and Projections of Partitions. Electron. Colloquium Comput. Complex. Swastik Kopparty, Vishvajeet N
2023	J	`jnl`	Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2023	J	`jnl`	On the degree of polynomials computing square roots mod p. CoRR Kiran S. Kedlaya, Swastik Kopparty
2023	J	`jnl`	On the degree of polynomials computing square roots mod p. Electron. Colloquium Comput. Complex. Kiran S. Kedlaya, Swastik Kopparty
2023	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. J. ACM Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2023	J	`jnl`	Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2023	J	`jnl`	Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2022	J	`jnl`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2022	—	`conf`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2022	J	`jnl`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2021	J	`jnl`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. CoRR Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2021	J	`jnl`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2021	J	`jnl`	On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2020	A	`conf`	DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2020	A	`conf`	Geometric Rank of Tensors and Subrank of Matrix Multiplication. CCC Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
2020	J	`jnl`	Geometric Rank of Tensors and Subrank of Matrix Multiplication. Electron. Colloquium Comput. Complex. Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
2020	J	`jnl`	Geometric rank of tensors and subrank of matrix multiplication. CoRR Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
2020	—	`conf`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2020	A*	`conf`	Proximity Gaps for Reed-Solomon Codes. FOCS Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	DEEP-FRI: Sampling outside the box improves soundness. CoRR Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	—	`conf`	On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2019	J	`jnl`	On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
2019	A*	`conf`	Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS Jad Silbak, Swastik Kopparty, Ronen Shaltiel
2019	J	`jnl`	Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. Ronen Shaltiel, Swastik Kopparty, Jad Silbak
2019	J	`jnl`	Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). SIAM J. Comput. Irit Dinur, Or Meir, Swastik Kopparty
2018	J	`jnl`	A Cauchy-Davenport Theorem for Linear Maps. Comb. Simao Herdade, John Kim, Swastik Kopparty
2018	J	`jnl`	Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. Swastik Kopparty, Srikanth Srinivasan
2018	A*	`conf`	Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018	J	`jnl`	Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018	J	`jnl`	Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
2018	J	`jnl`	Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2018	A*	`conf`	Near-optimal approximation algorithm for simultaneous Max-Cut. SODA Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
2018	J	`jnl`	Near-optimal approximation algorithm for simultaneous Max-Cut. CoRR Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	J	`jnl`	On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
2018	A*	`conf`	Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. SODA Swastik Kopparty, Aditya Potukuchi
2018	A	`conf`	Worst-Case to Average Case Reductions for the Distance to a Code. CCC Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
2018	J	`jnl`	Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
2017	J	`jnl`	Decoding Reed-Muller Codes over Product Sets. Theory Comput. John Y. Kim, Swastik Kopparty
2017	J	`jnl`	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2017	J	`jnl`	Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty, Shubhangi Saraf
2017	A*	`conf`	Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2017	A*	`conf`	Maximally Recoverable Codes for Grid-like Topologies. SODA Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin
2017	J	`jnl`	Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. CoRR Swastik Kopparty, Aditya Potukuchi
2016	J	`jnl`	A local central limit theorem for triangles in a random graph. Random Struct. Algorithms Justin Gilmer, Swastik Kopparty
2016	J	`jnl`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2016	A	`conf`	Decoding Reed-Muller Codes Over Product Sets. CCC John Y. Kim, Swastik Kopparty
2016	J	`jnl`	Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2016	J	`jnl`	Explicit subspace designs. Comb. Venkatesan Guruswami, Swastik Kopparty
2016	J	`jnl`	Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. SIGACT News Swastik Kopparty, Shubhangi Saraf
2016	A*	`conf`	High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2016	J	`jnl`	List-Decoding Algorithms for Lifted Codes. IEEE Trans. Inf. Theory Alan Guo, Swastik Kopparty
2016	J	`jnl`	Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
2016	A*	`conf`	Robust positioning patterns. SODA Ross Berkowitz, Swastik Kopparty
2015	J	`jnl`	Decoding Reed-Muller codes over product sets. CoRR John Y. Kim, Swastik Kopparty
2015	J	`jnl`	Efficient indexing of necklaces and irreducible polynomials over finite fields. CoRR Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2015	J	`jnl`	Efficient indexing of necklaces and irreducible polynomials over finite fields. Electron. Colloquium Comput. Complex. Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2015	J	`jnl`	Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2015	J	`jnl`	High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015	J	`jnl`	High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
2015	J	`jnl`	High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015	J	`jnl`	List-Decoding Multiplicity Codes. Theory Comput. Swastik Kopparty
2015	—	`conf`	Simultaneous Approximation of Constraint Satisfaction Problems. ICALP (1) Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2015	J	`jnl`	Some remarks on multiplicity codes. CoRR Swastik Kopparty
2015	J	`jnl`	The complexity of computing the minimum rank of a sign pattern matrix. CoRR Amey Bhangale, Swastik Kopparty
2014	—	`conf`	Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. ICALP (1) Swastik Kopparty, Mrinal Kumar, Michael E. Saks
2014	A	`conf`	Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. CCC Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2014	J	`jnl`	Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. Swastik Kopparty, Shubhangi Saraf, Amir Shpilka
2014	J	`jnl`	High-rate codes with sublinear-time decoding. J. ACM Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
2014	J	`jnl`	List-decoding algorithms for lifted codes. CoRR Alan Guo, Swastik Kopparty
2014	J	`jnl`	Roots and coefficients of polynomials over finite fields. Finite Fields Their Appl. Swastik Kopparty, Qiang Wang
2014	J	`jnl`	Simultaneous Approximation of Constraint Satisfaction Problems. CoRR Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2014	J	`jnl`	Simultaneous Approximation of Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. Amey Bhangale, Swastik Kopparty, Sushant Sachdeva
2013	A*	`conf`	A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
2013	A*	`conf`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	J	`jnl`	Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	A*	`conf`	Explicit Subspace Designs. FOCS Venkatesan Guruswami, Swastik Kopparty
2013	J	`jnl`	Explicit Subspace Designs. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Swastik Kopparty
2013	J	`jnl`	Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. SIAM J. Comput. Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
2013	J	`jnl`	Local List-Decoding and Testing of Random Linear Codes from High Error. SIAM J. Comput. Swastik Kopparty, Shubhangi Saraf
2013	A	`conf`	New affine-invariant codes from lifting. ITCS Alan Guo, Swastik Kopparty, Madhu Sudan
2013	J	`jnl`	Random graphs and the parity quantifier. J. ACM Phokion G. Kolaitis, Swastik Kopparty
2013	—	`conf`	Some remarks on multiplicity codes. Discrete Geometry and Algebraic Combinatorics Swastik Kopparty
2012	J	`jnl`	A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
2012	J	`jnl`	Affine Dispersers from Subspace Polynomials. SIAM J. Comput. Eli Ben-Sasson, Swastik Kopparty
2012	J	`jnl`	Certifying Polynomials for AC Electron. Colloquium Comput. Complex. Swastik Kopparty, Srikanth Srinivasan
2012	—	`conf`	Certifying polynomials for AC^0(parity) circuits, with applications. FSTTCS Swastik Kopparty, Srikanth Srinivasan
2012	J	`jnl`	List-Decoding Multiplicity Codes. Electron. Colloquium Comput. Complex. Swastik Kopparty
2012	J	`jnl`	New affine-invariant codes from lifting. Electron. Colloquium Comput. Complex. Alan Guo, Swastik Kopparty, Madhu Sudan
2011	A*	`conf`	High-rate codes with sublinear-time decoding. STOC Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
2011	J	`jnl`	On the List-Decodability of Random Linear Codes. IEEE Trans. Inf. Theory Venkatesan Guruswami, Johan Håstad, Swastik Kopparty
2011	A*	`conf`	On the complexity of powering in finite fields. STOC Swastik Kopparty
2011	J	`jnl`	Review of algebraic function fields and codes by Henning Stichtenoth. SIGACT News Swastik Kopparty
2011	J	`jnl`	The homomorphism domination exponent. Eur. J. Comb. Swastik Kopparty, Benjamin Rossman
2010	J	`jnl`	Affine Dispersers from Subspace Polynomials. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Swastik Kopparty
2010	—	`—`	Algebraic methods in randomness and pseudorandomness. Swastik Kopparty
2010	J	`jnl`	High-rate codes with sublinear-time decoding. Electron. Colloquium Comput. Complex. Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
2010	A*	`conf`	Local list-decoding and testing of random linear codes from high error. STOC Swastik Kopparty, Shubhangi Saraf
2010	J	`jnl`	On the List-Decodability of Random Linear Codes CoRR Venkatesan Guruswami, Johan Håstad, Swastik Kopparty
2010	J	`jnl`	On the List-Decodability of Random Linear Codes. Electron. Colloquium Comput. Complex. Venkatesan Guruswami, Johan Håstad, Swastik Kopparty
2010	A*	`conf`	On the list-decodability of random linear codes. STOC Venkatesan Guruswami, Johan Håstad, Swastik Kopparty
2010	A*	`conf`	Optimal Testing of Reed-Muller Codes. FOCS Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2010	—	`ch.`	Optimal Testing of Reed-Muller Codes. Property Testing Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2010	—	`ch.`	Some Recent Results on Local Testing of Sparse Linear Codes. Property Testing Swastik Kopparty, Shubhangi Saraf
2010	J	`jnl`	Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2009	A*	`conf`	Affine dispersers from subspace polynomials. STOC Eli Ben-Sasson, Swastik Kopparty
2009	A*	`conf`	Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. FOCS Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
2009	J	`jnl`	Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Electron. Colloquium Comput. Complex. Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
2009	J	`jnl`	Local list-decoding and testing of random linear codes from high-error. Electron. Colloquium Comput. Complex. Swastik Kopparty, Shubhangi Saraf
2009	A	`conf`	On the Communication Complexity of Read-Once AC^0 Formulae. CCC T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
2009	J	`jnl`	Optimal Testing of Reed-Muller Codes CoRR Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2009	J	`jnl`	Optimal testing of Reed-Muller codes. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
2009	J	`jnl`	Random Graphs and the Parity Quantifier. Electron. Colloquium Comput. Complex. Phokion G. Kolaitis, Swastik Kopparty
2009	A*	`conf`	Random graphs and the parity quantifier. STOC Phokion G. Kolaitis, Swastik Kopparty
2009	—	`conf`	Tolerant Linearity Testing and Locally Testable Codes. APPROX-RANDOM Swastik Kopparty, Shubhangi Saraf
2009	—	`conf`	Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation. Allerton Mukul Agarwal, Swastik Kopparty, Sanjoy K. Mitter
2008	J	`jnl`	Decodability of Group Homomorphisms beyond the Johnson Bound. Electron. Colloquium Comput. Complex. Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	A*	`conf`	Decodability of group homomorphisms beyond the johnson bound. STOC Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	A	`conf`	Detecting Rational Points on Hypersurfaces over Finite Fields. CCC Swastik Kopparty, Sergey Yekhanin
2006	A*	`conf`	How to Construct a Correct and Scalable iBGP Configuration. INFOCOM Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan
2006	—	`conf`	Local Decoding and Testing for Homomorphisms. APPROX-RANDOM Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2006	A*	`conf`	Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2005	J	`jnl`	A framework for pursuit evasion games in R Inf. Process. Lett. Swastik Kopparty, Chinya V. Ravishankar
2004	A*	`conf`	Roads, Codes and Spatiotemporal Queries. PODS Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar
2002	B	`conf`	Split TCP for mobile ad hoc networks. GLOBECOM Swastik Kopparty, Srikanth V. Krishnamurthy, Michalis Faloutsos, Satish K. Tripathi