The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Sergey Yekhanin" ( http://dblp.L3S.de/Authors/Sergey_Yekhanin )

  Author page on DBLP  Author page in RDF  Community of Sergey Yekhanin in ASPL-2

Publication years (Num. hits)
2004-2007 (18) 2008-2011 (21)
Publication types (Num. hits)
article(24) inproceedings(15)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 4 keywords

Results
Found 39 publication records. Showing 39 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1I. D. Shkredov, Sergey Yekhanin Sets with large additive energy and symmetric sets. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shubhangi Saraf, Sergey Yekhanin Noisy Interpolation of Sparse Polynomials, and Applications. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin On the Locality of Codeword Symbols. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Parikshit Gopalan, Cheng Huang, Huseyin Simitci, Sergey Yekhanin On the Locality of Codeword Symbols Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin Locally Decodable Codes. Search on Bibsonomy CSR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin Locally Decodable Codes: A Brief Survey. Search on Bibsonomy IWCC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shubhangi Saraf, Sergey Yekhanin Noisy Interpolation of Sparse Polynomials, and Applications. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin High-rate codes with sublinear-time decoding. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin High-rate codes with sublinear-time decoding. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Sergey Yekhanin Private information retrieval. Search on Bibsonomy Commun. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin Pan-Private Streaming Algorithms. Search on Bibsonomy ICS The full citation details ... 2010 DBLP  BibTeX  RDF
1Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin Matching Vector Codes. Search on Bibsonomy FOCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kiran S. Kedlaya, Sergey Yekhanin Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Rina Panigrahy, Sergey Yekhanin Deterministic Approximation Algorithms for the Nearest Codeword Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Rina Panigrahy, Sergey Yekhanin Deterministic Approximation Algorithms for the Nearest Codeword Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF private information retrieval, Locally decodable codes, Mersenne primes
1Cynthia Dwork, Sergey Yekhanin New Efficient Attacks on Statistical Disclosure Control Mechanisms. Search on Bibsonomy CRYPTO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Kiran S. Kedlaya, Sergey Yekhanin Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Locally decodable codes, Mersenne primes
1Swastik Kopparty, Sergey Yekhanin Detecting Rational Points on Hypersurfaces over Finite Fields. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Chevalley-Warning Theorem, Lang-Weil Theorem, Nonsingular Spaces of Matrices, Polynomial Identity Testing
1Kiran S. Kedlaya, Sergey Yekhanin Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Alexander A. Razborov, Sergey Yekhanin An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. Search on Bibsonomy Theory of Computing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin A note on plane pointless curves. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Kiran S. Kedlaya, Sergey Yekhanin Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1David P. Woodruff, Sergey Yekhanin A Geometric Approach to Information-Theoretic Private Information Retrieval. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nicholas 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. Search on Bibsonomy INFOCOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF private information retrieval, locally decodable codes, Mersenne primes
1Sergey Yekhanin New Locally Decodable Codes and Private Information Retrieval Schemes. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Alexander A. Razborov, Sergey Yekhanin An Omega(n^{1/3}) Lower Bound for Bilinear Group Based Private Information Retrieval. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin The complexity of matrix completion. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexander A. Razborov, Sergey Yekhanin An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1David P. Woodruff, Sergey Yekhanin A Geometric Approach to Information-Theoretic Private Information Retrieval Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1David P. Woodruff, Sergey Yekhanin A Geometric Approach to Information-Theoretic Private Information Retrieval. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin Improved Upper Bound for the Redundancy of Fix-Free Codes Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Sergey Yekhanin, Ilya Dumer Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Anthony J. Macula, Vyacheslav V. Rykov, Sergey Yekhanin Trivial two-stage group testing for complexes using almost disjunct matrices. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin Improved Upper Bound for the Redundancy of Fix-Free Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sergey Yekhanin, Ilya Dumer Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #39 of 39 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.