• 750 Citations
  • 15 h-Index
20022019
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Dive into the research topics where Swastik Kopparty is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 6 Similar Profiles
Polynomials Engineering & Materials Science
Decoding Engineering & Materials Science
Reed-Solomon codes Engineering & Materials Science
Testing Engineering & Materials Science
Galois field Mathematics
Codes (standards) Engineering & Materials Science
Polynomial Mathematics
Reed-Muller Codes Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2013 2019

Invariance
Computational complexity
Computer science
Videodisks
Testing
career
mentoring
remedies
communication

Research Output 2002 2019

  • 750 Citations
  • 15 h-Index
  • 35 Conference contribution
  • 26 Article
  • 2 Paper

On list recovery of high-rate tensor codes

Kopparty, S., Resch, N., Ron-Zewi, N., Saraf, S. & Silas, S., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 68. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tensors
Decoding
Recovery

Special section on the fifty-seventhth annual IEEE symposium on foundations of computer science (2016)

Dinur, I., Meir, O. & Kopparty, S., Jan 1 2019, In : SIAM Journal on Computing. 48, 2, 1 p.

Research output: Contribution to journalArticle

Open Access
Computer science
Annual
Computer Science

A Cauchy-Davenport Theorem for Linear Maps

Herdade, S., Kim, J. & Koppartyy, S., Jun 1 2018, In : Combinatorica. 38, 3, p. 601-618 18 p.

Research output: Contribution to journalArticle

Linear map
Cauchy
Theorem
Polynomials
Lower bound
4 Citations (Scopus)

Certifying polynomials for AC 0 [⊕] circuits, with applications to lower bounds and circuit compression

Kopparty, S. & Srinivasan, S., Jan 1 2018, In : Theory of Computing. 14, 12.

Research output: Contribution to journalArticle

Compression
Polynomials
Lower bound
Polynomial
Networks (circuits)
1 Citation (Scopus)

Improved decoding of folded reed-solomon and multiplicity codes

Kopparty, S., Ron-Zewi, N., Saraf, S. & Wootters, M., Nov 30 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 212-223 12 p. 8555107. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Decoding
Reed-Solomon codes
Polynomials
Error correction