Get started
Author

Shubhangi Saraf

High-rate codes with sublinear-time decoding
2011 · Swastik Kopparty, Shubhangi Saraf, et al. · ACM Symposium on Theory of Computing (STOC) · 134
PDF
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2009 · Zeev Dvir, Swastik Kopparty, et al. · Annual Symposium on Foundations of Computer Science · 85
Blackbox Polynomial Identity Testing for Depth 3 Circuits
2009 · Neeraj Kayal, Shubhangi Saraf · Annual Symposium on Foundations of Computer Science · 73
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
2013 · Zeev Dvir, Swastik Kopparty, et al. · SIAM Journal on Computing · 65
On Proximity Gaps of Reed-Solomon Codes
2020 · Eli Ben-Sasson, Dan Carmon, et al. · Annual Symposium on Foundations of Computer Science · 58
PDF
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
2017 · Swastik Kopparty, Or Meir, et al. · Journal of the ACM · 55
PDF
Maximally Recoverable Codes for Grid-like Topologies
2017 · Parikshit Gopalan, Guangda Hu, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 51
PDF
Black-Box Identity Testing of Depth-4 Multilinear Circuits
2011 · Shubhangi Saraf, Ilya Volkovich · COMBINATORICA · 49
PDF
Improved lower bound on the size of Kakeya sets over finite fields
2008 · Shubhangi Saraf, Madhu Sudan · Analysis & PDE · 48
PDF
Local List-Decoding and Testing of Random Linear Codes from High Error
2010 · Swastik Kopparty, Shubhangi Saraf · SIAM Journal on Computing · 32
Tolerant Linearity Testing and Locally Testable Codes
2009 · Swastik Kopparty, Shubhangi Saraf · Lecture notes in computer science · 32
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
2018 · Swastik Kopparty, Noga Ron-Zewi, et al. · Annual Symposium on Foundations of Computer Science · 31
PDF
Improved Rank Bounds for Design Matrices and a New Proof of Kelly’s Theorem
2014 · ZEEV DVIR, SHUBHANGI SARAF, et al. · Forum of Mathematics Sigma · 29
PDF
DEEP-FRI: Sampling Outside the Box Improves Soundness
2019 · Ben-Sasson, Eli, Goldberg, Lior, et al. · arXiv (Cornell University) · 25
PDF
Incidence Bounds for Block Designs
2016 · Ben Lund, Shubhangi Saraf · SIAM Journal on Discrete Mathematics · 24
PDF
Acute and nonobtuse triangulations of polyhedral surfaces
2008 · Shubhangi Saraf · European Journal of Combinatorics · 24
PDF
The limits of depth reduction for arithmetic formulas
2014 · Mrinal Kumar, Shubhangi Saraf · ACM Symposium on Theory of Computing (STOC) · 23
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
2016 · Swastik Kopparty, Or Meir, et al. · ACM Symposium on Theory of Computing (STOC) · 22
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
2014 · Swastik Kopparty, Shubhangi Saraf, et al. · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 22
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
2018 · Sivakanth Gopi, Swastik Kopparty, et al. · IEEE Transactions on Information Theory · 21
Equivalence of Polynomial Identity Testing and Polynomial Factorization
2015 · Swastik Kopparty, Shubhangi Saraf, et al. · Computational Complexity · 20
On the Power of Homogeneous Depth 4 Arithmetic Circuits
2014 · Mrinal Kumar, Shubhangi Saraf · Annual Symposium on Foundations of Computer Science · 20
On the Power of Homogeneous Depth 4 Arithmetic Circuits
2017 · Mrinal Kumar, Shubhangi Saraf · SIAM Journal on Computing · 19
PDF
Breaking the quadratic barrier for 3-LCC's over the reals
2014 · Zeev Dvir, Shubhangi Saraf, et al. · ACM Symposium on Theory of Computing (STOC) · 17
Noisy Interpolation of Sparse Polynomials, and Applications
2011 · Shubhangi Saraf, Sergey Yekhanin · Proceedings - IEEE Conference on Computational Complexity/Proceedings · 16
Works count: 109
Citation count: 1,240
H-index: 20
I10-index: 33
Year
Topic
Type