Sergey Yekhanin

According to our database1, Sergey Yekhanin authored at least 50 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Linear Combination of Saved Checkpoints Makes Consistency and Diffusion Models Better.
CoRR, 2024

Differentially Private Synthetic Data via Foundation Model APIs 2: Text.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Differentially Private Synthetic Data via Foundation Model APIs 1: Images.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Challenges towards the Next Frontier in Privacy.
CoRR, 2023

2022
Batch Optimization for DNA Synthesis.
IEEE Trans. Inf. Theory, 2022

Differentially Private Fine-tuning of Language Models.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Differentially Private Set Union.
J. Priv. Confidentiality, 2021

Differentially Private n-gram Extraction.
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.
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.
IEEE Trans. Inf. Theory, 2020

2019
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors.
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.
Electron. Colloquium Comput. Complex., 2017

Maximally Recoverable Codes for Grid-like Topologies.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Clustering Billions of Reads for DNA Data Storage.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Collecting Telemetry Data Privately.
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.
CoRR, 2016

Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity.
Comput. Complex., 2016

New constructions of SD and MR codes over small finite fields.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
On the locality of codeword symbols in non-linear codes.
Discret. Math., 2014

2013
Explicit Maximally Recoverable Codes with Locality.
Electron. Colloquium Comput. Complex., 2013

Zombie memory: extending memory lifetime by reviving dead blocks.
Proceedings of the 40th Annual International Symposium on Computer Architecture, 2013

2012
Locally Decodable Codes.
Found. Trends Theor. Comput. Sci., 2012

A note on the Newton radius.
Discret. Math., 2012

Erasure Coding in Windows Azure Storage.
Proceedings of the 2012 USENIX Annual Technical Conference, 2012

2011
Matching Vector Codes.
SIAM J. Comput., 2011

Sets with large additive energy and symmetric sets.
J. Comb. Theory A, 2011

Noisy Interpolation of Sparse Polynomials, and Applications.
Electron. Colloquium Comput. Complex., 2011

On the Locality of Codeword Symbols.
Electron. Colloquium Comput. Complex., 2011

Locally Decodable Codes: A Brief Survey.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
Locally Decodable Codes and Private Information Retrieval Schemes
Information Security and Cryptography, Springer, ISBN: 978-3-642-14357-1, 2010

High-rate codes with sublinear-time decoding.
Electron. Colloquium Comput. Complex., 2010

Private information retrieval.
Commun. ACM, 2010

Pan-Private Streaming Algorithms.
Proceedings of the Innovations in Computer Science, 2010

2009
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers.
SIAM J. Comput., 2009

2008
Towards 3-query locally decodable codes of subexponential length.
J. ACM, 2008

Deterministic Approximation Algorithms for the Nearest Codeword Problem.
Electron. Colloquium Comput. Complex., 2008

New Efficient Attacks on Statistical Disclosure Control Mechanisms.
Proceedings of the Advances in Cryptology, 2008

Detecting Rational Points on Hypersurfaces over Finite Fields.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007
LDCs and PIRs.
PhD thesis, 2007

An Omega(<i>n</i><sup>1/3</sup>) Lower Bound for Bilinear Group Based Private Information Retrieval.
Theory Comput., 2007

A Geometric Approach to Information-Theoretic Private Information Retrieval.
SIAM J. Comput., 2007

A note on plane pointless curves.
Finite Fields Their Appl., 2007

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
New Locally Decodable Codes and Private Information Retrieval Schemes.
Electron. Colloquium Comput. Complex., 2006

An Omega(n<sup>1/3</sup>) Lower Bound for Bilinear Group Based Private Information Retrieval.
Electron. Colloquium Comput. Complex., 2006

The complexity of matrix completion.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2004
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance.
IEEE Trans. Inf. Theory, 2004

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

Trivial two-stage group testing for complexes using almost disjunct matrices.
Discret. Appl. Math., 2004

Partition codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...