Dean Doron

Available identifiers

zbMath Open doron.deanMaRDI QIDQ2099671

List of research outcomes

Publication	Date of Publication	Type
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	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
https://portal.mardi4nfdi.de/entity/Q6084350	2023-10-31	Paper
Error reduction for weighted PRGs against read once branching programs	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5875499	2023-02-03	Paper
On hitting-set generators for polynomials that vanish rarely	2022-11-24	Paper
Near-optimal pseudorandom generators for constant-depth read-once formulas	2022-07-27	Paper
https://portal.mardi4nfdi.de/entity/Q5092448	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5092453	2022-07-21	Paper
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy	2022-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q5002644	2021-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q5121891	2020-09-22	Paper
On approximating the eigenvalues of stochastic matrices in probabilistic logspace	2017-10-18	Paper
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy	2017-08-17	Paper
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace	2015-10-27	Paper
On the de-randomization of space-bounded approximate counting problems	2015-06-15	Paper
WITHDRAWN: Random Reed-Solomon Codes are List Recoverable with Optimal List Size	N/A	Paper

Research outcomes over time

This page was built for person: Dean Doron