| Pseudorandom generators for unbounded-width permutation branching programs WM Hoza, E Pyne, S Vadhan 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021 | 28 | 2021 |
| Pseudodistributions that beat all pseudorandom generators E Pyne, S Vadhan 36th Computational Complexity Conference (CCC 2021), 2021 | 24 | 2021 |
| Hitting sets for regular branching programs A Bogdanov, WM Hoza, G Prakriya, E Pyne 37th Computational Complexity Conference (CCC 2022), 2022 | 14 | 2022 |
| Certified hardness vs. randomness for log-space E Pyne, R Raz, W Zhan 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 10 | 2023 |
| Fourier growth of regular branching programs CH Lee, E Pyne, S Vadhan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 10 | 2022 |
| Singular Value Approximation and Sparsifying Random Walks on Directed Graphs AM Ahmadinejad, J Peebles, E Pyne, A Sidford, S Vadhan 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 9* | 2023 |
| Deterministic approximation of random walks via queries in graphs of unbounded size E Pyne, S Vadhan Symposium on Simplicity in Algorithms (SOSA), 57-67, 2022 | 8 | 2022 |
| Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL= L That Uses Properties of BPL D Doron, E Pyne, R Tell Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2039-2049, 2024 | 7 | 2024 |
| Derandomizing logspace with a small shared hard drive E Pyne 39th Computational Complexity Conference (CCC 2024), 2024 | 6 | 2024 |
| The structure of catalytic space: Capturing randomness and time via compression J Cook, J Li, I Mertz, E Pyne Electronic Colloquium on Computational Complexity (ECCC), TR24-106, 2024 | 5 | 2024 |
| On the power of regular and permutation branching programs CH Lee, E Pyne, S Vadhan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2023 | 5 | 2023 |
| Local Access to Random Walks, January 2022 AS Biswas, E Pyne, R Rubinfeld Innovations in Theoretical Computer Science (ITCS 2022), 2022 | 5* | 2022 |
| Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching Programs WM Hoza, E Pyne, S Vadhan Algorithmica 86 (10), 3153-3185, 2024 | 4* | 2024 |
| Pseudorandom linear codes are list decodable to capacity AL Putterman, E Pyne arXiv preprint arXiv:2303.17554, 2023 | 4 | 2023 |
| Improved Local Computation Algorithms for Constructing Spanners R Arviv, L Chung, R Levi, E Pyne arXiv preprint arXiv:2105.04847, 2021 | 4 | 2021 |
| Near-optimal derandomization of medium-width branching programs A Putterman, E Pyne Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 23-34, 2023 | 2 | 2023 |
| Distinguishing, predicting, and certifying: On the long reach of partial notions of pseudorandomness J Li, E Pyne, R Tell 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 1-13, 2024 | 1 | 2024 |
| Average-Case Local Computation Algorithms A Shankha Biswas, R Cao, E Pyne, R Rubinfeld arXiv e-prints, arXiv: 2403.00129, 2024 | 1* | 2024 |
| Quantifying the impact of data encoding on DNN fault tolerance E Pyne, L Pentecost, U Gupta, GY Wei, D Brooks FASTPATH, 2020 | 1 | 2020 |
| LIPIcs, Volume 185, ITCS 2021, Complete Volume}} JR Lee, Y Dagan, Y Filmus, D Kane, S Moran, R Impagliazzo, S McGuire, ... 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) 185 …, 2021 | | 2021 |
