| 2025 | FOCS | Collapsing Catalytic Classes. | Michal Kouck, Ian Mertz, Edward Pyne, Sasha Sami |
| 2025 | STOC | The Structure of Catalytic Space: Capturing Randomness and Time via Compression. | James Cook, Jiatu Li, Ian Mertz, Edward Pyne |
| 2025 | STOC | When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. | Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams |
| 2024 | FOCS | Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. | Jiatu Li, Edward Pyne, Roei Tell |
| 2024 | STOC | Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. | Dean Doron, Edward Pyne, Roei Tell |
| 2023 | FOCS | Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. | AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan |
| 2023 | FOCS | Certified Hardness vs. Randomness for Log-Space. | Edward Pyne, Ran Raz, Wei Zhan |
| 2023 | STOC | Near-Optimal Derandomization of Medium-Width Branching Programs. | Aaron (Louie) Putterman, Edward Pyne |
| 2021 | COCOON | Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. | Edward Pyne, Salil P. Vadhan |