Search the dblp DataBase

Publications of Author

1. David P. Woodruff, Sergey Yekhanin
   A Geometric Approach to Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2005, pp:275-284 [Conf]
   
2. Alexander A. Razborov, Sergey Yekhanin
   An Omega(n^1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:739-748 [Conf]
   
3. Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin
   The complexity of matrix completion. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:1103-1111 [Conf]
   
4. Sergey Yekhanin, Ilya Dumer
   Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
5. Sergey Yekhanin
   Improved Upper Bound for the Redundancy of Fix-Free Codes [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
6. Anthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin
   Trivial two-stage group testing for complexes using almost disjunct matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:137, n:1, pp:97-107 [Journal]
   
7. David P. Woodruff, Sergey Yekhanin
   A Geometric Approach to Information-Theoretic Private Information Retrieval [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:009, pp:- [Journal]
   
8. Sergey Yekhanin
   Improved Upper Bound for the Redundancy of Fix-Free Codes. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2815-2818 [Journal]
   
9. Sergey Yekhanin, Ilya Dumer
   Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2357-2362 [Journal]
   
10. 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. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:697-705 [Conf]
    
11. Sergey Yekhanin
    Towards 3-query locally decodable codes of subexponential length. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:266-274 [Conf]
    
12. Kiran S. Kedlaya, Sergey Yekhanin
    Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
13. David P. Woodruff, Sergey Yekhanin
    A Geometric Approach to Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:4, pp:1046-1056 [Journal]
    
14. 
    Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]
    
    
15. 
    Detecting Rational Points on Hypersurfaces over Finite Fields. [Citation Graph (, )][DBLP]
    
    
16. 
    Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. [Citation Graph (, )][DBLP]
    
    
17. 
    New Efficient Attacks on Statistical Disclosure Control Mechanisms. [Citation Graph (, )][DBLP]
    
    
18. 
    Pan-Private Streaming Algorithms. [Citation Graph (, )][DBLP]
    
    
19. 
    Private information retrieval. [Citation Graph (, )][DBLP]
    
    
20. 
    Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]
    
    
21. 
    Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. [Citation Graph (, )][DBLP]
    
    
22. 
    An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval. [Citation Graph (, )][DBLP]
    
    
23. 
    New Locally Decodable Codes and Private Information Retrieval Schemes. [Citation Graph (, )][DBLP]