Shubhangi Saraf
Cited by
Cited by
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
On the power of homogeneous depth 4 arithmetic circuits
M Kumar, S Saraf
SIAM Journal on Computing 46 (1), 336-387, 2017
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
An improved lower bound on the size of Kakeya sets over finite fields
S Saraf, M Sudan
Analysis & PDE 1 (3), 375-379, 2008
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
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
Local list-decoding and testing of random linear codes from high error
S Kopparty, S Saraf
SIAM Journal on Computing 42 (3), 1302-1326, 2013
The limits of depth reduction for arithmetic formulas: It's all about the top fan-in
M Kumar, S Saraf
SIAM Journal on Computing 44 (6), 1601-1625, 2015
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, 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
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
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
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
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
M Kumar, S Saraf
International Colloquium on Automata, Languages, and Programming, 751-762, 2014
Breaking the quadratic barrier for 3-LCC's over the reals
Z Dvir, S Saraf, A Wigderson
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
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
Tight lower bounds for 2-query LCCs over finite fields
A Bhattacharyya, Z Dvir, A Shpilka, S Saraf
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 638-647, 2011
The system can't perform the operation now. Try again later.
Articles 1–20