default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDean Doron
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Dean Doron
, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Small-Space Spectral Sparsification via Bounded-Independence Sampling. ACM Trans. Comput. Theory 16(2): 7:1-7:32 (2024)- [c20]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? APPROX/RANDOM 2024: 53:1-53:12 - [c19]Dean Doron, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. STOC 2024: 2039-2049 - [i27]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? CoRR abs/2405.08584 (2024) - [i26]Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz:
A Study of Error Reduction Polynomials. Electron. Colloquium Comput. Complex. TR24 (2024) - [i25]Dean Doron, William Hoza:
Implications of Better PRGs for Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR24 (2024) - [i24]Dean Doron, Jonathan Mosheiff, Mary Wootters:
When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c18]Dean Doron, Roei Tell:
Derandomization with Minimal Memory Footprint. CCC 2023: 11:1-11:15 - [c17]Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Almost Chor-Goldreich Sources and Adversarial Random Walks. STOC 2023: 1-9 - [c16]Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. STOC 2023: 35-45 - [i23]Dean Doron, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. Electron. Colloquium Comput. Complex. TR23 (2023) - [i22]Dean Doron, Roei Tell:
Derandomization with Minimal Memory Footprint. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j5]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Comput. Complex. 31(2): 16 (2022) - [j4]Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Nearly Optimal Pseudorandomness from Hardness. J. ACM 69(6): 43:1-43:55 (2022) - [j3]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy. SIAM J. Comput. 51(2): 17-31 (2022) - [c15]Guy Blanc, Dean Doron:
New Near-Linear Time Decodable Codes Closer to the GV Bound. CCC 2022: 10:1-10:40 - [c14]Dean Doron, Mary Wootters:
High-Probability List-Recovery, and Applications to Heavy Hitters. ICALP 2022: 55:1-55:17 - [i21]Guy Blanc, Dean Doron:
New Near-Linear Time Decodable Codes Closer to the GV Bound. Electron. Colloquium Comput. Complex. TR22 (2022) - [i20]Gil Cohen, Dean Doron, Ori Sberlo:
Approximating Large Powers of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i19]Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i18]Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Almost Chor-Goldreich Sources and Adversarial Random Walks. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c13]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM 2021: 58:1-58:21 - [c12]Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction for Weighted PRGs Against Read Once Branching Programs. CCC 2021: 22:1-22:17 - [i17]Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction For Weighted PRGs Against Read Once Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i16]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c11]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials That Vanish Rarely. APPROX-RANDOM 2020: 7:1-7:23 - [c10]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Erasure List-Decodable Codes. CCC 2020: 1:1-1:27 - [c9]Dean Doron, Pooya Hatami, William M. Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. CCC 2020: 6:1-6:36 - [c8]Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Nearly Optimal Pseudorandomness From Hardness. FOCS 2020: 1057-1068 - [c7]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. ICALP 2020: 39:1-39:21 - [i15]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. CoRR abs/2002.11237 (2020) - [i14]Gil Cohen, Dean Doron, Shahar Samocha:
Seed Protecting Extractors. Electron. Colloquium Comput. Complex. TR20 (2020) - [i13]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i12]Dean Doron, Mary Wootters:
High-Probability List-Recovery, and Applications to Heavy Hitters. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c6]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. APPROX-RANDOM 2019: 43:1-43:20 - [c5]Dean Doron, Pooya Hatami, William M. Hoza:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. CCC 2019: 16:1-16:34 - [i11]Dean Doron, Pooya Hatami, William Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. Electron. Colloquium Comput. Complex. TR19 (2019) - [i10]Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Nearly Optimal Pseudorandomness From Hardness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i9]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [b1]Dean Doron:
Randomness Extractors and Space-Bounded Computation. Tel Aviv University, Israel, 2018 - [c4]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A New Approach for Constructing Low-Error, Two-Source Extractors. CCC 2018: 3:1-3:19 - [i8]Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - [i7]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. Electron. Colloquium Comput. Complex. TR18 (2018) - [i6]Dean Doron, Pooya Hatami, William Hoza:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j2]Dean Doron, Amir Sarid, Amnon Ta-Shma:
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace. Comput. Complex. 26(2): 393-420 (2017) - [c3]Dean Doron, François Le Gall, Amnon Ta-Shma:
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. APPROX-RANDOM 2017: 41:1-41:20 - [c2]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. STOC 2017: 1185-1194 - [i5]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Dean Doron, Francois Le Gall, Amnon Ta-Shma:
Probabilistic logarithmic-space algorithms for Laplacian solvers. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Explicit two-source extractors for near-logarithmic min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Low-error two-source extractors for polynomial min-entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - [i1]Dean Doron, Amir Sarid, Amnon Ta-Shma:
On approximating the eigenvalues of stochastic matrices in probabilistic logspace. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j1]Dean Doron, Amnon Ta-Shma:
On the de-randomization of space-bounded approximate counting problems. Inf. Process. Lett. 115(10): 750-753 (2015) - [c1]Dean Doron, Amnon Ta-Shma:
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace. ICALP (1) 2015: 419-431
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
