Sergey Yekhanin Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Rina Panigrahy, Sergey Yekhanin: Deterministic Approximation Algorithms for the Nearest Codeword Problem. APPROX-RANDOM 2009: 339-351
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiran 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)
2008
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCynthia Dwork, Sergey Yekhanin: New Efficient Attacks on Statistical Disclosure Control Mechanisms. CRYPTO 2008: 469-480
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiran S. Kedlaya, Sergey Yekhanin: Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. IEEE Conference on Computational Complexity 2008: 175-186
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSwastik Kopparty, Sergey Yekhanin: Detecting Rational Points on Hypersurfaces over Finite Fields. IEEE Conference on Computational Complexity 2008: 311-320
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Rina Panigrahy, Sergey Yekhanin: Deterministic Approximation Algorithms for the Nearest Codeword Problem. Electronic Colloquium on Computational Complexity (ECCC) 15(065): (2008)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin: Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1): (2008)
2007
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin: Towards 3-query locally decodable codes of subexponential length. STOC 2007: 266-274
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiran S. Kedlaya, Sergey Yekhanin: Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers CoRR abs/0704.1694: (2007)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKiran S. Kedlaya, Sergey Yekhanin: Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Electronic Colloquium on Computational Complexity (ECCC) 14(040): (2007)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Woodruff, Sergey Yekhanin: A Geometric Approach to Information-Theoretic Private Information Retrieval. SIAM J. Comput. 37(4): 1046-1056 (2007)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Sergey Yekhanin: An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. Theory of Computing 3(1): 221-238 (2007)
2006
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Sergey Yekhanin: An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. FOCS 2006: 739-748
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas J. A. Harvey, David R. Karger, Sergey Yekhanin: The complexity of matrix completion. SODA 2006: 1103-1111
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander A. Razborov, Sergey Yekhanin: An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval. Electronic Colloquium on Computational Complexity (ECCC) 13(050): (2006)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin: New Locally Decodable Codes and Private Information Retrieval Schemes. Electronic Colloquium on Computational Complexity (ECCC) 13(127): (2006)
2005
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Woodruff, Sergey Yekhanin: A Geometric Approach to Information-Theoretic Private Information Retrieval. IEEE Conference on Computational Complexity 2005: 275-284
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Woodruff, Sergey Yekhanin: A Geometric Approach to Information-Theoretic Private Information Retrieval Electronic Colloquium on Computational Complexity (ECCC)(009): (2005)
2004
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin, Ilya Dumer: Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance CoRR cs.IT/0406039: (2004)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin: Improved Upper Bound for the Redundancy of Fix-Free Codes CoRR cs.IT/0408017: (2004)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin: Trivial two-stage group testing for complexes using almost disjunct matrices. Discrete Applied Mathematics 137(1): 97-107 (2004)
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin, Ilya Dumer: Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. IEEE Transactions on Information Theory 50(10): 2357-2362 (2004)
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey Yekhanin: Improved Upper Bound for the Redundancy of Fix-Free Codes. IEEE Transactions on Information Theory 50(11): 2815-2818 (2004)

Coauthor Index

1Noga Alon [19] [24]
2Vincent W. S. Chan [17]
3Ilya Dumer [2] [5]
4Cynthia Dwork [22]
5Nicholas J. A. Harvey [10] [17]
6David R. Karger [10]
7Kiran S. Kedlaya [14] [15] [21] [23]
8Swastik Kopparty [20]
9Anthony J. Macula [3]
10Rina Panigrahy [19] [24]
11Mihai Patrascu [17]
12Alexander A. Razborov [9] [11] [12]
13Vyacheslav V. Rykov [3]
14Yonggang Wen [17]
15David P. Woodruff [6] [7] [13]

Colors in the list of coauthors

Copyright © Thu Nov 26 17:33:31 2009 by Michael Ley (ley@uni-trier.de)