Shubhangi Saraf

发表

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

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

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

The limits of depth reduction for arithmetic formulas: it's all about the top fan-in

Shubhangi Saraf, Mrinal Kumar, 2013, Electron. Colloquium Comput. Complex..

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).

Some Recent Results on Local Testing of Sparse Linear Codes

Shubhangi Saraf, Swastik Kopparty, 2010, Property Testing.

Black-Box Identity Testing of Depth-4 Multilinear Circuits

Ilya Volkovich, Shubhangi Saraf, 2018, Comb..

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits

Shubhangi Saraf, Mrinal Kumar, 2014, ICALP.

On the Power of Homogeneous Depth 4 Arithmetic Circuits

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

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

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

High-rate codes with sublinear-time decoding

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

Equivalence of Polynomial Identity Testing and Polynomial Factorization

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

Tight Lower Bounds for 2-query LCCs over Finite Fields

Zeev Dvir, Shubhangi Saraf, Arnab Bhattacharyya, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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

Locally Decodable Codes

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

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.

Helly-Type Theorems in Property Testing

Shubhangi Saraf, Rameshwar Pratap, Sourav Chakraborty, 2014, LATIN.

High-rate codes with sublinear-time decoding

Shubhangi Saraf, Sergey Yekhanin, Swastik Kopparty, 2011, STOC '11.

Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals

Avi Wigderson, Zeev Dvir, Shubhangi Saraf, 2017, Theory Comput..

Tight lower bounds for linear 2-query LCCs over finite fields

Zeev Dvir, Shubhangi Saraf, Arnab Bhattacharyya, 2016, Comb..

Local list-decoding and testing of random linear codes from high error

Shubhangi Saraf, Swastik Kopparty, 2010, STOC '10.

Noisy Interpolation of Sparse Polynomials, and Applications

Shubhangi Saraf, Sergey Yekhanin, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

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

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

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).

Lower Bounds for Approximate LDC pdf

Guangda Hu, Zeev Dvir, Shubhangi Saraf, 2014, ArXiv.

Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin

Shubhangi Saraf, Mrinal Kumar, 2013, Electron. Colloquium Comput. Complex..

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

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

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

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

Helly-Type Theorems in Property Testing

Shubhangi Saraf, Rameshwar Pratap, Sourav Chakraborty, 2018, Int. J. Comput. Geom. Appl..

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava, 2020, J. ACM.

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

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

On List Recovery of High-Rate Tensor Codes

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

DEEP-FRI: Sampling outside the box improves soundness

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

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.

Kakeya sets and the method of multiplicities

Shubhangi Saraf, Shubhangi Saraf, 2009 .

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).

Acute and nonobtuse triangulations of polyhedral surfaces

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

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

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

Sylvester-Gallai type theorems for approximate collinearity

Avi Wigderson, Zeev Dvir, Shubhangi Saraf, 2012, Electron. Colloquium Comput. Complex..

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.

Arithmetic Circuits with Locally Low Algebraic Rank

Shubhangi Saraf, Mrinal Kumar, 2016, Computational Complexity Conference.

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

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

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

Madhu Sudan, Zeev Dvir, Shubhangi Saraf, 2013, SIAM J. Comput..

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound

Shubhangi Saraf, Swastik Kopparty, Sivakanth Gopi, 2016, Electron. Colloquium Comput. Complex..

Incidence Bounds for Block Designs

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

On List Recovery of High-Rate Tensor Codes

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

Arithmetic Circuits with Locally Low Algebraic Rank

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

Recent Progress on Lower Bounds for Arithmetic Circuits

Shubhangi Saraf, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound

Shubhangi Saraf, Swastik Kopparty, Sivakanth Gopi, 2018, IEEE Trans. Inf. Theory.

Local List-Decoding and Testing of Random Linear Codes from High Error

Shubhangi Saraf, Swastik Kopparty, 2013, SIAM J. Comput..

Finite Field Kakeya and Nikodym Sets in Three Dimensions

Shubhangi Saraf, Charles Wolf, Ben D. Lund, 2018, SIAM J. Discret. Math..

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.

Black-Box Identity Testing of Depth-4 Multilinear Circuits

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

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

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

Towards an algebraic natural proofs barrier via polynomial identity testing pdf

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

Lower Bounds for Approximate LDCs

Guangda Hu, Zeev Dvir, Shubhangi Saraf, 2014, ICALP.

Reconstruction of Depth-$4$ Multilinear Circuits

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

The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In

Shubhangi Saraf, Mrinal Kumar, 2015, SIAM J. Comput..

Maximally Recoverable Codes for Grid-like Topologies

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

Tolerant Linearity Testing and Locally Testable Codes

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

The method of multiplicities

Shubhangi Saraf, Shubhangi Saraf, 2011 .

Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits

Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava, 2021, Empir. Softw. Eng..

A mini course on additive combinatorics

Wolfgang Mulzer, Shubhangi Saraf, Aaron Roth, 2007 .

Kakeya-type sets in finite vector spaces

Madhu Sudan, Shubhangi Saraf, Vsevolod F. Lev, 2010 .

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

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

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

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