default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Yekhanin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j22]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath
, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. J. Priv. Confidentiality 14(2) (2024)- [c32]Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. ICLR 2024 - [c31]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. ICML 2024 - [i33]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. CoRR abs/2403.01749 (2024) - [i32]Enshu Liu, Junyi Zhu, Zinan Lin, Xuefei Ning, Matthew B. Blaschko, Sergey Yekhanin, Shengen Yan, Guohao Dai, Huazhong Yang, Yu Wang:
Linear Combination of Saved Checkpoints Makes Consistency and Diffusion Models Better. CoRR abs/2404.02241 (2024) - 2023
- [i31]Rachel Cummings, Damien Desfontaines, David Evans, Roxana Geambasu, Matthew Jagielski, Yangsibo Huang, Peter Kairouz, Gautam Kamath, Sewoong Oh, Olga Ohrimenko, Nicolas Papernot, Ryan Rogers, Milan Shen, Shuang Song, Weijie J. Su, Andreas Terzis, Abhradeep Thakurta, Sergei Vassilvitskii, Yu-Xiang Wang, Li Xiong, Sergey Yekhanin, Da Yu, Huanyu Zhang, Wanrong Zhang:
Challenges towards the Next Frontier in Privacy. CoRR abs/2304.06929 (2023) - [i30]Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. CoRR abs/2305.15560 (2023) - 2022
- [j21]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. IEEE Trans. Inf. Theory 68(11): 7454-7470 (2022) - [c30]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. ICLR 2022 - 2021
- [j20]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin:
Differentially Private Set Union. J. Priv. Confidentiality 11(3) (2021) - [c29]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. ISIT 2021: 1949-1954 - [c28]Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin:
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. ISIT 2021: 2453-2458 - [c27]Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin:
Differentially Private n-gram Extraction. NeurIPS 2021: 5102-5111 - [i29]Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin:
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. CoRR abs/2107.06440 (2021) - [i28]Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin:
Differentially Private n-gram Extraction. CoRR abs/2108.02831 (2021) - [i27]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. CoRR abs/2110.06500 (2021) - 2020
- [j19]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities. IEEE Trans. Inf. Theory 66(10): 6066-6083 (2020) - [c26]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin:
Differentially Private Set Union. ICML 2020: 3627-3636 - [i26]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin:
Differentially Private Set Union. CoRR abs/2002.09745 (2020) - [i25]Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. CoRR abs/2011.14532 (2020)
2010 – 2019
- 2019
- [c25]Joshua Allen, Bolin Ding, Janardhan Kulkarni, Harsha Nori, Olga Ohrimenko, Sergey Yekhanin:
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. NeurIPS 2019: 13635-13646 - [c24]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. SODA 2019: 2154-2170 - 2018
- [i24]Joshua Allen, Bolin Ding, Janardhan Kulkarni, Harsha Nori, Olga Ohrimenko, Sergey Yekhanin:
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. CoRR abs/1807.00736 (2018) - 2017
- [c23]Cyrus Rashtchian, Konstantin Makarychev, Miklós Z. Rácz, Siena Ang, Djordje Jevdjic, Sergey Yekhanin, Luis Ceze, Karin Strauss:
Clustering Billions of Reads for DNA Data Storage. NIPS 2017: 3360-3371 - [c22]Bolin Ding, Janardhan Kulkarni, Sergey Yekhanin:
Collecting Telemetry Data Privately. NIPS 2017: 3571-3580 - [c21]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - [i23]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. CoRR abs/1710.10322 (2017) - [i22]Bolin Ding, Janardhan Kulkarni, Sergey Yekhanin:
Collecting Telemetry Data Privately. CoRR abs/1712.01524 (2017) - [i21]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j18]Alex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin:
Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. Comput. Complex. 25(2): 309-348 (2016) - [c20]Guangda Hu, Sergey Yekhanin:
New constructions of SD and MR codes over small finite fields. ISIT 2016: 1591-1595 - [i20]Guangda Hu, Sergey Yekhanin:
New Constructions of SD and MR Codes over Small Finite Fields. CoRR abs/1605.02290 (2016) - [i19]Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. CoRR abs/1605.05412 (2016) - 2015
- [c19]Alex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin:
Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. CCC 2015: 347-364 - 2014
- [j17]Michael A. Forbes, Sergey Yekhanin:
On the locality of codeword symbols in non-linear codes. Discret. Math. 324: 78-84 (2014) - [j16]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. J. ACM 61(5): 28:1-28:20 (2014) - [j15]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes With Locality. IEEE Trans. Inf. Theory 60(9): 5245-5256 (2014) - [i18]Alex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin:
Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c18]Rodolfo Azevedo, John D. Davis, Karin Strauss, Parikshit Gopalan, Mark S. Manasse, Sergey Yekhanin:
Zombie memory: extending memory lifetime by reviving dead blocks. ISCA 2013: 452-463 - [i17]Michael A. Forbes, Sergey Yekhanin:
On the Locality of Codeword Symbols in Non-Linear Codes. CoRR abs/1303.3921 (2013) - [i16]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes with Locality. CoRR abs/1307.4150 (2013) - [i15]Parikshit Gopalan, Cheng Huang, Bob Jenkins, Sergey Yekhanin:
Explicit Maximally Recoverable Codes with Locality. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j14]Alex Samorodnitsky, Sergey Yekhanin:
A note on the Newton radius. Discret. Math. 312(15): 2392-2393 (2012) - [j13]Sergey Yekhanin:
Locally Decodable Codes. Found. Trends Theor. Comput. Sci. 6(3): 139-255 (2012) - [j12]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. IEEE Trans. Inf. Theory 58(11): 6925-6934 (2012) - [c17]Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, Sergey Yekhanin:
Erasure Coding in Windows Azure Storage. USENIX ATC 2012: 15-26 - 2011
- [j11]Ilya D. Shkredov, Sergey Yekhanin:
Sets with large additive energy and symmetric sets. J. Comb. Theory A 118(3): 1086-1093 (2011) - [j10]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. SIAM J. Comput. 40(4): 1154-1178 (2011) - [c16]Shubhangi Saraf, Sergey Yekhanin:
Noisy Interpolation of Sparse Polynomials, and Applications. CCC 2011: 86-92 - [c15]Sergey Yekhanin:
Locally Decodable Codes: A Brief Survey. IWCC 2011: 273-282 - [c14]Sergey Yekhanin:
Locally Decodable Codes. CSR 2011: 289-290 - [c13]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. STOC 2011: 167-176 - [i14]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. CoRR abs/1106.3625 (2011) - [i13]Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin:
On the Locality of Codeword Symbols. Electron. Colloquium Comput. Complex. TR11 (2011) - [i12]Shubhangi Saraf, Sergey Yekhanin:
Noisy Interpolation of Sparse Polynomials, and Applications. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [b2]Sergey Yekhanin:
Locally Decodable Codes and Private Information Retrieval Schemes. Information Security and Cryptography, Springer 2010, ISBN 978-3-642-14357-1, pp. 1-74 - [j9]Sergey Yekhanin:
Private information retrieval. Commun. ACM 53(4): 68-73 (2010) - [c12]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. FOCS 2010: 705-714 - [c11]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [i11]Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin:
Matching Vector Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i10]Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin:
High-rate codes with sublinear-time decoding. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j8]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. SIAM J. Comput. 38(5): 1952-1969 (2009) - [c10]Noga Alon, Rina Panigrahy, Sergey Yekhanin:
Deterministic Approximation Algorithms for the Nearest Codeword Problem. APPROX-RANDOM 2009: 339-351 - [i9]Noga Alon, Rina Panigrahy, Sergey Yekhanin:
Deterministic approximation algorithms for the nearest codeword problem. Algebraic Methods in Computational Complexity 2009 - 2008
- [j7]Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1): 1:1-1:16 (2008) - [c9]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. CCC 2008: 175-186 - [c8]Swastik Kopparty, Sergey Yekhanin:
Detecting Rational Points on Hypersurfaces over Finite Fields. CCC 2008: 311-320 - [c7]Cynthia Dwork, Sergey Yekhanin:
New Efficient Attacks on Statistical Disclosure Control Mechanisms. CRYPTO 2008: 469-480 - [i8]Noga Alon, Rina Panigrahy, Sergey Yekhanin:
Deterministic Approximation Algorithms for the Nearest Codeword Problem. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [b1]Sergey Yekhanin:
LDCs and PIRs. Massachusetts Institute of Technology, Cambridge, MA, USA, 2007 - [j6]Sergey Yekhanin:
A note on plane pointless curves. Finite Fields Their Appl. 13(2): 418-422 (2007) - [j5]David P. Woodruff, Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval. SIAM J. Comput. 37(4): 1046-1056 (2007) - [j4]Alexander A. Razborov, Sergey Yekhanin:
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. Theory Comput. 3(1): 221-238 (2007) - [c6]Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan:
Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. INFOCOM 2007: 697-705 - [c5]Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length. STOC 2007: 266-274 - [i7]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. CoRR abs/0704.1694 (2007) - [i6]Kiran S. Kedlaya, Sergey Yekhanin:
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c4]Alexander A. Razborov, Sergey Yekhanin:
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. FOCS 2006: 739-748 - [c3]Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin:
The complexity of matrix completion. SODA 2006: 1103-1111 - [i5]Alexander A. Razborov, Sergey Yekhanin:
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Sergey Yekhanin:
New Locally Decodable Codes and Private Information Retrieval Schemes. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c2]David P. Woodruff, Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval. CCC 2005: 275-284 - [i3]David P. Woodruff, Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j3]Anthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin:
Trivial two-stage group testing for complexes using almost disjunct matrices. Discret. Appl. Math. 137(1): 97-107 (2004) - [j2]Sergey Yekhanin, Ilya Dumer:
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. IEEE Trans. Inf. Theory 50(10): 2357-2362 (2004) - [j1]Sergey Yekhanin:
Improved Upper Bound for the Redundancy of Fix-Free Codes. IEEE Trans. Inf. Theory 50(11): 2815-2818 (2004) - [c1]Arkadii G. D'yachkov, Vyacheslav V. Rykov, David C. Torney, Sergey Yekhanin:
Partition codes. ISIT 2004: 256 - [i2]Sergey Yekhanin, Ilya Dumer:
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance. CoRR cs.IT/0406039 (2004) - [i1]Sergey Yekhanin:
Improved Upper Bound for the Redundancy of Fix-Free Codes. CoRR cs.IT/0408017 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
