Shubhangi Saraf

From MaRDI portal
Person:644690

Available identifiers

zbMath Open saraf.shubhangiWikidataQ102396993 ScholiaQ102396993MaRDI QIDQ644690

List of research outcomes

PublicationDate of PublicationType
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits2023-11-14Paper
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes2023-07-06Paper
https://portal.mardi4nfdi.de/entity/Q58755282023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756972023-02-03Paper
On List Recovery of High-Rate Tensor Codes2021-02-22Paper
Reconstruction of Depth-4 Multilinear Circuits2021-02-02Paper
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree2020-11-11Paper
https://portal.mardi4nfdi.de/entity/Q51219122020-09-22Paper
On the number of ordinary lines determined by sets in complex space2019-05-21Paper
Helly-Type Theorems in Property Testing2019-04-24Paper
DEEP-FRI: Sampling outside the box improves soundness2019-03-28Paper
Black-box identity testing of depth-4 multilinear circuits2019-02-01Paper
Finite Field Kakeya and Nikodym Sets in Three Dimensions2018-12-12Paper
On the number of ordinary lines determined by sets in complex space2018-08-13Paper
Maximally Recoverable Codes for Grid-like Topologies2018-07-16Paper
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q45913732017-11-14Paper
https://portal.mardi4nfdi.de/entity/Q53689012017-10-11Paper
https://portal.mardi4nfdi.de/entity/Q53687682017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53687692017-10-10Paper
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity2017-09-29Paper
Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.2017-03-31Paper
On the Power of Homogeneous Depth 4 Arithmetic Circuits2017-03-10Paper
Towards an algebraic natural proofs barrier via polynomial identity testing2017-01-06Paper
Incidence Bounds for Block Designs2016-10-28Paper
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In2015-11-18Paper
High-rate codes with sublinear-time decoding2015-08-14Paper
The limits of depth reduction for arithmetic formulas2015-06-26Paper
Breaking the quadratic barrier for 3-LCC's over the reals2015-06-26Paper
Equivalence of polynomial identity testing and polynomial factorization2015-06-23Paper
SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY2014-09-01Paper
IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM2014-09-01Paper
Local list-decoding and testing of random linear codes from high error2014-08-13Paper
Tight Lower Bounds for 2-query LCCs over Finite Fields2014-07-30Paper
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers2014-07-25Paper
Blackbox Polynomial Identity Testing for Depth 3 Circuits2014-07-25Paper
Lower Bounds for Approximate LDCs2014-07-01Paper
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits2014-07-01Paper
High-rate codes with sublinear-time decoding2014-06-05Paper
Black-box identity testing of depth-4 multilinear circuits2014-06-05Paper
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers2014-04-11Paper
Helly-Type Theorems in Property Testing2014-03-31Paper
Local List-Decoding and Testing of Random Linear Codes from High Error2013-09-25Paper
Kakeya-type sets in finite vector spaces2011-11-07Paper
Some Recent Results on Local Testing of Sparse Linear Codes2010-10-12Paper
Tolerant Linearity Testing and Locally Testable Codes2009-10-28Paper
An improved lower bound on the size of Kakeya sets over finite fields2009-09-17Paper
Acute and nonobtuse triangulations of polyhedral surfaces2009-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shubhangi Saraf