Talks and presentations

Higher Order MDS Codes

April 12, 2024

Talk, Simons Institue, Berkeley, CA

Link

Joshua Brakensiek, Sivakanth Gopi, Visu Makam, "Generic reed-solomon codes achieve list-decoding capacity", STOC 2023. Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, "Generalized GM-MDS: Polynomial Codes are Higher Order MDS", STOC 2024. Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang, "AG codes achieve list decoding capacity over constant-sized fields", STOC 2024.

Privacy-Preserving Machine Learning

March 19, 2023

Talk, Jovian, Bengaluru, India

Link

A general audience talk on privacy preserving machine learning, specifically on differentially private deep learning.

CSPs with Global Modular Constraints

March 20, 2020

Talk, Institute for Advanced Study (IAS), Princeton, NJ

Link

Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami, "CSPs with global modular constraints: algorithms and hardness via polynomial representations," STOC 2019.

Maximally Recoverable Local Reconstruction Codes

February 08, 2018

Talk, Microsoft Research, Redmond, WA

Link

Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin, "Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities", IEEE Transactions on Information Theory, 2020.

2-Server PIR with Sub-polynomial Communication

September 16, 2016

Talk, Rutgers University, New Brunswick, NJ

Link

Zeev Dvir, Sivakanth Gopi, "2-server PIR with subpolynomial communication." Journal of the ACM (JACM), 2016 and winner of STOC 2015 Best Paper Award. See link for a longer version given by Zeev.