| Publication | Date of Publication | Type |
|---|
WITHDRAWN: Random Reed-Solomon Codes are List Recoverable with Optimal List Size
(available as arXiv preprint) | N/A | Paper |
| Implications of better PRGs for permutation branching programs | 2026-09-11 | Paper |
| Bit-fixing extractors for almost-logarithmic entropy | 2026-09-11 | Paper |
| List-recovery of random linear codes over small fields | 2026-09-11 | Paper |
| Spectral sparsification via bounded-independence sampling | 2026-03-18 | Paper |
List-recovery of random linear codes over small fields
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Seed-protecting extractors
Theory of Computing | 2026-02-10 | Paper |
Nearly-linear time seeded extractors with short seeds
IEEE Transactions on Information Theory | 2025-11-25 | Paper |
| When do low-rate concatenated codes approach the Gilbert-Varshamov bound? | 2025-10-06 | Paper |
| Nearly optimal pseudorandomness from hardness | 2025-08-12 | Paper |
Small-space spectral sparsification via bounded-independence sampling
ACM Transactions on Computation Theory | 2025-02-25 | Paper |
| Derandomization with minimal memory footprint | 2024-11-19 | Paper |
| New near-linear time decodable codes closer to the GV bound | 2024-07-05 | Paper |
| High-probability list-recovery, and applications to heavy hitters | 2024-06-24 | Paper |
Nearly optimal pseudorandomness from hardness
Journal of the ACM | 2024-06-06 | Paper |
| Almost Chor-Goldreich sources and adversarial random walks | 2024-05-08 | Paper |
| Approximating iterated multiplication of stochastic matrices in small space | 2024-05-08 | Paper |
| Pseudorandom Generators for Read-Once Monotone Branching Programs | 2023-11-20 | Paper |
| On hitting-set generators for polynomials that vanish rarely | 2023-10-31 | Paper |
| Error reduction for weighted PRGs against read once branching programs | 2023-07-12 | Paper |
| scientific article; zbMATH DE number 7650110 (Why is no real title available?) | 2023-02-03 | Paper |
On hitting-set generators for polynomials that vanish rarely
Computational Complexity | 2022-11-24 | Paper |
| Near-optimal pseudorandom generators for constant-depth read-once formulas | 2022-07-27 | Paper |
| scientific article; zbMATH DE number 7561729 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561734 (Why is no real title available?) | 2022-07-21 | Paper |
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
SIAM Journal on Computing | 2022-05-03 | Paper |
| Probabilistic logarithmic-space algorithms for Laplacian solvers | 2021-07-28 | Paper |
| scientific article; zbMATH DE number 7250143 (Why is no real title available?) | 2020-09-22 | Paper |
On approximating the eigenvalues of stochastic matrices in probabilistic logspace
Computational Complexity | 2017-10-18 | Paper |
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
Automata, Languages, and Programming | 2015-10-27 | Paper |
On the de-randomization of space-bounded approximate counting problems
Information Processing Letters | 2015-06-15 | Paper |
