Pyne, Edward
61  results:
Search for persons X
?
1

Opening Up the Distinguisher: A Hardness to Randomness Appr..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Doron, Dean ; Pyne, Edward ; Tell, Roei - p. 2039-2049 , 2024
 
?
2

Certified Hardness vs. Randomness for Log-Space:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Pyne, Edward ; Raz, Ran ; Zhan, Wei - p. 989-1007 , 2023
 
?
3

Near-Optimal Derandomization of Medium-Width Branching Prog..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
 
?
4

Singular Value Approximation and Sparsifying Random Walks o..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
 
?
6

Hitting sets for regular branching programs:

, In: Proceedings of the 37th Computational Complexity Conference,
 
?
7

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Pyne, Edward ; Vadhan, Salil - p. 3-12 , 2021
 
?
8

Pseudodistributions that beat all pseudorandom generators (..:

, In: Proceedings of the 36th Computational Complexity Conference,
Pyne, Edward ; Vadhan, Salil - p. 1 ff. , 2021
 
?
9

Pseudorandom Linear Codes Are List-Decodable to Capacity:

Putterman, Aaron (Louie) ; Pyne, Edward
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024).  , 2024
 
1-15