default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Pyne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. Algorithmica 86(10): 3153-3185 (2024)- [c15]Edward Pyne:
Derandomizing Logspace with a Small Shared Hard Drive. CCC 2024: 4:1-4:20 - [c14]Aaron (Louie) Putterman, Edward Pyne:
Pseudorandom Linear Codes Are List-Decodable to Capacity. ITCS 2024: 90:1-90:21 - [c13]Dean Doron
, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. STOC 2024: 2039-2049 - [i19]Amartya Shankha Biswas, Ruidi Cao, Edward Pyne, Ronitt Rubinfeld:
Average-Case Local Computation Algorithms. CoRR abs/2403.00129 (2024) - [i18]Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz:
A Study of Error Reduction Polynomials. Electron. Colloquium Comput. Complex. TR24 (2024) - [i17]James Cook, Jiatu Li, Ian Mertz, Edward Pyne:
The Structure of Catalytic Space: Capturing Randomness and Time via Compression. Electron. Colloquium Comput. Complex. TR24 (2024) - [i16]Jiatu Li, Edward Pyne, Roei Tell:
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c12]Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne:
Improved Local Computation Algorithms for Constructing Spanners. APPROX/RANDOM 2023: 42:1-42:23 - [c11]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. APPROX/RANDOM 2023: 44:1-44:22 - [c10]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. FOCS 2023: 846-854 - [c9]Edward Pyne, Ran Raz, Wei Zhan:
Certified Hardness vs. Randomness for Log-Space. FOCS 2023: 989-1007 - [c8]Aaron (Louie) Putterman, Edward Pyne:
Near-Optimal Derandomization of Medium-Width Branching Programs. STOC 2023: 23-34 - [i15]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. CoRR abs/2301.13541 (2023) - [i14]Edward Pyne, Ran Raz, Wei Zhan:
Certified Hardness vs. Randomness for Log-Space. CoRR abs/2303.16413 (2023) - [i13]Aaron (Louie) Putterman, Edward Pyne:
Pseudorandom Linear Codes are List Decodable to Capacity. CoRR abs/2303.17554 (2023) - [i12]Dean Doron, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. Electron. Colloquium Comput. Complex. TR23 (2023) - [i11]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - [i10]Edward Pyne:
Time-Space Tradeoffs for BPL via Catalytic Computation. Electron. Colloquium Comput. Complex. TR23 (2023) - [i9]Edward Pyne, Ran Raz, Wei Zhan:
Certified Hardness vs. Randomness for Log-Space. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c7]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. APPROX/RANDOM 2022: 2:1-2:21 - [c6]Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne:
Hitting Sets for Regular Branching Programs. CCC 2022: 3:1-3:22 - [c5]Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld:
Local Access to Random Walks. ITCS 2022: 24:1-24:22 - [c4]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. SOSA 2022: 57-67 - [i8]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - [i7]Aaron (Louie) Putterman, Edward Pyne:
Near-Optimal Derandomization of Medium-Width Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c3]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). CCC 2021: 33:1-33:15 - [c2]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. COCOON 2021: 3-12 - [c1]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS 2021: 7:1-7:20 - [i6]Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld:
Local Access to Random Walks. CoRR abs/2102.07740 (2021) - [i5]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. CoRR abs/2111.01997 (2021) - [i4]Edward Pyne:
Hitting Sets For Regular Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i3]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR21 (2021) - [i2]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i1]William Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
