Edward Pyne

Orcid: 0000-0002-3454-2057

According to our database1, Edward Pyne authored at least 24 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs.
Algorithmica, October, 2024

Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness.
Electron. Colloquium Comput. Complex., 2024

The Structure of Catalytic Space: Capturing Randomness and Time via Compression.
Electron. Colloquium Comput. Complex., 2024

A Study of Error Reduction Polynomials.
Electron. Colloquium Comput. Complex., 2024

Average-Case Local Computation Algorithms.
CoRR, 2024

Pseudorandom Linear Codes Are List-Decodable to Capacity.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Derandomizing Logspace with a Small Shared Hard Drive.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Certified Hardness vs. Randomness for Log-Space.
Electron. Colloquium Comput. Complex., 2023

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

On the Power of Regular and Permutation Branching Programs.
Electron. Colloquium Comput. Complex., 2023

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL.
Electron. Colloquium Comput. Complex., 2023

Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification.
CoRR, 2023

Singular Value Approximation and Sparsifying Random Walks on Directed Graphs.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Improved Local Computation Algorithms for Constructing Spanners.
Proceedings of the Approximation, 2023

2022
Near-Optimal Derandomization of Medium-Width Branching Programs.
Electron. Colloquium Comput. Complex., 2022

Fourier Growth of Regular Branching Programs.
Electron. Colloquium Comput. Complex., 2022

Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Local Access to Random Walks.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Hitting Sets for Regular Branching Programs.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs.
Electron. Colloquium Comput. Complex., 2021

Pseudodistributions That Beat All Pseudorandom Generators.
Electron. Colloquium Comput. Complex., 2021

Hitting Sets For Regular Branching Programs.
Electron. Colloquium Comput. Complex., 2021

Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract).
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs.
Electron. Colloquium Comput. Complex., 2020


  Loading...