Proximity Gaps for Reed-Solomon Codes. - Eli Ben-Sasson; Dan Carmon; Yuval Ishai; Swastik Kopparty; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2020)

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (Electron. Colloquium Comput. Complex., 2021)

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (Electron. Colloquium Comput. Complex., 2022)

Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (IACR Cryptol. ePrint Arch., 2022)

Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences. - Ofir Razon; Yoav Harris; Shahar Gottlieb; Dan Carmon; Ofir David; Ido Kaminer (ICML, 2023)

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields. - Eli Ben-Sasson; Dan Carmon; Swastik Kopparty; David Levit (SODA, 2023)