Synthesis from incompatible specifications. - Pavol Cerný; Sivakanth Gopi; Thomas A. Henzinger; Arjun Radhakrishna; Nishant Totla (EMSOFT, 2012)

One-Bit Compressed Sensing: Provable Support and Vector Recovery. - Sivakanth Gopi; Praneeth Netrapalli; Prateek Jain 002; Aditya V. Nori (ICML (3), 2013)

2-Server PIR with sub-polynomial communication. - Zeev Dvir; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2014)

On the Number of Rich Lines in Truly High Dimensional Sets. - Zeev Dvir; Sivakanth Gopi (SoCG, 2015)

Lower bounds for constant query affine-invariant LCCs and LTCs. - Arnab Bhattacharyya 001; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2015)

Competitive analysis of the top-K ranking problem. - Xi Chen 010; Sivakanth Gopi; Jieming Mao; Jon Schneider (CoRR, 2016)

Lower bounds for 2-query LCCs over large alphabet. - Arnab Bhattacharyya 001; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2016)

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. - Sivakanth Gopi; Swastik Kopparty; Rafael Mendes de Oliveira; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2016)

2-Server PIR with Subpolynomial Communication. - Zeev Dvir; Sivakanth Gopi (J. ACM, 2016)

Lower Bounds for 2-Query LCCs over Large Alphabet. - Arnab Bhattacharyya 001; Sivakanth Gopi; Avishay Tal (APPROX-RANDOM, 2017)

Competitive analysis of the top-K ranking problem. - Xi Chen 010; Sivakanth Gopi; Jieming Mao; Jon Schneider (SODA, 2017)

Gaussian width bounds with applications to arithmetic progressions in random settings. - Jop Briët; Sivakanth Gopi (CoRR, 2017)

On Maximally Recoverable Local Reconstruction Codes. - Sivakanth Gopi; Venkatesan Guruswami; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2017)

Spanoids - an abstraction of spanning structures, and a barrier for LCCs. - Zeev Dvir; Sivakanth Gopi; Avi Wigderson (CoRR, 2018)

Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. - Xi Chen 010; Sivakanth Gopi; Jieming Mao; Jon Schneider (IEEE Trans. Inf. Theory, 2018)

Locality in coding theory - Sivakanth Gopi (2018)

CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. - Joshua Brakensiek; Sivakanth Gopi; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2019)

Outlaw Distributions and Locally Decodable Codes. - Jop Briët; Zeev Dvir; Sivakanth Gopi (Theory Comput., 2019)

Locally Private Hypothesis Selection. - Sivakanth Gopi; Gautam Kamath 001; Janardhan Kulkarni; Aleksandar Nikolov; Zhiwei Steven Wu; Huanyu Zhang (COLT, 2020)

Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. - Zeev Dvir; Sivakanth Gopi; Yuzhou Gu; Avi Wigderson (SIAM J. Comput., 2020)

Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities. - Sivakanth Gopi; Venkatesan Guruswami; Sergey Yekhanin (IEEE Trans. Inf. Theory, 2020)

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. - Sundara Rajan Srinivasavaradhan; Sivakanth Gopi; Henry D. Pfister; Sergey Yekhanin (ISIT, 2021)

Fast and Memory Efficient Differentially Private-SGD via JL Projections. - Zhiqi Bu; Sivakanth Gopi; Janardhan Kulkarni; Yin Tat Lee; Judy Hanwen Shen; Uthaipon Tantipongpipat (NeurIPS, 2021)

Differentially Private n-gram Extraction. - Kunho Kim; Sivakanth Gopi; Janardhan Kulkarni; Sergey Yekhanin (NeurIPS, 2021)

Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes. - Joshua Brakensiek; Sivakanth Gopi; Visu Makam (CoRR, 2021)

Improved Maximally Recoverable LRCs using Skew Polynomials. - Sivakanth Gopi; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2021)

Differentially Private Set Union. - Sivakanth Gopi; Pankaj Gulhane; Janardhan Kulkarni; Judy Hanwen Shen; Milad Shokouhi; Sergey Yekhanin (J. Priv. Confidentiality, 2021)

Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. - Joshua Brakensiek; Sivakanth Gopi; Venkatesan Guruswami (SIAM J. Comput., 2022)

Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes. - Joshua Brakensiek; Sivakanth Gopi; Visu Makam (IEEE Trans. Inf. Theory, 2022)

Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler. - Sivakanth Gopi; Yin Tat Lee; Daogao Liu; Ruoqi Shen; Kevin Tian (COLT, 2023)

