William M. Hoza

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 24

Top Topics

Recent Progress

Adaptive Algorithms

Space Requirements

Top Venues

Computational Complexity Conference

Publications

William M. Hoza
A Technique for Hardness Amplification Against AC⁰. CCC (2024)
Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS (2023)
Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. STOC (2023)
William M. Hoza, Chris Umans
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. SIAM J. Comput. 51 (2) (2022)
Kuan Cheng, William M. Hoza
Hitting Sets Give Two-Sided Derandomization of Small Space. Theory Comput. 18 (2022)
William M. Hoza
Recent Progress on Derandomizing Space-Bounded Computation. Bull. EATCS 138 (2022)
Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne
Hitting Sets for Regular Branching Programs. CCC (2022)
Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS (2022)
William M. Hoza, Edward Pyne, Salil P. Vadhan
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS (2021)
William M. Hoza
Better Pseudodistributions and Derandomization for Space-Bounded Computation. APPROX-RANDOM (2021)
Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS (2021)
William M. Hoza, David Zuckerman
Simple Optimal Hitting Sets for Small-Success RL. SIAM J. Comput. 49 (4) (2020)
Kuan Cheng, William M. Hoza
Hitting Sets Give Two-Sided Derandomization of Small Space. Computational Complexity Conference (2020)
Dean Doron, Pooya Hatami, William M. Hoza
Log-Seed Pseudorandom Generators via Iterated Restrictions. Computational Complexity Conference (2020)
William M. Hoza
Typically-Correct Derandomization for Small Time and Space. Computational Complexity Conference (2019)
Dean Doron, Pooya Hatami, William M. Hoza
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. Computational Complexity Conference (2019)
William M. Hoza, Adam R. Klivans
Preserving Randomness for Adaptive Algorithms. APPROX-RANDOM (2018)
William M. Hoza
Quantum Communication-Query Tradeoffs. CoRR (2017)
William M. Hoza, Chris Umans
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. STOC (2017)
William M. Hoza
Typically-Correct Derandomization for Small Time and Space. CoRR (2017)
William M. Hoza, Leonard J. Schulman
The Adversarial Noise Threshold for Distributed Protocols. SODA (2016)
William M. Hoza, Adam R. Klivans
Preserving Randomness for Adaptive Algorithms. CoRR (2016)
William M. Hoza, Adam R. Klivans
Preserving Randomness for Adaptive Algorithms. Electron. Colloquium Comput. Complex. 23 (2016)
William M. Hoza, Chris Umans
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. CoRR (2016)
William M. Hoza, Leonard J. Schulman
The Adversarial Noise Threshold for Distributed Protocols. CoRR (2014)