Partition codes. - Arkadii G. D'yachkov; Vyacheslav V. Rykov; David C. Torney; Sergey Yekhanin (ISIT, 2004)

Trivial two-stage group testing for complexes using almost disjunct matrices. - Anthony J. Macula; Vyacheslav V. Rykov; Sergey Yekhanin (Discret. Appl. Math., 2004)

Improved Upper Bound for the Redundancy of Fix-Free Codes. - Sergey Yekhanin (IEEE Trans. Inf. Theory, 2004)

Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. - Sergey Yekhanin; Ilya Dumer (IEEE Trans. Inf. Theory, 2004)

The complexity of matrix completion. - Nicholas J. A. Harvey; David R. Karger; Sergey Yekhanin (SODA, 2006)

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. - Alexander A. Razborov; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2006)

New Locally Decodable Codes and Private Information Retrieval Schemes. - Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2006)

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. - Nicholas J. A. Harvey; Mihai Patrascu; Yonggang Wen 001; Sergey Yekhanin; Vincent W. S. Chan (INFOCOM, 2007)

A note on plane pointless curves. - Sergey Yekhanin (Finite Fields Their Appl., 2007)

A Geometric Approach to Information-Theoretic Private Information Retrieval. - David P. Woodruff; Sergey Yekhanin (SIAM J. Comput., 2007)

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. - Alexander A. Razborov; Sergey Yekhanin (Theory Comput., 2007)

LDCs and PIRs. - Sergey Yekhanin (2007)

Detecting Rational Points on Hypersurfaces over Finite Fields. - Swastik Kopparty; Sergey Yekhanin (CCC, 2008)

New Efficient Attacks on Statistical Disclosure Control Mechanisms. - Cynthia Dwork; Sergey Yekhanin (CRYPTO, 2008)

Deterministic Approximation Algorithms for the Nearest Codeword Problem. - Noga Alon; Rina Panigrahy; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2008)

Towards 3-query locally decodable codes of subexponential length. - Sergey Yekhanin (J. ACM, 2008)

Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. - Kiran S. Kedlaya; Sergey Yekhanin (SIAM J. Comput., 2009)

Pan-Private Streaming Algorithms. - Cynthia Dwork; Moni Naor; Toniann Pitassi; Guy N. Rothblum; Sergey Yekhanin (ICS, 2010)

Private information retrieval. - Sergey Yekhanin (Commun. ACM, 2010)

High-rate codes with sublinear-time decoding. - Swastik Kopparty; Shubhangi Saraf; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2010)

Locally Decodable Codes and Private Information Retrieval Schemes - Sergey Yekhanin (Springer, 2010)

Locally Decodable Codes: A Brief Survey. - Sergey Yekhanin (IWCC, 2011)

On the Locality of Codeword Symbols. - Parikshit Gopalan; Cheng Huang 002; Huseyin Simitci; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2011)

Noisy Interpolation of Sparse Polynomials, and Applications. - Shubhangi Saraf; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2011)

Sets with large additive energy and symmetric sets. - Ilya D. Shkredov; Sergey Yekhanin (J. Comb. Theory A, 2011)

Matching Vector Codes. - Zeev Dvir; Parikshit Gopalan; Sergey Yekhanin (SIAM J. Comput., 2011)

Erasure Coding in Windows Azure Storage. - Cheng Huang 002; Huseyin Simitci; Yikang Xu; Aaron Ogus; Brad Calder; Parikshit Gopalan; Jin Li 001; Sergey Yekhanin (USENIX ATC, 2012)

A note on the Newton radius. - Alex Samorodnitsky; Sergey Yekhanin (Discret. Math., 2012)

Locally Decodable Codes. - Sergey Yekhanin (Found. Trends Theor. Comput. Sci., 2012)

Zombie memory: extending memory lifetime by reviving dead blocks. - Rodolfo Azevedo; John D. Davis; Karin Strauss; Parikshit Gopalan; Mark S. Manasse; Sergey Yekhanin (ISCA, 2013)

Explicit Maximally Recoverable Codes with Locality. - Parikshit Gopalan; Cheng Huang 002; Bob Jenkins; Sergey Yekhanin (Electron. Colloquium Comput. Complex., 2013)

On the locality of codeword symbols in non-linear codes. - Michael A. Forbes 001; Sergey Yekhanin (Discret. Math., 2014)

New constructions of SD and MR codes over small finite fields. - Guangda Hu; Sergey Yekhanin (ISIT, 2016)

Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. - Alex Samorodnitsky; Ilya D. Shkredov; Sergey Yekhanin (Comput. Complex., 2016)

Maximally Recoverable Codes for Grid-like Topologies. - Parikshit Gopalan; Guangda Hu; Shubhangi Saraf; Carol Wang; Sergey Yekhanin (CoRR, 2016)

Collecting Telemetry Data Privately. - Bolin Ding; Janardhan Kulkarni; Sergey Yekhanin (NIPS, 2017)

Clustering Billions of Reads for DNA Data Storage. - Cyrus Rashtchian; Konstantin Makarychev; Miklós Z. Rácz; Siena Ang; Djordje Jevdjic; Sergey Yekhanin; Luis Ceze; Karin Strauss (NIPS, 2017)

Maximally Recoverable Codes for Grid-like Topologies. - Parikshit Gopalan; Guangda Hu; Swastik Kopparty; Shubhangi Saraf; Carol Wang; Sergey Yekhanin (SODA, 2017)

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

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. - Joshua Allen; Bolin Ding; Janardhan Kulkarni; Harsha Nori; Olga Ohrimenko; Sergey Yekhanin (NeurIPS, 2019)

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)

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

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

Batch Optimization for DNA Synthesis. - Konstantin Makarychev; Miklós Z. Rácz; Cyrus Rashtchian; Sergey Yekhanin (IEEE Trans. Inf. Theory, 2022)

Challenges towards the Next Frontier in Privacy. - Rachel Cummings; Damien Desfontaines; David Evans 001; Roxana Geambasu; Matthew Jagielski; Yangsibo Huang; Peter Kairouz; Gautam Kamath 001; Sewoong Oh; Olga Ohrimenko; Nicolas Papernot; Ryan Rogers 002; et al. (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)

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)

Linear Combination of Saved Checkpoints Makes Consistency and Diffusion Models Better. - Enshu Liu; Junyi Zhu 002; Zinan Lin 001; Xuefei Ning; Matthew B. Blaschko; Sergey Yekhanin; Shengen Yan; Guohao Dai; Huazhong Yang; Yu Wang 002 (CoRR, 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)

Linear Combination of Saved Checkpoints Makes Consistency and Diffusion Models Better. - Enshu Liu; Junyi Zhu 002; Zinan Lin 001; Xuefei Ning; Shuaiqi Wang; Matthew B. Blaschko; Sergey Yekhanin; Shengen Yan; Guohao Dai; Huazhong Yang; Yu Wang 002 (ICLR, 2025)

Differentially Private Synthetic Data via APIs 3: Using Simulators Instead of Foundation Model. - Zinan Lin 001; Tadas Baltrusaitis; Sergey Yekhanin (CoRR, 2025)