I agree that this site is using cookies. You can find further informations here.
X
Saraf, Shubhangi
81  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

Linear Independence, Alternants, and Applications:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bhargava, Vishwas ; Saraf, Shubhangi ; Volkovich, Ilya - p. 441-454 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Improved low-depth set-multilinear circuit lower bounds:

, In: Proceedings of the 37th Computational Complexity Conference,
Kush, Deepanshu ; Saraf, Shubhangi - p. 1-16 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

Reconstruction algorithms for low-rank tensors and depth-3 ..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bhargava, Vishwas ; Saraf, Shubhangi ; Volkovich, Ilya - p. 809-822 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Reconstruction of depth-4 multilinear circuits:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhargava, Vishwas ; Saraf, Shubhangi ; Volkovich, Ilya - p. 2144-2160 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

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

Deterministic Factorization of Sparse Polynomials with Boun..:

Bhargava, Vishwas ; Saraf, Shubhangi ; Volkovich, Ilya
Journal of the ACM.  67 (2020)  2 - p. 1-28 , 2020
Link: https://doi.org/10.1145/..
 
?
9

Deterministic Factorization of Sparse Polynomials with Boun..:

Bhargava, Vishwas ; Saraf, Shubhangi ; Volkovich, Ilya
Journal of the ACM (JACM).  67 (2020)  2 - p. 1-28 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

Proceedings of the 35th Computational Complexity Conference:

Aceto, Luca ; Saraf, Shubhangi , 2020
Link: https://dl.acm.org/doi/1..
 
?
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

Finite Field Kakeya and Nikodym Sets in Three Dimensions:

Lund, Ben ; Saraf, Shubhangi ; Wolf, Charles
SIAM Journal on Discrete Mathematics.  32 (2018)  4 - p. 2836-2849 , 2018
Link: https://doi.org/10.1137/..
 
?
13

On the Number of Ordinary Lines Determined by Sets in Compl..:

Basit, Abdul ; Dvir, Zeev ; Saraf, Shubhangi.
Discrete & Computational Geometry.  61 (2018)  4 - p. 778-808 , 2018
Link: https://doi.org/10.1007/..
 
?
14

On the Power of Homogeneous Depth 4 Arithmetic Circuits:

Kumar, Mrinal ; Saraf, Shubhangi
SIAM Journal on Computing.  46 (2017)  1 - p. 336-387 , 2017
Link: https://doi.org/10.1137/..
 
?
15

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..
 
1-15