The Adversarial Noise Threshold for Distributed Protocols. - William M. Hoza; Leonard J. Schulman (SODA, 2016)

Preserving Randomness for Adaptive Algorithms. - William M. Hoza; Adam R. Klivans (Electron. Colloquium Comput. Complex., 2016)

Quantum Communication-Query Tradeoffs. - William M. Hoza (CoRR, 2017)

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. - Dean Doron; Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2018)

Typically-Correct Derandomization for Small Time and Space. - William M. Hoza (CCC, 2019)

Log-Seed Pseudorandom Generators via Iterated Restrictions. - Dean Doron; Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2019)

Hitting Sets Give Two-Sided Derandomization of Small Space. - Kuan Cheng; William Hoza (Electron. Colloquium Comput. Complex., 2020)

Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. - William Hoza; Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2020)

Simple Optimal Hitting Sets for Small-Success RL. - William M. Hoza; David Zuckerman (SIAM J. Comput., 2020)

Fooling Constant-Depth Threshold Circuits (Extended Abstract). - Pooya Hatami; William M. Hoza; Avishay Tal; Roei Tell (FOCS, 2021)

Fooling Constant-Depth Threshold Circuits. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2021)

Better Pseudodistributions and Derandomization for Space-Bounded Computation. - William Hoza (Electron. Colloquium Comput. Complex., 2021)

Hitting Sets for Regular Branching Programs. - Andrej Bogdanov; William M. Hoza; Gautam Prakriya; Edward Pyne (CCC, 2022)

Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

Recent Progress on Derandomizing Space-Bounded Computation. - William Hoza (Electron. Colloquium Comput. Complex., 2022)

Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. - William M. Hoza; Chris Umans (SIAM J. Comput., 2022)

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. - Lijie Chen 001; William Hoza; Xin Lyu 002; Avishay Tal; Hongxun Wu (Electron. Colloquium Comput. Complex., 2023)

Theory of Unconditional Pseudorandom Generators. - Pooya Hatami; William Hoza (Electron. Colloquium Comput. Complex., 2023)

A Technique for Hardness Amplification Against $ mathrm{AC}^0$. - William Hoza (Electron. Colloquium Comput. Complex., 2023)

A Technique for Hardness Amplification Against AC⁰. - William M. Hoza (CCC, 2024)

Provable Tempered Overfitting of Minimal Nets and Typical Nets. - Itamar Harel; William Hoza; Gal Vardi; Itay Evron; Nati Srebro; Daniel Soudry (NeurIPS, 2024)

Implications of Better PRGs for Permutation Branching Programs. - Dean Doron; William Hoza (Electron. Colloquium Comput. Complex., 2024)

Paradigms for Unconditional Pseudorandom Generators. - Pooya Hatami; William Hoza (Found. Trends Theor. Comput. Sci., 2024)

Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. - William M. Hoza; Edward Pyne; Salil P. Vadhan (Algorithmica, 2024)

Fooling Near-Maximal Decision Trees. - William M. Hoza; Zelin Lv (APPROX/RANDOM, 2025)

Fooling Near-Maximal Decision Trees. - William Hoza (Electron. Colloquium Comput. Complex., 2025)

On Sums of INW Pseudorandom Generators. - William Hoza; Zelin Lv (Electron. Colloquium Comput. Complex., 2025)