Shubhangi Saraf

发表

INCIDENCE PROBLEMS IN DISCRETE GEOMETRY

J. Kahn, Swastik Kopparty, Shubhangi Saraf, 2017 .

Acute and nonobtuse triangulations of polyhedral surfaces

Shubhangi Saraf, Shubhangi Saraf, 2009, Eur. J. Comb..

Improved lower bound on the size of Kakeya sets over finite fields

Madhu Sudan, Shubhangi Saraf, M. Sudan, 2008, 0808.2499.

Kakeya Sets and the Method of Multiplicities by Shubhangi Saraf

Shubhangi Saraf, 2009 .

INCIDENCES AND EXTREMAL PROBLEMS ON FINITE POINT SETS

Shubhangi Saraf, 2017 .

Improved Low-Depth Set-Multilinear Circuit Lower Bounds

Shubhangi Saraf, D. Kush, 2022, ArXiv.

On the Number of Ordinary Lines Determined by Sets in Complex Space

Abdul Basit, Zeev Dvir, Shubhangi Saraf, 2016, International Symposium on Computational Geometry.

Locally Decodable Codes

Shubhangi Saraf, Shubhangi Saraf, 2016, Encyclopedia of Algorithms.

Kakeya sets and the method of multiplicities

Shubhangi Saraf, Shubhangi Saraf, 2009 .

Reconstruction of Depth-$4$ Multilinear Circuits

Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava, 2020, Electron. Colloquium Comput. Complex..

Black-Box Identity Testing of Depth-4 Multilinear Circuits

Ilya Volkovich, Shubhangi Saraf, 2017, Combinatorica.

A new family of locally correctable codes based on degree-lifted algebraic geometry codes

Eli Ben-Sasson, Shubhangi Saraf, Ariel Gabizon, 2013, STOC '13.

The Method of Multiplicities by Shubhangi Saraf

L. Kolodziejski, Shubhangi Saraf, 2011 .

The method of multiplicities

Shubhangi Saraf, Shubhangi Saraf, 2011 .

High-rate codes with sublinear-time decoding

Shubhangi Saraf, Sergey Yekhanin, Swastik Kopparty, 2014, Electron. Colloquium Comput. Complex..

Proximity Gaps for Reed–Solomon Codes

Yuval Ishai, Eli Ben-Sasson, Shubhangi Saraf, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Towards an algebraic natural proofs barrier via polynomial identity testing pdf

Michael E. Saks, Joshua A. Grochow, Shubhangi Saraf, 2017, Electron. Colloquium Comput. Complex..

High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2015, STOC.

On the Power of Homogeneous Depth 4 Arithmetic Circuits

Shubhangi Saraf, Mrinal Kumar, Mrinal Kumar, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM pdf

Avi Wigderson, Zeev Dvir, Shubhangi Saraf, 2012, Forum of Mathematics, Sigma.

Breaking the quadratic barrier for 3-LCC's over the reals

Avi Wigderson, Zeev Dvir, Shubhangi Saraf, 2013, STOC.

Blackbox Polynomial Identity Testing for Depth 3 Circuits

Shubhangi Saraf, Neeraj Kayal, N. Kayal, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

Madhu Sudan, Zeev Dvir, Shubhangi Saraf, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Incidence Bounds for Block Designs

Shubhangi Saraf, Ben D. Lund, Ben D. Lund, 2014, SIAM J. Discret. Math..

Local Testing and Decoding of High-Rate Error-Correcting Codes

Shubhangi Saraf, Swastik Kopparty, Swastik Kopparty, 2017, Electron. Colloquium Comput. Complex..

A mini course on additive combinatorics

Wolfgang Mulzer, Shubhangi Saraf, Aaron Roth, 2007 .

Worst-Case to Average Case Reductions for the Distance to a Code

Eli Ben-Sasson, Shubhangi Saraf, Swastik Kopparty, 2018, CCC.

Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes

Shubhangi Saraf, Swastik Kopparty, Swastik Kopparty, 2016, SIGA.

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Equivalence of Polynomial Identity Testing and Polynomial Factorization

Shubhangi Saraf, Swastik Kopparty, Amir Shpilka, 2015, computational complexity.

Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization

Shubhangi Saraf, Swastik Kopparty, Amir Shpilka, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

On the Number of Ordinary Lines Determined by Sets in Complex Space

Abdul Basit, Zeev Dvir, Shubhangi Saraf, 2016, SoCG.

Improved Decoding of Folded Reed-Solomon and Multiplicity Codes

Shubhangi Saraf, Mary Wootters, Swastik Kopparty, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

DEEP-FRI: Sampling outside the box improves soundness

Eli Ben-Sasson, Shubhangi Saraf, Swastik Kopparty, 2019, IACR Cryptol. ePrint Arch..

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2017, J. ACM.

Tolerant Linearity Testing and Locally Testable Codes

Shubhangi Saraf, Swastik Kopparty, Swastik Kopparty, 2009, APPROX-RANDOM.

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2015, Electron. Colloquium Comput. Complex..

On List Recovery of High-Rate Tensor Codes

Shubhangi Saraf, Swastik Kopparty, Nicolas Resch, 2019, IEEE Transactions on Information Theory.

Black-Box Identity Testing of Depth-4 Multilinear Circuits

Ilya Volkovich, Shubhangi Saraf, Ilya Volkovich, 2011, Combinatorica.

Proximity Gaps for Reed(cid:21)Solomon Codes

Swastik Kopparty, Y. Ishai, Dan Carmon, 2020 .

Arithmetic Circuits with Locally Low Algebraic Rank

Shubhangi Saraf, Mrinal Kumar, Mrinal Kumar, 2016, Theory Comput..

Sums of products of polynomials in few variables : lower bounds and polynomial identity testing pdf

Shubhangi Saraf, Mrinal Kumar, Mrinal Kumar, 2015, CCC.

Maximally Recoverable Codes for Grid-like Topologies

Shubhangi Saraf, Parikshit Gopalan, Swastik Kopparty, 2016, SODA.