default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShubhangi Saraf
Person information
- affiliation: University of Toronto, Canada
- affiliation (former): Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c35]Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka
:
Lower Bounds for Set-Multilinear Branching Programs. CCC 2024: 20:1-20:20- 2023
- [j22]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. J. ACM 70(5): 31:1-31:57 (2023) - [j21]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52(3): 794-840 (2023) - [c34]Deepanshu Kush, Shubhangi Saraf:
Near-Optimal Set-Multilinear Formula Lower Bounds. CCC 2023: 15:1-15:33 - [c33]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Linear Independence, Alternants, and Applications. STOC 2023: 441-454 - [i60]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR abs/2310.19149 (2023) - [i59]Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Lower Bounds for Set-Multilinear Branching Programs. CoRR abs/2312.15874 (2023) - [i58]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Linear Independence, Alternants and Applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i57]Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka:
Exponential Lower Bounds Against Sums of ROABPs. Electron. Colloquium Comput. Complex. TR23 (2023) - [i56]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i55]Deepanshu Kush, Shubhangi Saraf:
Near-Optimal Set-Multilinear Formula Lower Bounds. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c32]Deepanshu Kush, Shubhangi Saraf:
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. CCC 2022: 38:1-38:16 - [i54]Deepanshu Kush, Shubhangi Saraf:
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. CoRR abs/2205.00611 (2022) - [i53]Deepanshu Kush, Shubhangi Saraf:
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j20]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67(1): 296-316 (2021) - [c31]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits. STOC 2021: 809-822 - [i52]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. CoRR abs/2105.01751 (2021) - [i51]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j19]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. J. ACM 67(2): 8:1-8:28 (2020) - [c30]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. FOCS 2020: 900-909 - [c29]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS 2020: 5:1-5:32 - [c28]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-4 Multilinear Circuits. SODA 2020: 2144-2160 - [e1]Shubhangi Saraf:
35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference). LIPIcs 169, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-156-6 [contents] - [i50]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i49]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2020: 654 (2020)
2010 – 2019
- 2019
- [j18]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. Discret. Comput. Geom. 61(4): 778-808 (2019) - [c27]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM 2019: 68:1-68:22 - [i48]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling outside the box improves soundness. CoRR abs/1903.12243 (2019) - [i47]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i46]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-$4$ Multilinear Circuits. Electron. Colloquium Comput. Complex. TR19 (2019) - [i45]Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. TR19 (2019) - [i44]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. 2019: 336 (2019) - 2018
- [j17]Shubhangi Saraf, Ilya Volkovich:
Black-Box Identity Testing of Depth-4 Multilinear Circuits. Comb. 38(5): 1205-1238 (2018) - [j16]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. Int. J. Comput. Geom. Appl. 28(4): 365-379 (2018) - [j15]Ben Lund, Shubhangi Saraf, Charles Wolf:
Finite Field Kakeya and Nikodym Sets in Three Dimensions. SIAM J. Discret. Math. 32(4): 2836-2849 (2018) - [j14]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64(8): 5813-5831 (2018) - [c26]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-Case to Average Case Reductions for the Distance to a Code. CCC 2018: 24:1-24:23 - [c25]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS 2018: 212-223 - [c24]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. FOCS 2018: 485-496 - [i43]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR abs/1805.01498 (2018) - [i42]Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. CoRR abs/1806.06097 (2018) - [i41]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. CoRR abs/1808.06655 (2018) - [i40]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. TR18 (2018) - [i39]Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. Electron. Colloquium Comput. Complex. TR18 (2018) - [i38]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters:
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j13]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM 64(2): 11:1-11:42 (2017) - [j12]Mrinal Kumar, Shubhangi Saraf:
On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput. 46(1): 336-387 (2017) - [j11]Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. Theory Comput. 13(1): 1-33 (2017) - [j10]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. Theory Comput. 13(1): 1-36 (2017) - [c23]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. SoCG 2017: 15:1-15:15 - [c22]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA 2017: 2073-2091 - [c21]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - [i37]Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf:
Towards an algebraic natural proofs barrier via polynomial identity testing. CoRR abs/1701.01717 (2017) - [i36]Joshua A. Grochow, Mrinal Kumar, Michael E. Saks, Shubhangi Saraf:
Towards an algebraic natural proofs barrier via polynomial identity testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i35]Swastik Kopparty, Shubhangi Saraf:
Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j9]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for linear 2-query LCCs over finite fields. Comb. 36(1): 1-36 (2016) - [j8]Ben Lund, Shubhangi Saraf:
Incidence Bounds for Block Designs. SIAM J. Discret. Math. 30(4): 1997-2010 (2016) - [j7]Swastik Kopparty, Shubhangi Saraf:
Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes. SIGACT News 47(3): 46-66 (2016) - [c20]Mrinal Kumar, Shubhangi Saraf:
Arithmetic Circuits with Locally Low Algebraic Rank. CCC 2016: 34:1-34:27 - [c19]Mrinal Kumar, Shubhangi Saraf:
Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing. CCC 2016: 35:1-35:29 - [c18]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC 2016: 202-215 - [r1]Shubhangi Saraf:
Locally Decodable Codes. Encyclopedia of Algorithms 2016: 1149-1152 - [i34]Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. CoRR abs/1605.05412 (2016) - [i33]Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the number of ordinary lines determined by sets in complex space. CoRR abs/1611.08740 (2016) - [i32]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j6]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. 24(2): 295-331 (2015) - [j5]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. SIAM J. Comput. 44(6): 1601-1625 (2015) - [i31]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR abs/1504.05653 (2015) - [i30]Mrinal Kumar, Shubhangi Saraf:
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. CoRR abs/1504.06213 (2015) - [i29]Mrinal Kumar, Shubhangi Saraf:
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. Electron. Colloquium Comput. Complex. TR15 (2015) - [i28]Mrinal Kumar, Shubhangi Saraf:
Arithmetic circuits with locally low algebraic rank. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i26]Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j4]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. J. ACM 61(5): 28:1-28:20 (2014) - [c17]Shubhangi Saraf:
Recent Progress on Lower Bounds for Arithmetic Circuits. CCC 2014: 155-160 - [c16]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. CCC 2014: 169-180 - [c15]Mrinal Kumar, Shubhangi Saraf:
On the Power of Homogeneous Depth 4 Arithmetic Circuits. FOCS 2014: 364-373 - [c14]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. ICALP (1) 2014: 259-270 - [c13]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. ICALP (1) 2014: 751-762 - [c12]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. LATIN 2014: 306-317 - [c11]Mrinal Kumar, Shubhangi Saraf:
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in. STOC 2014: 136-145 - [c10]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCC's over the reals. STOC 2014: 784-793 - [i25]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDC. CoRR abs/1402.6952 (2014) - [i24]Mrinal Kumar, Shubhangi Saraf:
On the power of homogeneous depth 4 arithmetic circuits. CoRR abs/1404.1950 (2014) - [i23]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i22]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. TR14 (2014) - [i21]Mrinal Kumar, Shubhangi Saraf:
On the power of homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Swastik Kopparty, Shubhangi Saraf:
Local List-Decoding and Testing of Random Linear Codes from High Error. SIAM J. Comput. 42(3): 1302-1326 (2013) - [j2]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. SIAM J. Comput. 42(6): 2305-2328 (2013) - [c9]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC 2013: 833-842 - [i20]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. CoRR abs/1307.8268 (2013) - [i19]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. CoRR abs/1311.5102 (2013) - [i18]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. CoRR abs/1311.6716 (2013) - [i17]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR abs/1312.5978 (2013) - [i16]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. Electron. Colloquium Comput. Complex. TR13 (2013) - [i15]Mrinal Kumar, Shubhangi Saraf:
Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electron. Colloquium Comput. Complex. TR13 (2013) - [i14]Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in. Electron. Colloquium Comput. Complex. TR13 (2013) - [i13]Mrinal Kumar, Shubhangi Saraf:
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i12]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs/1211.0330 (2012) - [i11]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. CoRR abs/1211.0331 (2012) - [i10]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i9]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i8]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b1]Shubhangi Saraf:
The method of multiplicities. Massachusetts Institute of Technology, Cambridge, MA, USA, 2011 - [c8]Shubhangi Saraf, Sergey Yekhanin:
Noisy Interpolation of Sparse Polynomials, and Applications. CCC 2011: 86-92 - [c7]Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf:
Tight Lower Bounds for 2-query LCCs over Finite Fields. FOCS 2011: 638-647 - [c6]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. STOC 2011: 167-176 - [c5]Shubhangi Saraf, Ilya Volkovich:
Black-box identity testing of depth-4 multilinear circuits. STOC 2011: 421-430 - [i7]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for 2-query LCCs over finite fields. Electron. Colloquium Comput. Complex. TR11 (2011) - [i6]Shubhangi Saraf, Ilya Volkovich:
Black-Box Identity Testing of Depth-4 Multilinear Circuits. Electron. Colloquium Comput. Complex. TR11 (2011) - [i5]Shubhangi Saraf, Sergey Yekhanin:
Noisy Interpolation of Sparse Polynomials, and Applications. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c4]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high error. STOC 2010: 417-426 - [p1]Swastik Kopparty, Shubhangi Saraf:
Some Recent Results on Local Testing of Sparse Linear Codes. Property Testing 2010: 320-333 - [i4]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Shubhangi Saraf:
Acute and nonobtuse triangulations of polyhedral surfaces. Eur. J. Comb. 30(4): 833-840 (2009) - [c3]Swastik Kopparty, Shubhangi Saraf:
Tolerant Linearity Testing and Locally Testable Codes. APPROX-RANDOM 2009: 601-614 - [c2]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. FOCS 2009: 181-190 - [c1]Neeraj Kayal, Shubhangi Saraf:
Blackbox Polynomial Identity Testing for Depth 3 Circuits. FOCS 2009: 198-207 - [i3]Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan:
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]Neeraj Kayal, Shubhangi Saraf:
Blackbox Polynomial Identity Testing for Depth 3 Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - [i1]Swastik Kopparty, Shubhangi Saraf:
Local list-decoding and testing of random linear codes from high-error. Electron. Colloquium Comput. Complex. TR09 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
