We stand with Ukraine  

William M. Hoza

Orcid: 0000-0001-5162-9181

Affiliations:
  • University of California at Berkeley, USA
  • University of Texas at Austin, TX, USA (former)


According to our database1, William M. Hoza authored at least 20 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Paradigms for Unconditional Pseudorandom Generators.
[BibTeX]
[DOI]
Pooya Hatami
,
William Hoza
Found. Trends Theor. Comput. Sci., 2024

2023
A Technique for Hardness Amplification Against $\mathrm{AC}^0$.
[BibTeX]
[DOI]
William Hoza
Electron. Colloquium Comput. Complex., 2023

Theory of Unconditional Pseudorandom Generators.
[BibTeX]
[DOI]
Pooya Hatami
,
William Hoza
Electron. Colloquium Comput. Complex., 2023

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.
[BibTeX]
[DOI]
Lijie Chen
,
William Hoza
,
Xin Lyu
,
Avishay Tal
,
Hongxun Wu
Electron. Colloquium Comput. Complex., 2023

2022
Hitting Sets Give Two-Sided Derandomization of Small Space.
[BibTeX]
[DOI]
Kuan Cheng
,
William M. Hoza
Theory Comput., 2022

Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace.
[BibTeX]
[DOI]
William M. Hoza
,
Chris Umans
SIAM J. Comput., 2022

Recent Progress on Derandomizing Space-Bounded Computation.
[BibTeX]
[DOI]
William Hoza
Electron. Colloquium Comput. Complex., 2022

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

Hitting Sets for Regular Branching Programs.
[BibTeX]
[DOI]
Andrej Bogdanov
,
William M. Hoza
,
Gautam Prakriya
,
Edward Pyne
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Better Pseudodistributions and Derandomization for Space-Bounded Computation.
[BibTeX]
[DOI]
William Hoza
Electron. Colloquium Comput. Complex., 2021

Fooling Constant-Depth Threshold Circuits.
[BibTeX]
[DOI]
Pooya Hatami
,
William Hoza
,
Avishay Tal
,
Roei Tell
Electron. Colloquium Comput. Complex., 2021

Fooling Constant-Depth Threshold Circuits (Extended Abstract).
[BibTeX]
[DOI]
Pooya Hatami
,
William M. Hoza
,
Avishay Tal
,
Roei Tell
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs.
[BibTeX]
[DOI]
William Hoza
,
Edward Pyne
,
Salil P. Vadhan
Electron. Colloquium Comput. Complex., 2020

2019
Log-Seed Pseudorandom Generators via Iterated Restrictions.
[BibTeX]
[DOI]
Dean Doron
,
Pooya Hatami
,
William Hoza
Electron. Colloquium Comput. Complex., 2019

Typically-Correct Derandomization for Small Time and Space.
[BibTeX]
[DOI]
William M. Hoza
Proceedings of the 34th Computational Complexity Conference, 2019

2018
Simple Optimal Hitting Sets for Small-Success RL.
[BibTeX]
[DOI]
William Hoza
,
David Zuckerman
Electron. Colloquium Comput. Complex., 2018

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas.
[BibTeX]
[DOI]
Dean Doron
,
Pooya Hatami
,
William Hoza
Electron. Colloquium Comput. Complex., 2018

2017
Quantum Communication-Query Tradeoffs.
[BibTeX]
[DOI]
William M. Hoza
CoRR, 2017

2016
Preserving Randomness for Adaptive Algorithms.
[BibTeX]
[DOI]
William M. Hoza
,
Adam R. Klivans
Electron. Colloquium Comput. Complex., 2016

The Adversarial Noise Threshold for Distributed Protocols.
[BibTeX]
[DOI]
William M. Hoza
,
Leonard J. Schulman
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016


  Loading...