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

Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). - Edward Pyne; Salil P. Vadhan (CCC, 2021)

Hitting Sets For Regular Branching Programs. - Edward Pyne (Electron. Colloquium Comput. Complex., 2021)

Pseudodistributions That Beat All Pseudorandom Generators. - Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2021)

Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. - Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2021)

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

Local Access to Random Walks. - Amartya Shankha Biswas; Edward Pyne; Ronitt Rubinfeld (ITCS, 2022)

Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. - Edward Pyne; Salil P. Vadhan (SOSA, 2022)

Fourier Growth of Regular Branching Programs. - Chin Ho Lee; Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2022)

Near-Optimal Derandomization of Medium-Width Branching Programs. - Aaron (Louie) Putterman; Edward Pyne (Electron. Colloquium Comput. Complex., 2022)

Improved Local Computation Algorithms for Constructing Spanners. - Rubi Arviv; Lily Chung; Reut Levi; Edward Pyne (APPROX/RANDOM, 2023)

Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. - AmirMahdi Ahmadinejad; John Peebles; Edward Pyne; Aaron Sidford; Salil P. Vadhan (FOCS, 2023)

Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. - AmirMahdi Ahmadinejad; John Peebles; Edward Pyne; Aaron Sidford; Salil P. Vadhan (CoRR, 2023)

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. - Dean Doron; Edward Pyne; Roei Tell (Electron. Colloquium Comput. Complex., 2023)

On the Power of Regular and Permutation Branching Programs. - Chin Ho Lee; Edward Pyne; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2023)

Time-Space Tradeoffs for BPL via Catalytic Computation. - Edward Pyne (Electron. Colloquium Comput. Complex., 2023)

Certified Hardness vs. Randomness for Log-Space. - Edward Pyne; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2023)

Derandomizing Logspace with a Small Shared Hard Drive. - Edward Pyne (CCC, 2024)

Pseudorandom Linear Codes Are List-Decodable to Capacity. - Aaron (Louie) Putterman; Edward Pyne (ITCS, 2024)

Average-Case Local Computation Algorithms. - Amartya Shankha Biswas; Ruidi Cao; Edward Pyne; Ronitt Rubinfeld (CoRR, 2024)

A Study of Error Reduction Polynomials. - Gil Cohen; Dean Doron; Tomer Manket; Edward Pyne; Yichuan Wang; Tal Yankovitz (Electron. Colloquium Comput. Complex., 2024)

The Structure of Catalytic Space: Capturing Randomness and Time via Compression. - James Cook; Jiatu Li; Ian Mertz; Edward Pyne (Electron. Colloquium Comput. Complex., 2024)

Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. - Jiatu Li; Edward Pyne; Roei Tell (Electron. Colloquium Comput. Complex., 2024)

Catalytic Communication. - Edward Pyne; Nathan S. Sheffield; William Wang (Electron. Colloquium Comput. Complex., 2024)

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

A Fast Coloring Oracle for Average Case Hypergraphs. - Cassandra Marcussen; Edward Pyne; Ronitt Rubinfeld; Asaf Shapira; Shlomo Tauber (APPROX/RANDOM, 2025)

Collapsing Catalytic Classes. - Michal Koucký 001; Ian Mertz; Edward Pyne; Sasha Sami (Electron. Colloquium Comput. Complex., 2025)

When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism. - Dean Doron; Edward Pyne; Roei Tell; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2025)