Dean Doron

From MaRDI portal
Person:2099671

Available identifiers

zbMath Open doron.deanMaRDI QIDQ2099671

List of research outcomes





PublicationDate of PublicationType
Derandomization with minimal memory footprint2024-11-19Paper
New near-linear time decodable codes closer to the GV bound2024-07-05Paper
High-probability list-recovery, and applications to heavy hitters2024-06-24Paper
Nearly optimal pseudorandomness from hardness2024-06-06Paper
Almost Chor-Goldreich sources and adversarial random walks2024-05-08Paper
Approximating iterated multiplication of stochastic matrices in small space2024-05-08Paper
Pseudorandom Generators for Read-Once Monotone Branching Programs2023-11-20Paper
https://portal.mardi4nfdi.de/entity/Q60843502023-10-31Paper
Error reduction for weighted PRGs against read once branching programs2023-07-12Paper
https://portal.mardi4nfdi.de/entity/Q58754992023-02-03Paper
On hitting-set generators for polynomials that vanish rarely2022-11-24Paper
Near-optimal pseudorandom generators for constant-depth read-once formulas2022-07-27Paper
https://portal.mardi4nfdi.de/entity/Q50924482022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924532022-07-21Paper
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy2022-05-03Paper
https://portal.mardi4nfdi.de/entity/Q50026442021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51218912020-09-22Paper
On approximating the eigenvalues of stochastic matrices in probabilistic logspace2017-10-18Paper
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy2017-08-17Paper
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace2015-10-27Paper
On the de-randomization of space-bounded approximate counting problems2015-06-15Paper
WITHDRAWN: Random Reed-Solomon Codes are List Recoverable with Optimal List SizeN/APaper

Research outcomes over time

This page was built for person: Dean Doron