I agree that this site is using cookies. You can find further informations here.
X
Doron, Dean
52  results:
Search for persons X
?
1

Opening Up the Distinguisher: A Hardness to Randomness Appr..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Doron, Dean ; Pyne, Edward ; Tell, Roei - p. 2039-2049 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Small-Space Spectral Sparsification via Bounded-Independenc..:

Doron, Dean ; Murtagh, Jack ; Vadhan, Salil.
ACM Transactions on Computation Theory.  16 (2024)  2 - p. 1-32 , 2024
Link: https://doi.org/10.1145/..
 
?
3

Approximating Iterated Multiplication of Stochastic Matrice..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Cohen, Gil ; Doron, Dean ; Sberlo, Ori. - p. 35-45 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Almost Chor-Goldreich Sources and Adversarial Random Walks:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Doron, Dean ; Moshkovitz, Dana ; Oh, Justin. - p. 1-9 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

On Hitting-Set Generators for Polynomials that Vanish Rarel:

Doron, Dean ; Ta-Shma, Amnon ; Tell, Roei
computational complexity.  31 (2022)  2 - p. , 2022
Link: https://doi.org/10.1007/..
 
?
6

Nearly Optimal Pseudorandomness from Hardness:

Doron, Dean ; Moshkovitz, Dana ; Oh, Justin.
Journal of the ACM.  69 (2022)  6 - p. 1-55 , 2022
Link: https://doi.org/10.1145/..
 
?
7

New near-linear time decodable codes closer to the GV bound:

, In: Proceedings of the 37th Computational Complexity Conference,
Blanc, Guy ; Doron, Dean - p. 1-40 , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Error reduction for weighted PRGs against read once branchi..:

, In: Proceedings of the 36th Computational Complexity Conference,
Cohen, Gil ; Doron, Dean ; Renard, Oren.. - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Log-seed pseudorandom generators via iterated restrictions:

, In: Proceedings of the 35th Computational Complexity Conference,
Doron, Dean ; Hatami, Pooya ; Hoza, William M. - p. 1-36 , 2020
Link: https://dl.acm.org/doi/1..
 
?
10

Near-optimal erasure list-decodable codes:

, In: Proceedings of the 35th Computational Complexity Conference,
Ben-Aroya, Avraham ; Doron, Dean ; Ta-Shma, Amnon - p. 1-27 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Nearly Optimal Pseudorandomness From Hardness:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Doron, Dean ; Moshkovitz, Dana ; Oh, Justin. - p. 1057-1068 , 2020
Link: https://doi.org/10.1109/..
 
?
12

Near-optimal pseudorandom generators for constant-depth rea..:

, In: Proceedings of the 34th Computational Complexity Conference,
Doron, Dean ; Hatami, Pooya ; Hoza, William M. - p. 1-34 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

An Efficient Reduction from Two-Source to Nonmalleable Extr..:

Ben-Aroya, Avraham ; Doron, Dean ; Ta-Shma, Amnon
SIAM Journal on Computing.  51 (2019)  2 - p. STOC17-31-STOC17-49 , 2019
Link: https://doi.org/10.1137/..
 
?
14

A new approach for constructing low-error, two-source extra..:

, In: Proceedings of the 33rd Computational Complexity Conference,
Ben-Aroya, Avraham ; Chattopadhyay, Eshan ; Doron, Dean.. - p. 1-19 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

An efficient reduction from two-source to non-malleable ext..:

, In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing,
Ben-Aroya, Avraham ; Doron, Dean ; Ta-Shma, Amnon - p. 1185-1194 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15