Swastik Kopparty

Orcid: 0000-0003-2704-8808

Affiliations:
  • University of Toronto, Department of Mathematics and Department of Computer Science, Canada
  • Rutgers University, USA (former)


According to our database1, Swastik Kopparty authored at least 76 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Character sums over AG codes.
Electron. Colloquium Comput. Complex., 2024

Small Shadow Partitions.
Electron. Colloquium Comput. Complex., 2024

High Rate Multivariate Polynomial Evaluation Codes.
Electron. Colloquium Comput. Complex., 2024

Improved PIR Schemes using Matching Vectors and Derivatives.
Electron. Colloquium Comput. Complex., 2024

Error-Correcting Graph Codes.
CoRR, 2024

2023
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes.
SIAM J. Comput., June, 2023

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes.
Electron. Colloquium Comput. Complex., 2023

Extracting Mergers and Projections of Partitions.
Electron. Colloquium Comput. Complex., 2023

On the degree of polynomials computing square roots mod p.
Electron. Colloquium Comput. Complex., 2023

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time <i>O(n</i> log <i>n</i>) over all Finite Fields.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II).
IACR Cryptol. ePrint Arch., 2022

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves.
Electron. Colloquium Comput. Complex., 2022

2021
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields.
Electron. Colloquium Comput. Complex., 2021

2020
Geometric Rank of Tensors and Subrank of Matrix Multiplication.
Electron. Colloquium Comput. Complex., 2020

Proximity Gaps for Reed-Solomon Codes.
Electron. Colloquium Comput. Complex., 2020

2019
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016).
SIAM J. Comput., 2019

Quasilinear time list-decodable codes for space bounded channels.
Electron. Colloquium Comput. Complex., 2019

On List Recovery of High-Rate Tensor Codes.
Electron. Colloquium Comput. Complex., 2019

DEEP-FRI: Sampling Outside the Box Improves Soundness.
Electron. Colloquium Comput. Complex., 2019

2018
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression.
Theory Comput., 2018

Improved decoding of Folded Reed-Solomon and Multiplicity Codes.
Electron. Colloquium Comput. Complex., 2018

On Multilinear Forms: Bias, Correlation, and Tensor Rank.
Electron. Colloquium Comput. Complex., 2018

Worst-case to average case reductions for the distance to a code.
Electron. Colloquium Comput. Complex., 2018

A Cauchy-Davenport Theorem for Linear Maps.
Comb., 2018

Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-optimal approximation algorithm for simultaneous Max-Cut.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Decoding Reed-Muller Codes over Product Sets.
Theory Comput., 2017

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.
J. ACM, 2017

Local Testing and Decoding of High-Rate Error-Correcting Codes.
Electron. Colloquium Comput. Complex., 2017

Maximally Recoverable Codes for Grid-like Topologies.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
List-Decoding Algorithms for Lifted Codes.
IEEE Trans. Inf. Theory, 2016

Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes.
SIGACT News, 2016

A local central limit theorem for triangles in a random graph.
Random Struct. Algorithms, 2016

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound.
Electron. Colloquium Comput. Complex., 2016

Robust positioning patterns.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity.
Electron. Colloquium Comput. Complex., 2015

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity.
Electron. Colloquium Comput. Complex., 2015

Efficient indexing of necklaces and irreducible polynomials over finite fields.
Electron. Colloquium Comput. Complex., 2015

The complexity of computing the minimum rank of a sign pattern matrix.
CoRR, 2015

Equivalence of Polynomial Identity Testing and Polynomial Factorization.
Comput. Complex., 2015

2014
Roots and coefficients of polynomials over finite fields.
Finite Fields Their Appl., 2014

Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2014

Simultaneous Approximation of Constraint Satisfaction Problems.
Electron. Colloquium Comput. Complex., 2014

2013
Local List-Decoding and Testing of Random Linear Codes from High Error.
SIAM J. Comput., 2013

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.
SIAM J. Comput., 2013

Explicit Subspace Designs.
Electron. Colloquium Comput. Complex., 2013

Constant rate PCPs for circuit-SAT with sublinear query complexity.
Electron. Colloquium Comput. Complex., 2013

Some remarks on multiplicity codes.
Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013

2012
Affine Dispersers from Subspace Polynomials.
SIAM J. Comput., 2012

Certifying Polynomials for AC<sup>0</sup>[⊕] circuits, with applications.
Electron. Colloquium Comput. Complex., 2012

List-Decoding Multiplicity Codes.
Electron. Colloquium Comput. Complex., 2012

New affine-invariant codes from lifting.
Electron. Colloquium Comput. Complex., 2012

A new family of locally correctable codes based on degree-lifted algebraic geometry codes.
Electron. Colloquium Comput. Complex., 2012

Certifying polynomials for AC^0(parity) circuits, with applications.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Review of algebraic function fields and codes by Henning Stichtenoth.
SIGACT News, 2011

The homomorphism domination exponent.
Eur. J. Comb., 2011

On the complexity of powering in finite fields.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Algebraic methods in randomness and pseudorandomness.
PhD thesis, 2010

Subspace polynomials and limits to list decoding of Reed-Solomon codes.
IEEE Trans. Inf. Theory, 2010

High-rate codes with sublinear-time decoding.
Electron. Colloquium Comput. Complex., 2010

On the List-Decodability of Random Linear Codes.
Electron. Colloquium Comput. Complex., 2010

Some Recent Results on Local Testing of Sparse Linear Codes.
Proceedings of the Property Testing - Current Research and Surveys, 2010

Optimal Testing of Reed-Muller Codes.
Proceedings of the Property Testing - Current Research and Surveys, 2010

2009
Random Graphs and the Parity Quantifier.
Electron. Colloquium Comput. Complex., 2009

Optimal testing of Reed-Muller codes.
Electron. Colloquium Comput. Complex., 2009

On the Communication Complexity of Read-Once AC^0 Formulae.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

Tolerant Linearity Testing and Locally Testable Codes.
Proceedings of the Approximation, 2009

Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Decodability of Group Homomorphisms beyond the Johnson Bound.
Electron. Colloquium Comput. Complex., 2008

Detecting Rational Points on Hypersurfaces over Finite Fields.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2006
How to Construct a Correct and Scalable iBGP Configuration.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Subspace Polynomials and List Decoding of Reed-Solomon Codes.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Local Decoding and Testing for Homomorphisms.
Proceedings of the Approximation, 2006

2005
A framework for pursuit evasion games in R<sup>n</sup>.
Inf. Process. Lett., 2005

2004
Roads, Codes and Spatiotemporal Queries.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

2002
Split TCP for mobile ad hoc networks.
Proceedings of the Global Telecommunications Conference, 2002


  Loading...