Dean Doron

73 papers A* 8A 12Journal 47Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Optimal PRGs for Low-Degree Polynomials over Polynomial-Size Fields.
CoRR
Gil Cohen, Dean Doron, Noam Goldgraber
2026 J jnl
Optimal PRGs for Low-Degree Polynomials over Polynomial-Size Fields.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Noam Goldgraber
2025 A conf
Bit-Fixing Extractors for Almost-Logarithmic Entropy.
APPROX/RANDOM
Dean Doron, Ori Fridman
2025 J jnl
Bit-Fixing Extractors for Almost-Logarithmic Entropy.
Electron. Colloquium Comput. Complex.
Dean Doron, Ori Fridman
2025 A conf
Implications of Better PRGs for Permutation Branching Programs.
APPROX/RANDOM
Dean Doron, William M. Hoza
2025 J jnl
List-Recovery of Random Linear Codes Over Small Fields.
IEEE Trans. Inf. Theory
Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025 A conf
List-Recovery of Random Linear Codes over Small Fields.
APPROX/RANDOM
Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025 J jnl
List-Recovery of Random Linear Codes over Small Fields.
CoRR
Dean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro
2025 J jnl
Nearly-Linear Time Seeded Extractors With Short Seeds.
IEEE Trans. Inf. Theory
Dean Doron, João Ribeiro
2025 A conf
Online Condensing of Unpredictable Sources via Random Walks.
CCC
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2025 J jnl
Seed-Protecting Extractors.
Theory Comput.
Gil Cohen, Dean Doron, Shahar Samocha
2025 J jnl
Tracing AG Codes: Toward Meeting the Gilbert-Varshamov Bound.
CoRR
Gil Cohen, Dean Doron, Noam Goldgraber, Tomer Manket
2025 J jnl
Tracing AG Codes: Toward Meeting the Gilbert-Varshamov Bound.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Noam Goldgraber, Tomer Manket
2025 J jnl
When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism.
Electron. Colloquium Comput. Complex.
Dean Doron, Edward Pyne, Roei Tell, Ryan Williams
2025 A* conf
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism.
STOC
Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams
2024 J jnl
A Study of Error Reduction Polynomials.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz
2024 J jnl
Binary Codes with Distance Close to Half.
Electron. Colloquium Comput. Complex.
Dean Doron
2024 J jnl
Implications of Better PRGs for Permutation Branching Programs.
Electron. Colloquium Comput. Complex.
Dean Doron, William Hoza
2024 J jnl
Nearly-Linear Time Seeded Extractors with Short Seeds.
CoRR
Dean Doron, João Ribeiro
2024 J jnl
Nearly-Linear Time Seeded Extractors with Short Seeds.
Electron. Colloquium Comput. Complex.
Dean Doron, João Ribeiro
2024 J jnl
Online Condensing of Unpredictable Sources via Random Walks.
Electron. Colloquium Comput. Complex.
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2024 A* conf
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL.
STOC
Dean Doron, Edward Pyne, Roei Tell
2024 J jnl
Small-Space Spectral Sparsification via Bounded-Independence Sampling.
ACM Trans. Comput. Theory
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2024 A conf
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
APPROX/RANDOM
Dean Doron, Jonathan Mosheiff, Mary Wootters
2024 J jnl
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
CoRR
Dean Doron, Jonathan Mosheiff, Mary Wootters
2024 J jnl
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
Electron. Colloquium Comput. Complex.
Dean Doron, Jonathan Mosheiff, Mary Wootters
2023 A* conf
Almost Chor-Goldreich Sources and Adversarial Random Walks.
STOC
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2023 A* conf
Approximating Iterated Multiplication of Stochastic Matrices in Small Space.
STOC
Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
2023 A conf
Derandomization with Minimal Memory Footprint.
CCC
Dean Doron, Roei Tell
2023 J jnl
Derandomization with Minimal Memory Footprint.
Electron. Colloquium Comput. Complex.
Dean Doron, Roei Tell
2023 J jnl
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL.
Electron. Colloquium Comput. Complex.
Dean Doron, Edward Pyne, Roei Tell
2022 J jnl
Almost Chor-Goldreich Sources and Adversarial Random Walks.
Electron. Colloquium Comput. Complex.
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2022 J jnl
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy.
SIAM J. Comput.
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2022 J jnl
Approximating Iterated Multiplication of Stochastic Matrices in Small Space.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
2022 J jnl
Approximating Large Powers of Stochastic Matrices in Small Space.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Ori Sberlo
2022 A* conf
High-Probability List-Recovery, and Applications to Heavy Hitters.
ICALP
Dean Doron, Mary Wootters
2022 J jnl
Nearly Optimal Pseudorandomness from Hardness.
J. ACM
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2022 A conf
New Near-Linear Time Decodable Codes Closer to the GV Bound.
CCC
Guy Blanc, Dean Doron
2022 J jnl
New Near-Linear Time Decodable Codes Closer to the GV Bound.
Electron. Colloquium Comput. Complex.
Guy Blanc, Dean Doron
2022 J jnl
On Hitting-Set Generators for Polynomials that Vanish Rarely.
Comput. Complex.
Dean Doron, Amnon Ta-Shma, Roei Tell
2021 J jnl
Error Reduction For Weighted PRGs Against Read Once Branching Programs.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
2021 A conf
Error Reduction for Weighted PRGs Against Read Once Branching Programs.
CCC
Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
2021 J jnl
Monotone Branching Programs: Pseudorandomness and Circuit Complexity.
Electron. Colloquium Comput. Complex.
Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021 — conf
Pseudorandom Generators for Read-Once Monotone Branching Programs.
APPROX-RANDOM
Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2020 J jnl
High-Probability List-Recovery, and Applications to Heavy Hitters.
Electron. Colloquium Comput. Complex.
Dean Doron, Mary Wootters
2020 A conf
Log-Seed Pseudorandom Generators via Iterated Restrictions.
CCC
Dean Doron, Pooya Hatami, William M. Hoza
2020 A conf
Near-Optimal Erasure List-Decodable Codes.
CCC
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2020 A* conf
Nearly Optimal Pseudorandomness From Hardness.
FOCS
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2020 — conf
On Hitting-Set Generators for Polynomials That Vanish Rarely.
APPROX-RANDOM
Dean Doron, Amnon Ta-Shma, Roei Tell
2020 J jnl
Seed Protecting Extractors.
Electron. Colloquium Comput. Complex.
Gil Cohen, Dean Doron, Shahar Samocha
2020 A* conf
Spectral Sparsification via Bounded-Independence Sampling.
ICALP
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020 J jnl
Spectral Sparsification via Bounded-Independence Sampling.
CoRR
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2020 J jnl
Spectral Sparsification via Bounded-Independence Sampling.
Electron. Colloquium Comput. Complex.
Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman
2019 J jnl
Log-Seed Pseudorandom Generators via Iterated Restrictions.
Electron. Colloquium Comput. Complex.
Dean Doron, Pooya Hatami, William Hoza
2019 A conf
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas.
CCC
Dean Doron, Pooya Hatami, William M. Hoza
2019 J jnl
Nearly Optimal Pseudorandomness From Hardness.
Electron. Colloquium Comput. Complex.
Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman
2019 J jnl
On Hitting-Set Generators for Polynomials that Vanish Rarely.
Electron. Colloquium Comput. Complex.
Dean Doron, Amnon Ta-Shma, Roei Tell
2019 — conf
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.
APPROX-RANDOM
Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma
2018 A conf
A New Approach for Constructing Low-Error, Two-Source Extractors.
CCC
Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
2018 J jnl
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas.
Electron. Colloquium Comput. Complex.
Dean Doron, Pooya Hatami, William Hoza
2018 J jnl
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2018 — —
Randomness Extractors and Space-Bounded Computation
Dean Doron
2018 J jnl
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma
2017 J jnl
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
2017 A* conf
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy.
STOC
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2017 J jnl
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace.
Comput. Complex.
Dean Doron, Amir Sarid, Amnon Ta-Shma
2017 — conf
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers.
APPROX-RANDOM
Dean Doron, François Le Gall, Amnon Ta-Shma
2017 J jnl
Probabilistic logarithmic-space algorithms for Laplacian solvers.
Electron. Colloquium Comput. Complex.
Dean Doron, Francois Le Gall, Amnon Ta-Shma
2016 J jnl
Explicit two-source extractors for near-logarithmic min-entropy.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2016 J jnl
Low-error two-source extractors for polynomial min-entropy.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma
2016 J jnl
On approximating the eigenvalues of stochastic matrices in probabilistic logspace.
Electron. Colloquium Comput. Complex.
Dean Doron, Amir Sarid, Amnon Ta-Shma
2015 — conf
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace.
ICALP (1)
Dean Doron, Amnon Ta-Shma
2015 J jnl
On the de-randomization of space-bounded approximate counting problems.
Inf. Process. Lett.
Dean Doron, Amnon Ta-Shma