Travelled to:1 × Denmark
4 × USA
Collaborated with:S.Kopparty M.Kumar Z.Dvir I.Volkovich A.Wigderson S.Yekhanin J.Briët G.Hu E.Ben-Sasson A.Gabizon Y.Kaplan
Talks about:code (4) depth (3) arithmet (2) circuit (2) lower (2) local (2) decod (2) bound (2) test (2) high (2)
Person: Shubhangi Saraf
DBLP: Saraf:Shubhangi
Contributed to:
2014
2014201320112010Wrote 8 papers:
- ICALP-v1-2014-BrietDHS #approximate #bound
- Lower Bounds for Approximate LDCs (JB, ZD, GH, SS), pp. 259–270.
- ICALP-v1-2014-KumarS #bound
- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits (MK, SS), pp. 751–762.
- STOC-2014-DvirSW #polynomial
- Breaking the quadratic barrier for 3-LCC’s over the reals (ZD, SS, AW), pp. 784–793.
- STOC-2014-KumarS #all about #reduction
- The limits of depth reduction for arithmetic formulas: it’s all about the top fan-in (MK, SS), pp. 136–145.
- STOC-2013-Ben-SassonGKKS #algebra #geometry #product line
- A new family of locally correctable codes based on degree-lifted algebraic geometry codes (EBS, AG, YK, SK, SS), pp. 833–842.
- STOC-2011-KoppartySY
- High-rate codes with sublinear-time decoding (SK, SS, SY), pp. 167–176.
- STOC-2011-SarafV #black box #multi #testing
- Black-box identity testing of depth-4 multilinear circuits (SS, IV), pp. 421–430.
- STOC-2010-KoppartyS #fault #linear #random #testing
- Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.