Остановите войну!
for scientists:
default search action
Shubhangi Saraf
- > Home > Persons > Shubhangi Saraf
Publications
- 2023
- [j22]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) - [j21]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) - [i60]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR abs/2310.19149 (2023) - [i56]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - 2021
- [j20]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) - 2020
- [c30]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. FOCS 2020: 900-909 - [c29]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS 2020: 5:1-5:32 - [i50]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i49]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
- [c27]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 - [i48]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling outside the box improves soundness. CoRR abs/1903.12243 (2019) - [i47]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i45]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) - [i44]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
- [j14]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) - [c26]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 - [c25]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS 2018: 212-223 - [i43]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/1805.01498 (2018) - [i40]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) - [i38]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
- [j13]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) - [c22]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 - [c21]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - [i35]Swastik Kopparty, Shubhangi Saraf:
Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j7]Swastik Kopparty, Shubhangi Saraf:
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. SIGACT News 47(3): 46-66 (2016) - [c18]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 - [i32]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
- [j6]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. 24(2): 295-331 (2015) - [i31]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) - [i27]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) - [i26]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
- [j4]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. J. ACM 61(5): 28:1-28:20 (2014) - [c16]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. CCC 2014: 169-180 - [i22]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Swastik Kopparty, Shubhangi Saraf:
Local List-Decoding and Testing of Random Linear Codes from High Error. SIAM J. Comput. 42(3): 1302-1326 (2013) - [j2]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) - [c9]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
- [i9]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) - 2011
- [c6]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. STOC 2011: 167-176 - 2010
- [c4]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high error. STOC 2010: 417-426 - [p1]Swastik Kopparty, Shubhangi Saraf:
Some Recent Results on Local Testing of Sparse Linear Codes. Property Testing 2010: 320-333 - [i4]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [c3]Swastik Kopparty, Shubhangi Saraf:
Tolerant Linearity Testing and Locally Testable Codes. APPROX-RANDOM 2009: 601-614 - [c2]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 - [i3]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) - [i1]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high-error. Electron. Colloquium Comput. Complex. TR09 (2009)
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-04-21 17:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint