Implications of Better PRGs for Permutation Branching Programs.

William M. Hoza William Hoza University of Chicago, USA University of California at Berkeley, USA University of Texas at Austin, TX, USA https://williamhoza.com/ https://orcid.org/0000-0001-5162-9181 Dean Doron William M. Hoza Implications of Better PRGs for Permutation Branching Programs. 28:1-28:20 2025 APPROX/RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.28 conf/approx/2025 db/conf/approx/approx2025.html#DoronH25 William M. Hoza Zelin Lv Fooling Near-Maximal Decision Trees. 35:1-35:24 2025 APPROX/RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.35 conf/approx/2025 db/conf/approx/approx2025.html#HozaL25 William M. Hoza Zelin Lv On Sums of INW Pseudorandom Generators. 67:1-67:24 2025 APPROX/RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.67 conf/approx/2025 db/conf/approx/approx2025.html#HozaL25a

William Hoza Fooling Near-Maximal Decision Trees. TR25-003 2025 TR25 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2025/003 db/journals/eccc/eccc2025.html#Hoza25

William Hoza Zelin Lv On Sums of INW Pseudorandom Generators. TR25-050 2025 TR25 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2025/050 db/journals/eccc/eccc2025.html#HozaL25

William M. Hoza Edward Pyne Salil P. Vadhan Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. 3153-3185 2024 October 86 Algorithmica 10 https://doi.org/10.1007/s00453-024-01251-2 db/journals/algorithmica/algorithmica86.html#HozaPV24 streams/journals/algorithmica

Pooya Hatami William Hoza Paradigms for Unconditional Pseudorandom Generators. 1-210 2024 16 Found. Trends Theor. Comput. Sci. 1-2 https://doi.org/10.1561/0400000109 db/journals/fttcs/fttcs16.html#HatamiH24

William M. Hoza A Technique for Hardness Amplification Against AC⁰. 1:1-1:20 2024 CCC https://doi.org/10.4230/LIPIcs.CCC.2024.1 conf/coco/2024 db/conf/coco/coco2024.html#Hoza24 Itamar Harel William Hoza Gal Vardi Itay Evron Nati Srebro Daniel Soudry Provable Tempered Overfitting of Minimal Nets and Typical Nets. 2024 NeurIPS http://papers.nips.cc/paper_files/paper/2024/hash/5fff164c04811174e1836dc3e66c0aba-Abstract-Conference.html conf/nips/2024 db/conf/nips/neurips2024.html#HarelHVESS24

Itamar Harel William M. Hoza Gal Vardi Itay Evron Nathan Srebro Daniel Soudry Provable Tempered Overfitting of Minimal Nets and Typical Nets. 2024 abs/2410.19092 CoRR https://doi.org/10.48550/arXiv.2410.19092 db/journals/corr/corr2410.html#abs-2410-19092 streams/journals/corr

Dean Doron William Hoza Implications of Better PRGs for Permutation Branching Programs. TR24-137 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/137 db/journals/eccc/eccc2024.html#DoronH24

Lijie Chen 0001 William M. Hoza Xin Lyu 0002 Avishay Tal Hongxun Wu Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. 1224-1239 2023 FOCS https://doi.org/10.1109/FOCS57990.2023.00072 conf/focs/2023 db/conf/focs/focs2023.html#0001H0TW23 Pooya Hatami William M. Hoza Avishay Tal Roei Tell Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. 895-904 2023 STOC https://doi.org/10.1145/3564246.3585216 conf/stoc/2023 db/conf/stoc/stoc2023.html#HatamiHTT23

Lijie Chen 0001 William Hoza Xin Lyu 0002 Avishay Tal Hongxun Wu Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. TR23-114 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/114 db/journals/eccc/eccc2023.html#0001H0TW23

Pooya Hatami William Hoza Theory of Unconditional Pseudorandom Generators. TR23-019 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/019 db/journals/eccc/eccc2023.html#HatamiH23

William Hoza A Technique for Hardness Amplification Against $\mathrm{AC}^0$. TR23-176 2023 TR23 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2023/176 db/journals/eccc/eccc2023.html#Hoza23

William M. Hoza Recent Progress on Derandomizing Space-Bounded Computation. 2022 138 Bull. EATCS http://eatcs.org/beatcs/index.php/beatcs/article/view/728 db/journals/eatcs/eatcs138.html#Hoza22

William M. Hoza Chris Umans Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. 17-281 2022 51 SIAM J. Comput. 2 https://doi.org/10.1137/17m1145707 db/journals/siamcomp/siamcomp51.html#HozaU22

Kuan Cheng William M. Hoza Hitting Sets Give Two-Sided Derandomization of Small Space. 1-32 2022 18 Theory Comput. https://doi.org/10.4086/toc.2022.v018a021 db/journals/toc/toc18.html#ChengH22

Andrej Bogdanov William M. Hoza Gautam Prakriya Edward Pyne Hitting Sets for Regular Branching Programs. 3:1-3:22 2022 CCC https://doi.org/10.4230/LIPIcs.CCC.2022.3 conf/coco/2022 db/conf/coco/coco2022.html#BogdanovHPP22

Pooya Hatami William Hoza Avishay Tal Roei Tell Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. TR22-087 2022 TR22 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2022/087 db/journals/eccc/eccc2022.html#HatamiHTT22

William Hoza Recent Progress on Derandomizing Space-Bounded Computation. TR22-121 2022 TR22 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2022/121 db/journals/eccc/eccc2022.html#Hoza22

William M. Hoza Better Pseudodistributions and Derandomization for Space-Bounded Computation. 28:1-28:23 2021 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.28 conf/approx/2021 db/conf/approx/approx2021.html#Hoza21 Pooya Hatami William M. Hoza Avishay Tal Roei Tell Fooling Constant-Depth Threshold Circuits (Extended Abstract). 104-115 2021 FOCS https://doi.org/10.1109/FOCS52979.2021.00019 conf/focs/2021 db/conf/focs/focs2021.html#HatamiHTT21 William M. Hoza Edward Pyne Salil P. Vadhan Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. 7:1-7:20 2021 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2021.7 conf/innovations/2021 db/conf/innovations/innovations2021.html#HozaPV21

Pooya Hatami William Hoza Avishay Tal Roei Tell Fooling Constant-Depth Threshold Circuits. TR21-002 2021 TR21 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2021/002 db/journals/eccc/eccc28.html#HatamiHTT21

William Hoza Better Pseudodistributions and Derandomization for Space-Bounded Computation. TR21-048 2021 TR21 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2021/048 db/journals/eccc/eccc28.html#Hoza21

William M. Hoza David Zuckerman Simple Optimal Hitting Sets for Small-Success RL. 811-820 2020 49 SIAM J. Comput. 4 https://doi.org/10.1137/19M1268707 db/journals/siamcomp/siamcomp49.html#HozaZ20

Dean Doron Pooya Hatami William M. Hoza Log-Seed Pseudorandom Generators via Iterated Restrictions. 6:1-6:36 2020 CCC https://doi.org/10.4230/LIPIcs.CCC.2020.6 conf/coco/2020 db/conf/coco/coco2020.html#DoronHH20 Kuan Cheng William M. Hoza Hitting Sets Give Two-Sided Derandomization of Small Space. 10:1-10:25 2020 CCC https://doi.org/10.4230/LIPIcs.CCC.2020.10 conf/coco/2020 db/conf/coco/coco2020.html#ChengH20

Kuan Cheng William Hoza Hitting Sets Give Two-Sided Derandomization of Small Space. TR20-016 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/016 db/journals/eccc/eccc27.html#ChengH20

William Hoza Edward Pyne Salil P. Vadhan Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. TR20-138 2020 TR20 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2020/138 db/journals/eccc/eccc27.html#HozaPV20

William M. Hoza Typically-Correct Derandomization for Small Time and Space. 9:1-9:39 2019 CCC https://doi.org/10.4230/LIPIcs.CCC.2019.9 conf/coco/2019 db/conf/coco/coco2019.html#Hoza19 Dean Doron Pooya Hatami William M. Hoza Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. 16:1-16:34 2019 CCC https://doi.org/10.4230/LIPIcs.CCC.2019.16 conf/coco/2019 db/conf/coco/coco2019.html#DoronHH19

Dean Doron Pooya Hatami William Hoza Log-Seed Pseudorandom Generators via Iterated Restrictions. TR19-149 2019 TR19 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2019/149 db/journals/eccc/eccc26.html#DoronHH19

William M. Hoza Adam R. Klivans Preserving Randomness for Adaptive Algorithms. 43:1-43:19 2018 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.43 conf/approx/2018 db/conf/approx/approx2018.html#HozaK18 William Hoza David Zuckerman Simple Optimal Hitting Sets for Small-Success RL. 59-64 2018 FOCS https://doi.org/10.1109/FOCS.2018.00015 https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00015 conf/focs/2018 db/conf/focs/focs2018.html#HozaZ18

Dean Doron Pooya Hatami William Hoza Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. TR18-183 2018 TR18 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2018/183 db/journals/eccc/eccc25.html#DoronHH18

William Hoza David Zuckerman Simple Optimal Hitting Sets for Small-Success RL. TR18-063 2018 TR18 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2018/063 db/journals/eccc/eccc25.html#HozaZ18

William M. Hoza Chris Umans Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. 629-640 2017 STOC https://doi.org/10.1145/3055399.3055414 conf/stoc/2017 db/conf/stoc/stoc2017.html#HozaU17

William M. Hoza Quantum Communication-Query Tradeoffs. 2017 abs/1703.07768 CoRR http://arxiv.org/abs/1703.07768 db/journals/corr/corr1703.html#Hoza17

William M. Hoza Typically-Correct Derandomization for Small Time and Space. 2017 abs/1711.00565 CoRR http://arxiv.org/abs/1711.00565 db/journals/corr/corr1711.html#abs-1711-00565

William M. Hoza Leonard J. Schulman The Adversarial Noise Threshold for Distributed Protocols. 240-258 2016 SODA https://doi.org/10.1137/1.9781611974331.ch18 http://dl.acm.org/citation.cfm?id=2884453 conf/soda/2016 db/conf/soda/soda2016.html#HozaS16

William M. Hoza Chris Umans Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. 2016 abs/1610.01199 CoRR http://arxiv.org/abs/1610.01199 db/journals/corr/corr1610.html#HozaU16

William M. Hoza Adam R. Klivans Preserving Randomness for Adaptive Algorithms. 2016 abs/1611.00783 CoRR http://arxiv.org/abs/1611.00783 db/journals/corr/corr1611.html#HozaK16

William M. Hoza Adam R. Klivans Preserving Randomness for Adaptive Algorithms. TR16-172 2016 TR16 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2016/172 db/journals/eccc/eccc23.html#HozaK16

William M. Hoza Leonard J. Schulman The Adversarial Noise Threshold for Distributed Protocols. 2014 abs/1412.8097 CoRR http://arxiv.org/abs/1412.8097 db/journals/corr/corr1412.html#HozaS14

Andrej Bogdanov Lijie Chen 0001 Kuan Cheng Dean Doron Itay Evron Itamar Harel Pooya Hatami Adam R. Klivans Zelin Lv Xin Lyu 0002 Gautam Prakriya Edward Pyne Leonard J. Schulman Daniel Soudry Nathan SrebroNati Srebro Avishay Tal Roei Tell Christopher UmansChris Umans Salil P. Vadhan Gal Vardi Hongxun Wu David Zuckerman