default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam M. Hoza
Person information
- affiliation: University of Chicago, USA
- affiliation (former): University of California at Berkeley, USA
- affiliation (former): University of Texas at Austin, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. Algorithmica 86(10): 3153-3185 (2024)- [j5]Pooya Hatami, William Hoza:
Paradigms for Unconditional Pseudorandom Generators. Found. Trends Theor. Comput. Sci. 16(1-2): 1-210 (2024) - [c15]William M. Hoza:
A Technique for Hardness Amplification Against AC⁰. CCC 2024: 1:1-1:20 - [i19]Dean Doron, William Hoza:
Implications of Better PRGs for Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c14]Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS 2023: 1224-1239 - [c13]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. STOC 2023: 895-904 - [i18]Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Electron. Colloquium Comput. Complex. TR23 (2023) - [i17]Pooya Hatami, William Hoza:
Theory of Unconditional Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR23 (2023) - [i16]William Hoza:
A Technique for Hardness Amplification Against $\mathrm{AC}^0$. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]William M. Hoza:
Recent Progress on Derandomizing Space-Bounded Computation. Bull. EATCS 138 (2022) - [j3]William M. Hoza
, Chris Umans:
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. SIAM J. Comput. 51(2): 17-281 (2022) - [j2]Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. Theory Comput. 18: 1-32 (2022) - [c12]Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne:
Hitting Sets for Regular Branching Programs. CCC 2022: 3:1-3:22 - [i15]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]William Hoza:
Recent Progress on Derandomizing Space-Bounded Computation. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c11]William M. Hoza:
Better Pseudodistributions and Derandomization for Space-Bounded Computation. APPROX-RANDOM 2021: 28:1-28:23 - [c10]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS 2021: 104-115 - [c9]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS 2021: 7:1-7:20 - [i13]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - [i12]William Hoza:
Better Pseudodistributions and Derandomization for Space-Bounded Computation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]William M. Hoza, David Zuckerman:
Simple Optimal Hitting Sets for Small-Success RL. SIAM J. Comput. 49(4): 811-820 (2020) - [c8]Dean Doron, Pooya Hatami, William M. Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. CCC 2020: 6:1-6:36 - [c7]Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. CCC 2020: 10:1-10:25 - [i11]Kuan Cheng, William Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. Electron. Colloquium Comput. Complex. TR20 (2020) - [i10]William Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c6]William M. Hoza:
Typically-Correct Derandomization for Small Time and Space. CCC 2019: 9:1-9:39 - [c5]Dean Doron, Pooya Hatami, William M. Hoza:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. CCC 2019: 16:1-16:34 - [i9]Dean Doron, Pooya Hatami, William Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c4]William M. Hoza, Adam R. Klivans:
Preserving Randomness for Adaptive Algorithms. APPROX-RANDOM 2018: 43:1-43:19 - [c3]William Hoza, David Zuckerman:
Simple Optimal Hitting Sets for Small-Success RL. FOCS 2018: 59-64 - [i8]Dean Doron, Pooya Hatami, William Hoza:
Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - [i7]William Hoza, David Zuckerman:
Simple Optimal Hitting Sets for Small-Success RL. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]William M. Hoza, Chris Umans:
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. STOC 2017: 629-640 - [i6]William M. Hoza:
Quantum Communication-Query Tradeoffs. CoRR abs/1703.07768 (2017) - [i5]William M. Hoza:
Typically-Correct Derandomization for Small Time and Space. CoRR abs/1711.00565 (2017) - 2016
- [c1]William M. Hoza, Leonard J. Schulman:
The Adversarial Noise Threshold for Distributed Protocols. SODA 2016: 240-258 - [i4]William M. Hoza, Chris Umans:
Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. CoRR abs/1610.01199 (2016) - [i3]William M. Hoza, Adam R. Klivans:
Preserving Randomness for Adaptive Algorithms. CoRR abs/1611.00783 (2016) - [i2]William M. Hoza, Adam R. Klivans:
Preserving Randomness for Adaptive Algorithms. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [i1]William M. Hoza, Leonard J. Schulman:
The Adversarial Noise Threshold for Distributed Protocols. CoRR abs/1412.8097 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