A construction of Maximally Recoverable LRCs for small number of local groups. - Manik Dhar; Sivakanth Gopi (ISIT, 2023)

Private Convex Optimization in General Norms. - Sivakanth Gopi; Yin Tat Lee; Daogao Liu; Ruoqi Shen; Kevin Tian (SODA, 2023)

Generic Reed-Solomon Codes Achieve List-Decoding Capacity. - Joshua Brakensiek; Sivakanth Gopi; Visu Makam (STOC, 2023)

Textbooks Are All You Need. - Suriya Gunasekar; Yi Zhang 001; Jyoti Aneja; Caio César Teodoro Mendes; Allie Del Giorno; Sivakanth Gopi; Mojan Javaheripi; Piero Kauffmann; Gustavo de Rosa; Olli Saarikivi; Adil Salim; Shital Shah; et al. (CoRR, 2023)

AG codes achieve list decoding capacity over contant-sized fields. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi; Zihan Zhang 001 (CoRR, 2023)

Differentially Private Synthetic Data via Foundation Model APIs 1: Images. - Zinan Lin 001; Sivakanth Gopi; Janardhan Kulkarni; Harsha Nori; Sergey Yekhanin (ICLR, 2024)

Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation. - Xinyu Tang 003; Richard Shin; Huseyin A. Inan; Andre Manoel; Fatemehsadat Mireshghallah; Zinan Lin 001; Sivakanth Gopi; Janardhan Kulkarni; Robert Sim (ICLR, 2024)

Differentially Private Synthetic Data via Foundation Model APIs 2: Text. - Chulin Xie; Zinan Lin 001; Arturs Backurs; Sivakanth Gopi; Da Yu; Huseyin A. Inan; Harsha Nori; Haotian Jiang; Huishuai Zhang; Yin Tat Lee; Bo Li 026; Sergey Yekhanin (ICML, 2024)

Generalized GM-MDS: Polynomial Codes Are Higher Order MDS. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi (STOC, 2024)

Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes. - Joshua Brakensiek; Manik Dhar; Jiyang Gao; Sivakanth Gopi; Matt Larson (CoRR, 2024)

Ranking with Multiple Objectives. - Nikhil R. Devanur; Sivakanth Gopi (CoRR, 2024)

A Geometric Perspective on the Injective Norm of Sums of Random Tensors. - Afonso S. Bandeira; Sivakanth Gopi; Haotian Jiang; Kevin Lucca; Thomas Rothvoss (CoRR, 2024)

Private Convex Optimization via Exponential Mechanism. - Sivakanth Gopi; Yin Tat Lee; Daogao Liu (J. Priv. Confidentiality, 2024)

Numerical Composition of Differential Privacy. - Sivakanth Gopi; Yin Tat Lee; Lukas Wutschitz (J. Priv. Confidentiality, 2024)

Differentially Private Fine-tuning of Language Models. - Da Yu; Saurabh Naik; Arturs Backurs; Sivakanth Gopi; Huseyin A. Inan; Gautam Kamath 001; Janardhan Kulkarni; Yin Tat Lee; Andre Manoel; Lukas Wutschitz; Sergey Yekhanin; Huishuai Zhang (J. Priv. Confidentiality, 2024)

Selective Pre-training for Private Fine-tuning. - Da Yu; Sivakanth Gopi; Janardhan Kulkarni; Zinan Lin 001; Saurabh Naik; Tomasz Lukasz Religa; Jian Yin 001; Huishuai Zhang (Trans. Mach. Learn. Res., 2024)

Improved Field Size Bounds for Higher Order MDS Codes. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi (IEEE Trans. Inf. Theory, 2024)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory. - Jerry Chee; Arturs Backurs; Rainie Heck; Li Zhang; Janardhan Kulkarni; Thomas Rothvoss; Sivakanth Gopi (COLT, 2025)

Tensor Concentration Inequalities: A Geometric Approach. - Afonso S. Bandeira; Sivakanth Gopi; Haotian Jiang; Kevin Lucca; Thomas Rothvoss (STOC, 2025)

On the Emergence of Thinking in LLMs I: Searching for the Right Intuition. - Guanghao Ye; Khiem Duc Pham; Xinzhi Zhang 002; Sivakanth Gopi; Baolin Peng; Beibin Li; Janardhan Kulkarni; Huseyin A. Inan (CoRR, 2025)

AG Codes Achieve List-Decoding Capacity Over Constant-Sized Fields. - Joshua Brakensiek; Manik Dhar; Sivakanth Gopi; Zihan Zhang 001 (IEEE Trans. Inf. Theory, 2025)