I agree that this site is using cookies. You can find further informations here.
X
Kopparty, Swastik
92  results:
Search for persons X
?
1

Improved List Decoding of Folded Reed-Solomon and Multiplic..:

Kopparty, Swastik ; Ron-Zewi, Noga ; Saraf, Shubhangi.
SIAM Journal on Computing.  52 (2023)  3 - p. 794-840 , 2023
Link: https://doi.org/10.1137/..
 
?
2

Proximity Gaps for Reed–Solomon Codes:

Ben-Sasson, Eli ; Carmon, Dan ; Ishai, Yuval..
Journal of the ACM.  70 (2023)  5 - p. 1-57 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Scalable and Transparent Proofs over All Large Fields, via ..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Ben–Sasson, Eli ; Carmon, Dan ; Kopparty, Swastik. - p. 467-496 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Proximity Gaps for Reed–Solomon Codes:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Ben-Sasson, Eli ; Carmon, Dan ; Ishai, Yuval.. - p. 900-909 , 2020
Link: https://doi.org/10.1109/..
 
?
5

Geometric rank of tensors and subrank of matrix multiplicat..:

, In: Proceedings of the 35th Computational Complexity Conference,
Kopparty, Swastik ; Moshkovitz, Guy ; Zuiddam, Jeroen - p. 1-21 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

Special Section on the Fifty-Seventh Annual IEEE Symposium ..:

Dinur, Irit ; Meir, Or ; Kopparty, Swastik
SIAM Journal on Computing.  48 (2019)  2 - p. 451-451 , 2019
Link: https://doi.org/10.1137/..
 
?
7

Quasilinear Time List-Decodable Codes for Space Bounded Cha..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Silbak, Jad ; Kopparty, Swastik ; Shaltiel, Ronen - p. 302-333 , 2019
Link: https://doi.org/10.1109/..
 
?
8

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://doi.org/10.1137/..
 
?
9

Syndrome decoding of Reed-Muller codes and tensor decomposi..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kopparty, Swastik ; Potukuchi, Aditya - p. 680-691 , 2018
Link: https://doi.org/10.1137/..
 
?
10

ON STRICTLY NONZERO INTEGER-VALUED CHARGES:

KOPPARTY, SWASTIK ; RAO, K. P. S. BHASKARA
Proceedings of the American Mathematical Society.  146 (2018)  9 - p. 3777-3789 , 2018
Link: https://www.jstor.org/st..
 
?
11

Worst-case to average case reductions for the distance to a..:

, In: Proceedings of the 33rd Computational Complexity Conference,
Ben-Sasson, Eli ; Kopparty, Swastik ; Saraf, Shubhangi - p. 1-23 , 2018
Link: https://dl.acm.org/doi/1..
 
?
12

Syndrome decoding of reed-muller codes and tensor decomposi..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kopparty, Swastik ; Potukuchi, Aditya - p. 680-691 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://dl.acm.org/doi/1..
 
?
14

Locally testable and locally correctable codes approaching ..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gopi, Sivakanth ; Kopparty, Swastik ; Oliveira, Rafael.. - p. 2073-2091 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

High-Rate Locally Correctable and Locally Testable Codes wi..:

Kopparty, Swastik ; Meir, Or ; Ron-Zewi, Noga.
Journal of the ACM (JACM).  64 (2017)  2 - p. 1-42 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15