| 2009 |
|---|
| 23 | EE | 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) |
| 2008 |
|---|
| 22 | EE | Cynthia Dwork,
Sergey Yekhanin:
New Efficient Attacks on Statistical Disclosure Control Mechanisms.
CRYPTO 2008: 469-480 |
| 21 | EE | Kiran 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 |
| 20 | EE | Swastik Kopparty,
Sergey Yekhanin:
Detecting Rational Points on Hypersurfaces over Finite Fields.
IEEE Conference on Computational Complexity 2008: 311-320 |
| 19 | EE | Noga Alon,
Rina Panigrahy,
Sergey Yekhanin:
Deterministic Approximation Algorithms for the Nearest Codeword Problem.
Electronic Colloquium on Computational Complexity (ECCC) 15(065): (2008) |
| 18 | EE | Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length.
J. ACM 55(1): (2008) |
| 2007 |
|---|
| 17 | EE | 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 |
| 16 | EE | Sergey Yekhanin:
Towards 3-query locally decodable codes of subexponential length.
STOC 2007: 266-274 |
| 15 | EE | 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) |
| 14 | EE | Kiran 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) |
| 13 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval.
SIAM J. Comput. 37(4): 1046-1056 (2007) |
| 12 | EE | Alexander 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 |
|---|
| 11 | EE | Alexander A. Razborov,
Sergey Yekhanin:
An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval.
FOCS 2006: 739-748 |
| 10 | EE | Nicholas J. A. Harvey,
David R. Karger,
Sergey Yekhanin:
The complexity of matrix completion.
SODA 2006: 1103-1111 |
| 9 | EE | Alexander 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) |
| 8 | EE | Sergey Yekhanin:
New Locally Decodable Codes and Private Information Retrieval Schemes.
Electronic Colloquium on Computational Complexity (ECCC) 13(127): (2006) |
| 2005 |
|---|
| 7 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval.
IEEE Conference on Computational Complexity 2005: 275-284 |
| 6 | EE | David P. Woodruff,
Sergey Yekhanin:
A Geometric Approach to Information-Theoretic Private Information Retrieval
Electronic Colloquium on Computational Complexity (ECCC)(009): (2005) |
| 2004 |
|---|
| 5 | EE | Sergey Yekhanin,
Ilya Dumer:
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance
CoRR cs.IT/0406039: (2004) |
| 4 | EE | Sergey Yekhanin:
Improved Upper Bound for the Redundancy of Fix-Free Codes
CoRR cs.IT/0408017: (2004) |
| 3 | EE | Anthony 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) |
| 2 | | Sergey 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) |
| 1 | | Sergey Yekhanin:
Improved Upper Bound for the Redundancy of Fix-Free Codes.
IEEE Transactions on Information Theory 50(11): 2815-2818 (2004) |
