Swastik Kopparty
Rutgers University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Swastik Kopparty.
SIAM Journal on Computing | 2013
Zeev Dvir; Swastik Kopparty; Shubhangi Saraf; Madhu Sudan
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction. (i) We show that every Kakeya set in
symposium on the theory of computing | 2011
Swastik Kopparty; Shubhangi Saraf; Sergey Yekhanin
\mathbb{F}_q^n
ieee international conference computer and communications | 2006
Mythili Vutukuru; Paul Valiant; Swastik Kopparty; Hari Balakrishnan
, the
symposium on the theory of computing | 2009
Eli Ben-Sasson; Swastik Kopparty
n
symposium on the theory of computing | 2010
Venkatesan Guruswami; Johan Håstad; Swastik Kopparty
-dimensional vector space over the finite field on
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques | 2009
Swastik Kopparty; Shubhangi Saraf
q
SIAM Journal on Computing | 2012
Eli Ben-Sasson; Swastik Kopparty
elements, must be of size at least
foundations of computer science | 2013
Venkatesan Guruswami; Swastik Kopparty
q^n/2^n
symposium on the theory of computing | 2016
Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf
. This bound is tight to within a
conference on computational complexity | 2014
Swastik Kopparty; Shubhangi Saraf; Amir Shpilka
2+o(1)
Collaboration
Dive into the Swastik Kopparty's collaboration.
