Shubhangi Saraf
Cytowane przez
Cytowane przez
Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
Z Dvir, S Kopparty, S Saraf, M Sudan
SIAM Journal on Computing 42 (6), 2305-2328, 2013
High-rate codes with sublinear-time decoding
S Kopparty, S Saraf, S Yekhanin
Journal of the ACM (JACM) 61 (5), 1-20, 2014
Blackbox polynomial identity testing for depth 3 circuits
N Kayal, S Saraf
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 198-207, 2009
High-rate locally correctable and locally testable codes with sub-polynomial query complexity
S Kopparty, O Meir, N Ron-Zewi, S Saraf
Journal of the ACM (JACM) 64 (2), 1-42, 2017
On the power of homogeneous depth 4 arithmetic circuits
M Kumar, S Saraf
SIAM Journal on Computing 46 (1), 336-387, 2017
DEEP-FRI: sampling outside the box improves soundness
E Ben-Sasson, L Goldberg, S Kopparty, S Saraf
arXiv preprint arXiv:1903.12243, 2019
An improved lower bound on the size of Kakeya sets over finite fields
S Saraf, M Sudan
Analysis & PDE 1 (3), 375-379, 2008
Maximally recoverable codes for grid-like topologies
P Gopalan, G Hu, S Kopparty, S Saraf, C Wang, S Yekhanin
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Black-box identity testing of depth-4 multilinear circuits
S Saraf, I Volkovich
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Improved rank bounds for design matrices and a new proof of Kelly’s theorem
Z Dvir, S Saraf, A Wigderson
Forum of Mathematics, Sigma 2, e4, 2014
Proximity gaps for Reed–Solomon codes
E Ben-Sasson, D Carmon, Y Ishai, S Kopparty, S Saraf
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
The limits of depth reduction for arithmetic formulas: It's all about the top fan-in
M Kumar, S Saraf
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
Local list-decoding and testing of random linear codes from high error
S Kopparty, S Saraf
Proceedings of the forty-second ACM symposium on Theory of computing, 417-426, 2010
Improved decoding of folded Reed-Solomon and multiplicity codes
S Kopparty, N Ron-Zewi, S Saraf, M Wootters
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
S Gopi, S Kopparty, R Oliveira, N Ron-Zewi, S Saraf
IEEE Transactions on Information Theory 64 (8), 5813-5831, 2018
Equivalence of polynomial identity testing and deterministic multivariate polynomial factorization
S Kopparty, S Saraf, A Shpilka
2014 IEEE 29th Conference on Computational Complexity (CCC), 169-180, 2014
Acute and nonobtuse triangulations of polyhedral surfaces
S Saraf
European Journal of Combinatorics 30 (4), 833-840, 2009
Tolerant linearity testing and locally testable codes
S Kopparty, S Saraf
International Workshop on Approximation Algorithms for Combinatorial …, 2009
Arithmetic circuits with locally low algebraic rank
M Kumar, S Saraf
arXiv preprint arXiv:1806.06097, 2018
Towards an algebraic natural proofs barrier via polynomial identity testing
JA Grochow, M Kumar, M Saks, S Saraf
arXiv preprint arXiv:1701.01717, 2017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20