Travelled to:1 × Canada
1 × Denmark
1 × France
1 × Japan
4 × USA
Collaborated with:S.Saraf E.Ben-Sasson ∅ P.G.Kolaitis A.Bhangale S.Sachdeva M.Kumar M.E.Saks S.Yekhanin V.Guruswami J.Håstad S.Gupta C.V.Ravishankar I.Dinur E.Grigorescu M.Sudan A.Gabizon Y.Kaplan
Talks about:code (6) decod (4) random (3) polynomi (2) linear (2) local (2) finit (2) field (2) list (2) high (2)
Person: Swastik Kopparty
DBLP: Kopparty:Swastik
Contributed to:
20152014
20132011201020092008
2004Wrote 11 papers:
- ICALP-v1-2015-BhangaleKS #approximate #constraints #problem
- Simultaneous Approximation of Constraint Satisfaction Problems (AB, SK, SS), pp. 193–205.
- ICALP-v1-2014-KoppartyKS #finite #performance
- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (SK, MK, MES), pp. 726–737.
- 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-Kopparty #complexity #finite #on the
- On the complexity of powering in finite fields (SK), pp. 489–498.
- STOC-2011-KoppartySY
- High-rate codes with sublinear-time decoding (SK, SS, SY), pp. 167–176.
- STOC-2010-GuruswamiHK #linear #on the #random
- On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.
- STOC-2010-KoppartyS #fault #linear #random #testing
- Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.
- STOC-2009-Ben-SassonK
- Affine dispersers from subspace polynomials (EBS, SK), pp. 65–74.
- STOC-2009-KolaitisK #graph #quantifier #random
- Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
- STOC-2008-DinurGKS #bound #morphism
- Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
- PODS-2004-GuptaKR #query
- Roads, Codes and Spatiotemporal Queries (SG, SK, CVR), pp. 115–124.