| Publication | Date of Publication | Type |
|---|
| Combinatorial group testing and sparse recovery schemes with near-optimal decoding time | 2025-08-12 | Paper |
Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
SIAM Journal on Computing | 2024-10-21 | Paper |
One-tape Turing machine and branching program lower bounds for MCSP
Theory of Computing Systems | 2024-10-07 | Paper |
| Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_p\) norms | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7799585 (Why is no real title available?) | 2024-02-05 | Paper |
| Leakage-Resilient Secret Sharing in Non-Compartmentalized Models. | 2023-11-02 | Paper |
Simple Codes and Sparse Recovery with Fast Decoding
SIAM Journal on Discrete Mathematics | 2023-05-31 | Paper |
Circuit lower bounds for MCSP from local pseudorandom generators
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
| Circuit lower bounds for MCSP from local pseudorandom generators | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559096 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
An Overview of Capacity Results for Synchronization Channels
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Coded Trace Reconstruction
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Efficiently Decodable Non-Adaptive Threshold Group Testing
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Capacity Upper Bounds for Deletion-type Channels
Journal of the ACM | 2019-11-21 | Paper |
Capacity upper bounds for deletion-type channels
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Expressions for the Entropy of Basic Discrete Distributions
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Nearly optimal robust secret sharing
Designs, Codes and Cryptography | 2019-06-27 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Submodular functions are noise stable | 2019-05-10 | Paper |
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
ACM Transactions on Algorithms | 2018-11-05 | Paper |
\(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Secret Sharing with Binary Shares
(available as arXiv preprint) | 2018-08-08 | Paper |
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Local testing of lattices
SIAM Journal on Discrete Mathematics | 2018-06-08 | Paper |
Local testing for membership in lattices
(available as arXiv preprint) | 2018-04-19 | Paper |
| \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product | 2017-12-19 | Paper |
| Expressions for the Entropy of Binomial-Type Distributions | 2017-08-21 | Paper |
Graph-Constrained Group Testing
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Group Testing With Probabilistic Tests: Theory, Design and Application
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Invertible Extractors and Wiretap Protocols
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Capacity of non-malleable codes
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Capacity of non-malleable codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Non-malleable coding against bit-wise and split-state tampering
Journal of Cryptology | 2017-03-02 | Paper |
Approximating linear threshold predicates
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Non-malleable coding against bit-wise and split-state tampering
Lecture Notes in Computer Science | 2014-02-18 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
SIAM Journal on Computing | 2014-02-04 | Paper |
Restricted isometry of Fourier matrices and list decodability of random linear codes
SIAM Journal on Computing | 2014-02-04 | Paper |
Improved constructions for non-adaptive threshold group testing
Algorithmica | 2013-11-11 | Paper |
Noise-resilient group testing: limitations and constructions
Discrete Applied Mathematics | 2012-11-22 | Paper |
| Almost-uniform sampling of points on high-dimensional algebraic varieties | 2012-04-24 | Paper |
Approximating linear threshold predicates
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Improved constructions for non-adaptive threshold group testing
Lecture Notes in Computer Science | 2010-09-07 | Paper |
Noise-Resilient Group Testing: Limitations and Constructions
Fundamentals of Computation Theory | 2009-10-20 | Paper |
