Geometric rank of tensors and subrank of matrix multiplication von Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam

Volltext

On the List-Decodability of Random Linear Codes von Guruswami, Venkatesan, Håstad, Johan, Kopparty, Swastik

Volltext

Affine Dispersers from Subspace Polynomials von Ben-Sasson, Eli, Kopparty, Swastik

Volltext

Local List-Decoding and Testing of Random Linear Codes from High Error von Kopparty, Swastik, Saraf, Shubhangi

Volltext

On strictly nonzero integer-valued charges von KOPPARTY, SWASTIK, RAO, K. P. S. BHASKARA

Volltext

Random Graphs and the Parity Quantifier von KOLAITIS, Phokion G, KOPPARTY, Swastik

Volltext

Explicit subspace designs von Guruswami, Venkatesan, Kopparty, Swastik

Volltext

List-Decoding Algorithms for Lifted Codes von Guo, Alan, Kopparty, Swastik

Volltext

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity von Kopparty, Swastik, Meir, Or, Ron-Zewi, Noga, Saraf, Shubhangi

Volltext

High-rate codes with sublinear-time decoding von Kopparty, Swastik, Saraf, Shubhangi, Yekhanin, Sergey

Volltext

A local central limit theorem for triangles in a random graph von Gilmer, Justin, Kopparty, Swastik

Volltext

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes von Kopparty, Swastik, Ron-Zewi, Noga, Saraf, Shubhangi, Wootters, Mary

Volltext

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers von Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

Volltext

On List Recovery of High-Rate Tensor Codes von Kopparty, Swastik, Resch, Nicolas, Ron-Zewi, Noga, Saraf, Shubhangi, Silas, Shashwat

Volltext

Proximity Gaps for Reed–Solomon Codes von Ben-Sasson, Eli, Carmon, Dan, Ishai, Yuval, Kopparty, Swastik, Saraf, Shubhangi

Volltext

Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound von Gopi, Sivakanth, Kopparty, Swastik, Oliveira, Rafael, Ron-Zewi, Noga, Saraf, Shubhangi

Volltext

Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016) von Dinur, Irit, Meir, Or, Kopparty, Swastik

Volltext

The homomorphism domination exponent von Kopparty, Swastik, Rossman, Benjamin

Volltext

Equivalence of Polynomial Identity Testing and Polynomial Factorization von Kopparty, Swastik, Saraf, Shubhangi, Shpilka, Amir

Volltext

Roots and coefficients of polynomials over finite fields von Kopparty, Swastik, Wang, Qiang

Volltext