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

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/..
 
?
2

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/..
 
?
3

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..
 
?
4

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/..
 
?
5

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..
 
?
6

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/..
 
?
7

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..
 
?
8

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..
 
?
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

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..
 
?
11

Maximally recoverable codes for grid-like topologies:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gopalan, Parikshit ; Hu, Guangda ; Kopparty, Swastik... - p. 2092-2108 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Robust positioning patterns:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Berkowitz, Ross ; Kopparty, Swastik - p. 1937-1951 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

High-rate locally-correctable and locally-testable codes wi..:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Kopparty, Swastik ; Meir, Or ; Ron-Zewi, Noga. - p. 202-215 , 2016
Link: https://dl.acm.org/doi/1..
 
?
14

New affine-invariant codes from lifting:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,
Guo, Alan ; Kopparty, Swastik ; Sudan, Madhu - p. 529-540 , 2013
Link: https://dl.acm.org/doi/1..
 
?
15

A new family of locally correctable codes based on degree-l..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Ben-Sasson, Eli ; Gabizon, Ariel ; Kaplan, Yohay.. - p. 833-842 , 2013
Link: https://dl.acm.org/doi/1..
 
1-15