Swastik Kopparty

	2012
34		Swastik Kopparty: List-Decoding Multiplicity Codes. Electronic Colloquium on Computational Complexity (ECCC) 19: 44 (2012)
	2011
33		Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin: High-rate codes with sublinear-time decoding. STOC 2011: 167-176
32		Swastik Kopparty: On the complexity of powering in finite fields. STOC 2011: 489-498
31		Swastik Kopparty, Benjamin Rossman: The homomorphism domination exponent. Eur. J. Comb. 32(7): 1097-1114 (2011)
30		Venkatesan Guruswami, Johan Håstad, Swastik Kopparty: On the List-Decodability of Random Linear Codes. IEEE Transactions on Information Theory 57(2): 718-725 (2011)
29		Swastik Kopparty: Review of algebraic function fields and codes by Henning Stichtenoth. SIGACT News 42(2): 19-24 (2011)
	2010
28		Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes. FOCS 2010: 488-497
27		Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes. Property Testing 2010: 269-275
26		Swastik Kopparty, Shubhangi Saraf: Some Recent Results on Local Testing of Sparse Linear Codes. Property Testing 2010: 320-333
25		Venkatesan Guruswami, Johan Håstad, Swastik Kopparty: On the list-decodability of random linear codes. STOC 2010: 409-416
24		Swastik Kopparty, Shubhangi Saraf: Local list-decoding and testing of random linear codes from high error. STOC 2010: 417-426
23		Venkatesan Guruswami, Johan Håstad, Swastik Kopparty: On the List-Decodability of Random Linear Codes CoRR abs/1001.1386: (2010)
22		Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin: High-rate codes with sublinear-time decoding. Electronic Colloquium on Computational Complexity (ECCC) 17: 148 (2010)
21		Venkatesan Guruswami, Johan Håstad, Swastik Kopparty: On the List-Decodability of Random Linear Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 3 (2010)
20		Eli Ben-Sasson, Swastik Kopparty: Affine Dispersers from Subspace Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 44 (2010)
19		Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan: Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Transactions on Information Theory 56(1): 113-120 (2010)
	2009
18		Swastik Kopparty, Shubhangi Saraf: Tolerant Linearity Testing and Locally Testable Codes. APPROX-RANDOM 2009: 601-614
17		Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. FOCS 2009: 181-190
16		T. S. Jayram, Swastik Kopparty, Prasad Raghavendra: On the Communication Complexity of Read-Once AC^0 Formulae. IEEE Conference on Computational Complexity 2009: 329-340
15		Eli Ben-Sasson, Swastik Kopparty: Affine dispersers from subspace polynomials. STOC 2009: 65-74
14		Phokion G. Kolaitis, Swastik Kopparty: Random graphs and the parity quantifier. STOC 2009: 705-714
13		Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal Testing of Reed-Muller Codes CoRR abs/0910.0641: (2009)
12		Swastik Kopparty, Shubhangi Saraf: Local list-decoding and testing of random linear codes from high-error. Electronic Colloquium on Computational Complexity (ECCC) 16: 115 (2009)
11		Phokion G. Kolaitis, Swastik Kopparty: Random Graphs and the Parity Quantifier. Electronic Colloquium on Computational Complexity (ECCC) 16: 33 (2009)
10		Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan: Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers. Electronic Colloquium on Computational Complexity (ECCC) 16: 4 (2009)
9		Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman: Optimal testing of Reed-Muller codes. Electronic Colloquium on Computational Complexity (ECCC) 16: 86 (2009)
	2008
8		Swastik Kopparty, Sergey Yekhanin: Detecting Rational Points on Hypersurfaces over Finite Fields. IEEE Conference on Computational Complexity 2008: 311-320
7		Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284
6		Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of Group Homomorphisms beyond the Johnson Bound. Electronic Colloquium on Computational Complexity (ECCC) 15(020): (2008)
	2006
5		Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Local Decoding and Testing for Homomorphisms. APPROX-RANDOM 2006: 375-385
4		Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan: Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS 2006: 207-216
3		Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan: How to Construct a Correct and Scalable iBGP Configuration. INFOCOM 2006
	2005
2		Swastik Kopparty, Chinya V. Ravishankar: A framework for pursuit evasion games in Rn. Inf. Process. Lett. 96(3): 114-122 (2005)
	2004
1		Sandeep Gupta, Swastik Kopparty, Chinya V. Ravishankar: Roads, Codes and Spatiotemporal Queries. PODS 2004: 115-124

Coauthor Index

1	Hari Balakrishnan	[3]
2	Eli Ben-Sasson	[4] [15] [19] [20]
3	Arnab Bhattacharyya	[9] [13] [27] [28]
4	Irit Dinur	[6] [7]
5	Zeev Dvir	[10] [17]
6	Elena Grigorescu	[5] [6] [7]
7	Sandeep Gupta	[1]
8	Venkatesan Guruswami	[21] [23] [25] [30]
9	Johan Håstad	[21] [23] [25] [30]
10	T. S. Jayram (Jayram S. Thathachar)	[16]
11	Phokion G. Kolaitis	[11] [14]
12	Jaikumar Radhakrishnan	[4] [19]
13	Prasad Raghavendra	[16]
14	Chinya V. Ravishankar	[1] [2]
15	Benjamin Rossman	[31]
16	Shubhangi Saraf	[10] [12] [17] [18] [22] [24] [26] [33]
17	Grant Schoenebeck	[9] [13] [27] [28]
18	Madhu Sudan	[5] [6] [7] [9] [10] [13] [17] [27] [28]
19	Paul Valiant	[3]
20	Mythili Vutukuru	[3]
21	Sergey Yekhanin	[8] [22] [33]
22	David Zuckerman	[9] [13] [27] [28]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page