Dean Doron

MaRDI QIDQ2099671zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 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
WITHDRAWN: Random Reed-Solomon Codes are List Recoverable with Optimal List Size (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Dean Doron