Swastik Kopparty
Orcid: 0000-0003-2704-8808Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
Electron. Colloquium Comput. Complex., 2024
2023
SIAM J. Comput., June, 2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
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
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
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
Electron. Colloquium Comput. Complex., 2019
Electron. Colloquium Comput. Complex., 2019
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
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
2017
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.
J. ACM, 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
SIGACT News, 2016
Random Struct. Algorithms, 2016
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound.
Electron. Colloquium Comput. Complex., 2016
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
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Comput. Complex., 2015
2014
Finite Fields Their Appl., 2014
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
2013
SIAM J. Comput., 2013
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.
SIAM J. Comput., 2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013
2012
Electron. Colloquium Comput. Complex., 2012
A new family of locally correctable codes based on degree-lifted algebraic geometry codes.
Electron. Colloquium Comput. Complex., 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
SIGACT News, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
2010
IEEE Trans. Inf. Theory, 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
2009
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
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
Electron. Colloquium Comput. Complex., 2008
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008
2006
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
2004
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004
2002
Proceedings of the Global Telecommunications Conference, 2002