| Batch Optimization for DNA Synthesis | 0 | 0.34 | 2022 |
| Batch Optimization For Dna Synthesis | 0 | 0.34 | 2021 |
| Differentially Private Set Union | 0 | 0.34 | 2020 |
| An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors. | 1 | 0.35 | 2018 |
| On Maximally Recoverable Local Reconstruction Codes. | 2 | 0.36 | 2017 |
| Clustering Billions of Reads for DNA Data Storage. | 0 | 0.34 | 2017 |
| Maximally Recoverable Codes for Grid-like Topologies. | 0 | 0.34 | 2017 |
| Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity. | 0 | 0.34 | 2015 |
| On the locality of codeword symbols in non-linear codes. | 22 | 1.53 | 2013 |
| Zombie memory: extending memory lifetime by reviving dead blocks | 26 | 0.91 | 2013 |
| Explicit Maximally Recoverable Codes With Locality | 48 | 1.99 | 2013 |
| A note on the Newton radius. | 0 | 0.34 | 2012 |
| Erasure coding in windows azure storage | 322 | 10.93 | 2012 |
| Sets with large additive energy and symmetric sets | 1 | 0.43 | 2011 |
| Matching Vector Codes | 20 | 0.87 | 2011 |
| Locally decodable codes: a brief survey | 4 | 0.41 | 2011 |
| On the Locality of Codeword Symbols | 232 | 10.11 | 2011 |
| Noisy Interpolation of Sparse Polynomials, and Applications | 8 | 0.51 | 2011 |
| Locally decodable codes | 10 | 1.22 | 2011 |
| Matching Vector Codes. | 2 | 0.39 | 2010 |
| Private information retrieval | 22 | 1.04 | 2010 |
| High-rate codes with sublinear-time decoding | 22 | 1.30 | 2010 |
| Pan-Private Streaming Algorithms | 30 | 2.66 | 2010 |
| Private information retrieval | 1 | 0.38 | 2010 |
| Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers | 11 | 0.62 | 2009 |
| Deterministic approximation algorithms for the nearest codeword problem. | 19 | 0.83 | 2009 |
| Detecting Rational Points on Hypersurfaces over Finite Fields | 2 | 0.41 | 2008 |
| New Efficient Attacks on Statistical Disclosure Control Mechanisms | 45 | 4.48 | 2008 |
| Towards 3-query locally decodable codes of subexponential length | 33 | 1.24 | 2007 |
| Non-Adaptive Fault Diagnosis For All-Optical Networks Via Combinatorial Group Testing On Graphs | 19 | 1.60 | 2007 |
| A note on plane pointless curves | 1 | 0.39 | 2007 |
| The complexity of matrix completion | 22 | 1.67 | 2006 |
| An Omega(n^1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval | 4 | 0.51 | 2006 |
| A Geometric Approach to Information-Theoretic Private Information Retrieval | 31 | 1.50 | 2005 |
| Trivial two-stage group testing for complexes using almost disjunct matrices | 23 | 1.32 | 2004 |
