William M. Hoza

Electron. Colloquium Comput. Complex., 2025

On Sums of INW Pseudorandom Generators.

[BibT_eX]

[DOI]

Zelin Lv

Proceedings of the Approximation, 2025

Fooling Near-Maximal Decision Trees.

[BibT_eX]

[DOI]

Zelin Lv

Proceedings of the Approximation, 2025

Implications of Better PRGs for Permutation Branching Programs.

[BibT_eX]

[DOI]

Dean Doron

Proceedings of the Approximation, 2025

2024

Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs.

[BibT_eX]

[DOI]

Edward Pyne

Salil P. Vadhan

Algorithmica, October, 2024

Paradigms for Unconditional Pseudorandom Generators.

[BibT_eX]

[DOI]

Found. Trends Theor. Comput. Sci., 2024

Provable Tempered Overfitting of Minimal Nets and Typical Nets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

A Technique for Hardness Amplification Against AC⁰.

[BibT_eX]

[DOI]

Proceedings of the 39th Computational Complexity Conference, 2024

2023

A Technique for Hardness Amplification Against $\mathrm{AC}^0$.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Theory of Unconditional Pseudorandom Generators.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Recent Progress on Derandomizing Space-Bounded Computation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Hitting Sets for Regular Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Fooling Constant-Depth Threshold Circuits.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Pseudorandom Generators for Unbounded-Width Permutation Branching Programs.

[BibT_eX]

[DOI]

Edward Pyne

Salil P. Vadhan

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Fooling Constant-Depth Threshold Circuits (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Better Pseudodistributions and Derandomization for Space-Bounded Computation.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

2020

Log-Seed Pseudorandom Generators via Iterated Restrictions.

[BibT_eX]

[DOI]

Dean Doron

Proceedings of the 35th Computational Complexity Conference, 2020

Hitting Sets Give Two-Sided Derandomization of Small Space.

[BibT_eX]

[DOI]

Kuan Cheng

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Typically-Correct Derandomization for Small Time and Space.

[BibT_eX]

[DOI]

Proceedings of the 34th Computational Complexity Conference, 2019

Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas.

[BibT_eX]

[DOI]

Dean Doron

Proceedings of the 34th Computational Complexity Conference, 2019

2018

Simple Optimal Hitting Sets for Small-Success RL.

[BibT_eX]

[DOI]

David Zuckerman

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Preserving Randomness for Adaptive Algorithms.

[BibT_eX]

[DOI]

Adam R. Klivans

Proceedings of the Approximation, 2018

2017

Quantum Communication-Query Tradeoffs.

[BibT_eX]

[DOI]

CoRR, 2017

Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace.

[BibT_eX]

[DOI]

Chris Umans

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

The Adversarial Noise Threshold for Distributed Protocols.

[BibT_eX]

[DOI]