pdone.JPGSwastik Kopparty
32-G636, CSAIL, MIT
swastik@theory.csail.mit.edu


I am interested in codes, pseudorandomness and complexity.
My advisor is Prof. Madhu Sudan.

When I grow up, I will do hard mathematics ruthlessly.



Recent Papers (click here for informal summaries)

 

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

with Shubhangi Saraf

 

o   Optimal Testing of Reed-Muller Codes

with Arnab Bhattacharyya, Grant Schoenebeck, Madhu Sudan and David Zuckerman

 

o   Affine Dispersers from Subspace Polynomials

with Eli Ben-Sasson

 

o   Random Graphs and the Parity Quantifier

with Phokion Kolaitis

 

o   Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers (and Extractors)

with Zeev Dvir, Shubhangi Saraf and Madhu Sudan

 

o   Tolerant Linearity Testing and Locally Testable Codes

with Shubhangi Saraf

 

o   On the Communication Complexity of Read-Once AC0 formulae
 with T.S. Jayram and Prasad Raghavendra

 

o   The Universal Capacity of of Channels with Given Rate-Distortion in the absence of Common Randomness
 with Mukul Agarwal and Sanjoy Mitter

o   The Homomorphism Domination Exponent
 with Benjamin Rossman

 

o   Detecting Rational Points on Hypersurfaces over Finite Fields

with Sergey Yekhanin

 

o   Decodability of Group Homomorphisms beyond the Johnson Bound

 with Irit Dinur, Elena Grigorescu and Madhu Sudan

 

o   The Minimum Rank Problem: a counterexample

with K.P.S. Bhaskara Rao

 

o   Local Decoding and Testing of Group Homomorphisms

with Elena Grigorescu and Madhu Sudan

 

o   Subspace Polynomials and List Decoding of Reed-Solomon Codes

with Eli Ben-Sasson and Jaikumar Radhakrishnan