#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1995

2018

- This year (9)
- Last 5 years (48)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The fairness and throughput of TCP suffer when it is used in mobile ad hoc networks. This is a direct consequence of TCP wrongly attributing packet losses due to link failures (a consequence ofâ€¦ (More)

- Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
- J. ACM
- 2010

Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of locations of aâ€¦ (More)

- Eli Ben-Sasson, Swastik Kopparty
- SIAM J. Comput.
- 2009

An affine disperser over F<sub>2</sub><sup>n</sup> for sources of dimension d is a function f: F<sub>2</sub><sup>n</sup> → F<sub>2</sub> such that for any affine space S ⊆â€¦ (More)

- Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2009

We consider the problem of testing if a given function $f : \F_2^n \right arrow \F_2$ is close to any degree $d$ polynomial in $n$ variables, also known as the Reed-Muller testing problem. %Theâ€¦ (More)

- Swastik Kopparty, Chinya V. Ravishankar
- Inf. Process. Lett.
- 2005

- Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

We show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson and Guruswami-Sudan bounds in the works of S.M. Johnson (1962, 1963) and V. Guruswami and M.â€¦ (More)

- Mythili Vutukuru, Paul Valiant, Swastik Kopparty, Hari Balakrishnan
- Proceedings IEEE INFOCOM 2006. 25TH IEEEâ€¦
- 2006

The Internetâ€™s current interdomain routing protocol, BGP (Border Gateway Protocol), has two modes of operation: eBGP (external BGP), used to exchange routing information between autonomous systems,â€¦ (More)

- Swastik Kopparty, Shubhangi Saraf
- STOC
- 2009

In this paper, we give surprisingly efficient algorithms for list-decoding and testing <i>random</i> linear codes. Our main result is that random sparse linear codes are locally list-decodable andâ€¦ (More)

- Phokion G. Kolaitis, Swastik Kopparty
- J. ACM
- 2009

The classical zero-one law for first-order logic on random graphs says that for every first-order property φ in the theory of graphs and every p ∈ (0,1), the probability that the randomâ€¦ (More)

- Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We extend the "method of multiplicities" to get the following results, of interest in combinatorics and randomness extraction. (A) We show that every Kakeya set (a set of points that contains a lineâ€¦ (More)