Sergey Yekhanin

According to our database¹, Sergey Yekhanin authored at least 49 papers between 2004 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Differentially Private Synthetic Data via Foundation Model APIs 2: Text.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Differentially Private Synthetic Data via Foundation Model APIs 1: Images.

[BibT_eX]

[DOI]

CoRR, 2023

Challenges towards the Next Frontier in Privacy.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Batch Optimization for DNA Synthesis.

[BibT_eX]

[DOI]

Konstantin Makarychev

Miklós Z. Rácz

Cyrus Rashtchian

Sergey Yekhanin

IEEE Trans. Inf. Theory, 2022

Differentially Private Fine-tuning of Language Models.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Differentially Private Set Union.

[BibT_eX]

[DOI]

J. Priv. Confidentiality, 2021

Differentially Private n-gram Extraction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage.

[BibT_eX]

[DOI]

Sundara Rajan Srinivasavaradhan

Sivakanth Gopi

Henry D. Pfister

Sergey Yekhanin

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities.

[BibT_eX]

[DOI]

Sivakanth Gopi

Venkatesan Guruswami

Sergey Yekhanin

IEEE Trans. Inf. Theory, 2020

2019

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2017

On Maximally Recoverable Local Reconstruction Codes.

[BibT_eX]

[DOI]

Sivakanth Gopi

Venkatesan Guruswami

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2017

Maximally Recoverable Codes for Grid-like Topologies.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Clustering Billions of Reads for DNA Data Storage.

[BibT_eX]

[DOI]

Cyrus Rashtchian

Konstantin Makarychev

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Collecting Telemetry Data Privately.

[BibT_eX]

[DOI]

Bolin Ding

Janardhan Kulkarni

Sergey Yekhanin

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

Maximally Recoverable Codes for Grid-like Topologies.

[BibT_eX]

[DOI]

CoRR, 2016

Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Ilya D. Shkredov

Sergey Yekhanin

Comput. Complex., 2016

New constructions of SD and MR codes over small finite fields.

[BibT_eX]

[DOI]

Guangda Hu

Sergey Yekhanin

Proceedings of the IEEE International Symposium on Information Theory, 2016

2014

High-rate codes with sublinear-time decoding.

[BibT_eX]

[DOI]

Swastik Kopparty

Shubhangi Saraf

Sergey Yekhanin

J. ACM, 2014

On the locality of codeword symbols in non-linear codes.

[BibT_eX]

[DOI]

Michael A. Forbes

Sergey Yekhanin

Discret. Math., 2014

2013

Explicit Maximally Recoverable Codes with Locality.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Zombie memory: extending memory lifetime by reviving dead blocks.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual International Symposium on Computer Architecture, 2013

2012

Locally Decodable Codes.

[BibT_eX]

[DOI]

Sergey Yekhanin

Found. Trends Theor. Comput. Sci., 2012

A note on the Newton radius.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Sergey Yekhanin

Discret. Math., 2012

Erasure Coding in Windows Azure Storage.

[BibT_eX]

[DOI]

Proceedings of the 2012 USENIX Annual Technical Conference, 2012

2011

Sets with large additive energy and symmetric sets.

[BibT_eX]

[DOI]

Ilya D. Shkredov

Sergey Yekhanin

J. Comb. Theory, Ser. A, 2011

Noisy Interpolation of Sparse Polynomials, and Applications.

[BibT_eX]

[DOI]

Shubhangi Saraf

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2011

On the Locality of Codeword Symbols.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Locally Decodable Codes: A Brief Survey.

[BibT_eX]

[DOI]

Sergey Yekhanin

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010

Locally Decodable Codes and Private Information Retrieval Schemes

[BibT_eX]

[DOI]

Sergey Yekhanin

Information Security and Cryptography, Springer, ISBN: 978-3-642-14357-1, 2010

Matching Vector Codes.

[BibT_eX]

[DOI]

Zeev Dvir

Parikshit Gopalan

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2010

Private information retrieval.

[BibT_eX]

[DOI]

Sergey Yekhanin

Commun. ACM, 2010

Pan-Private Streaming Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

2008

Towards 3-query locally decodable codes of subexponential length.

[BibT_eX]

[DOI]

Sergey Yekhanin

J. ACM, 2008

Deterministic Approximation Algorithms for the Nearest Codeword Problem.

[BibT_eX]

[DOI]

Noga Alon

Rina Panigrahy

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2008

New Efficient Attacks on Statistical Disclosure Control Mechanisms.

[BibT_eX]

[DOI]

Cynthia Dwork

Sergey Yekhanin

Proceedings of the Advances in Cryptology, 2008

Detecting Rational Points on Hypersurfaces over Finite Fields.

[BibT_eX]

[DOI]

Swastik Kopparty

Sergey Yekhanin

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007

LDCs and PIRs.

[BibT_eX]

[DOI]

Sergey Yekhanin

PhD thesis, 2007

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval.

[BibT_eX]

[DOI]

Alexander A. Razborov

Sergey Yekhanin

Theory Comput., 2007

A note on plane pointless curves.

[BibT_eX]

[DOI]

Sergey Yekhanin

Finite Fields Their Appl., 2007

Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.

[BibT_eX]

[DOI]

Kiran S. Kedlaya

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2007

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

New Locally Decodable Codes and Private Information Retrieval Schemes.

[BibT_eX]

[DOI]

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2006

An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval.

[BibT_eX]

[DOI]

Alexander A. Razborov

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2006

The complexity of matrix completion.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

David R. Karger

Sergey Yekhanin

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

A Geometric Approach to Information-Theoretic Private Information Retrieval

[BibT_eX]

[DOI]

David P. Woodruff

Sergey Yekhanin

Electron. Colloquium Comput. Complex., 2005

2004

Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.

[BibT_eX]

[DOI]

Sergey Yekhanin

Ilya Dumer

IEEE Trans. Inf. Theory, 2004

Improved Upper Bound for the Redundancy of Fix-Free Codes.

[BibT_eX]

[DOI]

Sergey Yekhanin

IEEE Trans. Inf. Theory, 2004

Trivial two-stage group testing for complexes using almost disjunct matrices.

[BibT_eX]

[DOI]

Anthony J. Macula

Vyacheslav V. Rykov

Sergey Yekhanin

Discret. Appl. Math., 2004

Partition codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Sergey Yekhanin

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...