| Publication | Date of Publication | Type |
|---|
| Matching vector codes | 2025-04-29 | Paper |
Batch Optimization for DNA Synthesis
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Maximally Recoverable Codes for Grid-like Topologies
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Kolmogorov width of discrete linear spaces: an approach to matrix rigidity | 2018-01-24 | Paper |
| Codes with local decoding procedures | 2017-11-06 | Paper |
On the Locality of Codeword Symbols
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Explicit Maximally Recoverable Codes With Locality
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity
Computational Complexity | 2016-06-30 | Paper |
Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
SIAM Review | 2016-05-20 | Paper |
High-rate codes with sublinear-time decoding
Journal of the ACM | 2015-08-14 | Paper |
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
On the locality of codeword symbols in non-linear codes
Discrete Mathematics | 2014-03-20 | Paper |
Locally decodable codes
Foundations and Trends in Theoretical Computer Science | 2014-01-15 | Paper |
A note on the Newton radius
Discrete Mathematics | 2012-08-10 | Paper |
Matching vector codes
SIAM Journal on Computing | 2011-11-07 | Paper |
Locally Decodable Codes
Computer Science – Theory and Applications | 2011-06-17 | Paper |
Locally decodable codes: a brief survey
Lecture Notes in Computer Science | 2011-06-08 | Paper |
An \(\Omega (n^{1/3})\) lower bound for bilinear group based private information retrieval
Theory of Computing | 2011-05-24 | Paper |
Sets with large additive energy and symmetric sets
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
The complexity of matrix completion
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Locally decodable codes and private information retrieval schemes.
Information Security and Cryptography | 2010-08-03 | Paper |
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
SIAM Journal on Computing | 2009-11-06 | Paper |
Deterministic Approximation Algorithms for the Nearest Codeword Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
New Efficient Attacks on Statistical Disclosure Control Mechanisms
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5485460 (Why is no real title available?) | 2009-01-05 | Paper |
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM | 2008-12-21 | Paper |
Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Improved Upper Bound for the Redundancy of Fix-Free Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A note on plane pointless curves
Finite Fields and their Applications | 2008-09-25 | Paper |
A Geometric Approach to Information-Theoretic Private Information Retrieval
SIAM Journal on Computing | 2008-08-14 | Paper |
On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
Stochastic Analysis and Applications | 2006-03-14 | Paper |
| scientific article; zbMATH DE number 2154117 (Why is no real title available?) | 2005-04-08 | Paper |
| scientific article; zbMATH DE number 2154118 (Why is no real title available?) | 2005-04-08 | Paper |
Trivial two-stage group testing for complexes using almost disjunct matrices.
Discrete Applied Mathematics | 2004-02-14 | Paper |
| scientific article; zbMATH DE number 1498832 (Why is no real title available?) | 2000-09-03 | Paper |
