Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSwastik Kopparty
Person information
- affiliation: University of Toronto, Department of Mathematics and Department of Computer Science, Canada
- affiliation (former): Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2010
[b1]Swastik Kopparty:
Algebraic methods in randomness and pseudorandomness. Massachusetts Institute of Technology, Cambridge, MA, USA, 2010
Journal Articles
- 2023
- [j28]Eli Ben-Sasson
, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. J. ACM 70(5): 31:1-31:57 (2023) - [j27]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52(3): 794-840 (2023) - 2021
- [j26]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): 296-316 (2021) - 2019
- [j25]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): 451 (2019) - 2018
- [j24]Simao Herdade, John Kim, Swastik Kopparty:
A Cauchy-Davenport Theorem for Linear Maps. Comb. 38(3): 601-618 (2018) - [j23]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): 5813-5831 (2018) - [j22]Swastik Kopparty, Srikanth Srinivasan:
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. 14(1): 1-24 (2018) - 2017
- [j21]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): 11:1-11:42 (2017) - [j20]John Y. Kim, Swastik Kopparty:
Decoding Reed-Muller Codes over Product Sets. Theory Comput. 13(1): 1-38 (2017) - 2016
- [j19]Venkatesan Guruswami, Swastik Kopparty:
Explicit subspace designs. Comb. 36(2): 161-185 (2016) - [j18]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): 32:1-32:57 (2016) - [j17]Justin Gilmer, Swastik Kopparty:
A local central limit theorem for triangles in a random graph. Random Struct. Algorithms 48(4): 732-750 (2016) - [j16]Swastik Kopparty, Shubhangi Saraf:
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. SIGACT News 47(3): 46-66 (2016) - [j15]Alan Guo, Swastik Kopparty:
List-Decoding Algorithms for Lifted Codes. IEEE Trans. Inf. Theory 62(5): 2719-2725 (2016) - [j14]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. 12(1): 1-27 (2016) - 2015
- [j13]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. 24(2): 295-331 (2015) - [j12]Swastik Kopparty:
List-Decoding Multiplicity Codes. Theory Comput. 11: 149-182 (2015) - 2014
- [j11]Swastik Kopparty, Qiang Wang:
Roots and coefficients of polynomials over finite fields. Finite Fields Their Appl. 29: 198-201 (2014) - [j10]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. J. ACM 61(5): 28:1-28:20 (2014) - 2013
- [j9]Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. J. ACM 60(5): 37:1-37:34 (2013) - [j8]Swastik Kopparty, Shubhangi Saraf:
Local List-Decoding and Testing of Random Linear Codes from High Error. SIAM J. Comput. 42(3): 1302-1326 (2013) - [j7]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): 2305-2328 (2013) - 2012
- [j6]Eli Ben-Sasson, Swastik Kopparty:
Affine Dispersers from Subspace Polynomials. SIAM J. Comput. 41(4): 880-914 (2012) - 2011
- [j5]Swastik Kopparty, Benjamin Rossman:
The homomorphism domination exponent. Eur. J. Comb. 32(7): 1097-1114 (2011) - [j4]Swastik Kopparty:
Review of algebraic function fields and codes by Henning Stichtenoth. SIGACT News 42(2): 19-24 (2011) - [j3]Venkatesan Guruswami, Johan Håstad, Swastik Kopparty:
On the List-Decodability of Random Linear Codes. IEEE Trans. Inf. Theory 57(2): 718-725 (2011) - 2010
- [j2]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56(1): 113-120 (2010) - 2005
- [j1]Swastik Kopparty, Chinya V. Ravishankar:
A framework for pursuit evasion games in Rn. Inf. Process. Lett. 96(3): 114-122 (2005)
Conference and Workshop Papers
- 2024
- [c46]Kiran S. Kedlaya, Swastik Kopparty:
On the Degree of Polynomials Computing Square Roots Mod p. CCC 2024: 25:1-25:14 - 2023
- [c45]Swastik Kopparty, Vishvajeet N:
Extracting Mergers and Projections of Partitions. APPROX/RANDOM 2023: 52:1-52:22 - [c44]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields. SODA 2023: 700-737 - 2022
- [c43]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: 467-496 - 2020
- [c42]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM 2020: 29:1-29:23 - [c41]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. CCC 2020: 35:1-35:21 - [c40]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. FOCS 2020: 900-909 - [c39]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS 2020: 5:1-5:32 - 2019
- [c38]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM 2019: 68:1-68:22 - [c37]Jad Silbak, Swastik Kopparty, Ronen Shaltiel:
Quasilinear Time List-Decodable Codes for Space Bounded Channels. FOCS 2019: 302-333 - 2018
- [c36]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-Case to Average Case Reductions for the Distance to a Code. CCC 2018: 24:1-24:23 - [c35]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS 2018: 212-223 - [c34]Swastik Kopparty, Aditya Potukuchi:
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. SODA 2018: 680-691 - [c33]Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari:
Near-optimal approximation algorithm for simultaneous Max-Cut. SODA 2018: 1407-1425 - 2017
- [c32]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: 2073-2091 - [c31]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - 2016
- [c30]John Y. Kim, Swastik Kopparty:
Decoding Reed-Muller Codes Over Product Sets. CCC 2016: 11:1-11:28 - [c29]Ross Berkowitz, Swastik Kopparty:
Robust positioning patterns. SODA 2016: 1937-1951 - [c28]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC 2016: 202-215 - 2015
- [c27]Amey Bhangale, Swastik Kopparty, Sushant Sachdeva:
Simultaneous Approximation of Constraint Satisfaction Problems. ICALP (1) 2015: 193-205 - 2014
- [c26]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. CCC 2014: 169-180 - [c25]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. ICALP (1) 2014: 726-737 - 2013
- [c24]Swastik Kopparty:
Some remarks on multiplicity codes. Discrete Geometry and Algebraic Combinatorics 2013 - [c23]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS 2013: 320-329 - [c22]Venkatesan Guruswami, Swastik Kopparty:
Explicit Subspace Designs. FOCS 2013: 608-617 - [c21]Alan Guo, Swastik Kopparty, Madhu Sudan:
New affine-invariant codes from lifting. ITCS 2013: 529-540 - [c20]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: 833-842 - 2012
- [c19]Swastik Kopparty, Srikanth Srinivasan:
Certifying polynomials for AC^0(parity) circuits, with applications. FSTTCS 2012: 36-47 - 2011
- [c18]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. STOC 2011: 167-176 - [c17]Swastik Kopparty:
On the complexity of powering in finite fields. STOC 2011: 489-498 - 2010
- [c16]Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman:
Optimal Testing of Reed-Muller Codes. FOCS 2010: 488-497 - [c15]Venkatesan Guruswami, Johan Håstad, Swastik Kopparty:
On the list-decodability of random linear codes. STOC 2010: 409-416 - [c14]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high error. STOC 2010: 417-426 - 2009
- [c13]Mukul Agarwal, Swastik Kopparty, Sanjoy K. Mitter:
Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation. Allerton 2009: 700-707 - [c12]Swastik Kopparty, Shubhangi Saraf:
Tolerant Linearity Testing and Locally Testable Codes. APPROX-RANDOM 2009: 601-614 - [c11]T. S. Jayram, Swastik Kopparty, Prasad Raghavendra:
On the Communication Complexity of Read-Once AC^0 Formulae. CCC 2009: 329-340 - [c10]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. FOCS 2009: 181-190 - [c9]Eli Ben-Sasson, Swastik Kopparty:
Affine dispersers from subspace polynomials. STOC 2009: 65-74 - [c8]Phokion G. Kolaitis, Swastik Kopparty:
Random graphs and the parity quantifier. STOC 2009: 705-714 - 2008
- [c7]Swastik Kopparty, Sergey Yekhanin:
Detecting Rational Points on Hypersurfaces over Finite Fields. CCC 2008: 311-320 - [c6]Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284 - 2006
- [c5]Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Local Decoding and Testing for Homomorphisms. APPROX-RANDOM 2006: 375-385 - [c4]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS 2006: 207-216 - [c3]Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan:
How to Construct a Correct and Scalable iBGP Configuration. INFOCOM 2006 - 2004
- [c2]Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar:
Roads, Codes and Spatiotemporal Queries. PODS 2004: 115-124 - 2002
- [c1]Swastik Kopparty, Srikanth V. Krishnamurthy, Michalis Faloutsos, Satish K. Tripathi:
Split TCP for mobile ad hoc networks. GLOBECOM 2002: 138-142
Parts in Books or Collections
- 2010
- [p2]Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman:
Optimal Testing of Reed-Muller Codes. Property Testing 2010: 269-275 - [p1]Swastik Kopparty, Shubhangi Saraf:
Some Recent Results on Local Testing of Sparse Linear Codes. Property Testing 2010: 320-333
Informal and Other Publications
- 2024
- [i58]Swastik Kopparty, Aditya Potukuchi, Harry Sha:
Error-Correcting Graph Codes. CoRR abs/2406.13867 (2024) - [i57]Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch:
Character sums over AG codes. Electron. Colloquium Comput. Complex. TR24: TR24-069 (2024) - 2023
- [i56]Swastik Kopparty, Vishvajeet N:
Extracting Mergers and Projections of Partitions. CoRR abs/2306.16915 (2023) - [i55]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR abs/2310.19149 (2023) - [i54]Kiran S. Kedlaya, Swastik Kopparty:
On the degree of polynomials computing square roots mod p. CoRR abs/2311.10956 (2023) - [i53]Kiran S. Kedlaya, Swastik Kopparty:
On the degree of polynomials computing square roots mod p. Electron. Colloquium Comput. Complex. TR23 (2023) - [i52]Swastik Kopparty, Vishvajeet N:
Extracting Mergers and Projections of Partitions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i51]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i50]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. TR22 (2022) - [i49]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: 1542 (2022) - 2021
- [i48]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 abs/2107.08473 (2021) - [i47]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. TR21 (2021) - 2020
- [i46]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric rank of tensors and subrank of matrix multiplication. CoRR abs/2002.09472 (2020) - [i45]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i44]Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
Geometric Rank of Tensors and Subrank of Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020) - [i43]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2020: 654 (2020) - 2019
- [i42]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling outside the box improves soundness. CoRR abs/1903.12243 (2019) - [i41]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i40]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - [i39]Ronen Shaltiel, Swastik Kopparty, Jad Silbak:
Quasilinear time list-decodable codes for space bounded channels. Electron. Colloquium Comput. Complex. TR19 (2019) - [i38]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. 2019: 336 (2019) - 2018
- [i37]Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari:
Near-optimal approximation algorithm for simultaneous Max-Cut. CoRR abs/1801.04497 (2018) - [i36]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR abs/1804.09124 (2018) - [i35]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/1805.01498 (2018) - [i34]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. TR18 (2018) - [i33]Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar:
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. TR18 (2018) - [i32]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i31]Swastik Kopparty, Aditya Potukuchi:
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields. CoRR abs/1712.06039 (2017) - [i30]Swastik Kopparty, Shubhangi Saraf:
Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i29]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. TR16 (2016) - 2015
- [i28]Amey Bhangale, Swastik Kopparty:
The complexity of computing the minimum rank of a sign pattern matrix. CoRR abs/1503.04486 (2015) - [i27]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient indexing of necklaces and irreducible polynomials over finite fields. CoRR abs/1504.00572 (2015) - [i26]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR abs/1504.05653 (2015) - [i25]Swastik Kopparty:
Some remarks on multiplicity codes. CoRR abs/1505.07547 (2015) - [i24]John Y. Kim, Swastik Kopparty:
Decoding Reed-Muller codes over product sets. CoRR abs/1511.07488 (2015) - [i23]Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient indexing of necklaces and irreducible polynomials over finite fields. Electron. Colloquium Comput. Complex. TR15 (2015) - [i22]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i21]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i20]Amey Bhangale, Swastik Kopparty, Sushant Sachdeva:
Simultaneous Approximation of Constraint Satisfaction Problems. CoRR abs/1407.7759 (2014) - [i19]Alan Guo, Swastik Kopparty:
List-decoding algorithms for lifted codes. CoRR abs/1412.0305 (2014) - [i18]Amey Bhangale, Swastik Kopparty, Sushant Sachdeva:
Simultaneous Approximation of Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. TR14 (2014) - [i17]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i16]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. TR13 (2013) - [i15]Venkatesan Guruswami, Swastik Kopparty:
Explicit Subspace Designs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i14]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. TR12 (2012) - [i13]Alan Guo, Swastik Kopparty, Madhu Sudan:
New affine-invariant codes from lifting. Electron. Colloquium Comput. Complex. TR12 (2012) - [i12]Swastik Kopparty:
List-Decoding Multiplicity Codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i11]Swastik Kopparty, Srikanth Srinivasan:
Certifying Polynomials for AC0[⊕] circuits, with applications. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [i10]Venkatesan Guruswami, Johan Håstad, Swastik Kopparty:
On the List-Decodability of Random Linear Codes. CoRR abs/1001.1386 (2010) - [i9]Eli Ben-Sasson, Swastik Kopparty:
Affine Dispersers from Subspace Polynomials. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Venkatesan Guruswami, Johan Håstad, Swastik Kopparty:
On the List-Decodability of Random Linear Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i6]Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman:
Optimal Testing of Reed-Muller Codes. CoRR abs/0910.0641 (2009) - [i5]Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman:
Optimal testing of Reed-Muller codes. Electron. Colloquium Comput. Complex. TR09 (2009) - [i4]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i3]Phokion G. Kolaitis, Swastik Kopparty:
Random Graphs and the Parity Quantifier. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high-error. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i1]Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Decodability of Group Homomorphisms beyond the Johnson Bound. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-16 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
