default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndy Lewis-Pye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j13]George Barmpalias
, Nan Fang, Andrew Lewis-Pye:
Monotonous betting strategies in warped casinos. Inf. Comput. 271: 104480 (2020)- 2019
- [j12]George Barmpalias, Andrew Lewis-Pye:
Compression of Data Streams Down to Their Information Content. IEEE Trans. Inf. Theory 65(7): 4471-4485 (2019) - 2018
- [j11]Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova, Mariya Ivanova Soskova, Peter van Emde Boas, Stanley S. Wainer:
S. Barry Cooper (1943-2015). Comput. 7(2-3): 103-131 (2018) - [j10]George Barmpalias, Andrew Lewis-Pye, Angsheng Li:
Pointed computations and Martin-Löf randomness. Comput. 7(2-3): 171-177 (2018) - [j9]Andrew E. M. Lewis-Pye:
The search for natural definability in the Turing degrees. Comput. 7(2-3): 189-235 (2018) - [j8]George Barmpalias, Andrew Lewis-Pye:
Optimal redundancy in computations from random oracles. J. Comput. Syst. Sci. 92: 1-8 (2018) - [j7]S. Barry Cooper, Andy Lewis-Pye, Angsheng Li, Yicheng Pan:
Establishing social cooperation: The role of hubs and community structure. Netw. Sci. 6(2): 251-264 (2018) - 2017
- [j6]George Barmpalias, Andrew Lewis-Pye:
Differences of halting probabilities. J. Comput. Syst. Sci. 89: 349-360 (2017) - [j5]Andrew Lewis-Pye, Wolfgang Merkle:
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015). Theory Comput. Syst. 61(4): 1252-1253 (2017) - [j4]George Barmpalias, Andrew Lewis-Pye:
Computing halting probabilities from other halting probabilities. Theor. Comput. Sci. 660: 16-22 (2017) - 2016
- [j3]Andrew Lewis-Pye, Andrea Sorbi:
In Memoriam: Barry Cooper 1943-2015. Bull. Symb. Log. 22(3): 361-365 (2016) - [j2]George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251: 287-300 (2016) - [j1]George Barmpalias, Nan Fang, Andrew Lewis-Pye:
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. J. Comput. Syst. Sci. 82(8): 1283-1299 (2016)
Conference and Workshop Papers
- 2024
- [c7]Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor, Kartik Nayak:
Lumiere: Making Optimal BFT for Partial Synchrony Practical. PODC 2024: 135-144 - [c6]Eric Budish, Andrew Lewis-Pye, Tim Roughgarden:
The Economic Limits of Permissionless Consensus. EC 2024: 704-731 - 2023
- [c5]Andrew Lewis-Pye, Tim Roughgarden:
Byzantine Generals in the Permissionless Setting. FC (1) 2023: 21-37 - [c4]Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. OPODIS 2023: 14:1-14:16 - 2021
- [c3]Andrew Lewis-Pye, Tim Roughgarden:
How Does Blockchain Security Dictate Blockchain Implementation? CCS 2021: 1006-1019 - 2017
- [c2]George Barmpalias, Andrew Lewis-Pye:
A Note on the Differences of Computably Enumerable Reals. Computability and Complexity 2017: 623-632 - 2014
- [c1]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
Digital Morphogenesis via Schelling Segregation. FOCS 2014: 156-165
Informal and Other Publications
- 2025
- [i32]Andrew Lewis-Pye, Tim Roughgarden:
Beyond Optimal Fault Tolerance. CoRR abs/2501.06044 (2025) - [i31]Aaron Buchwald, Stephen Buttolph, Andrew Lewis-Pye, Kevin Sekniqi:
Snowman for partial synchrony. CoRR abs/2501.15904 (2025) - [i30]Andrew Lewis-Pye, Ehud Shapiro:
Morpheus Consensus: Excelling on trails and autobahns. CoRR abs/2502.08465 (2025) - [i29]Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini:
Accountable Liveness. CoRR abs/2504.12218 (2025) - [i28]Idit Keidar, Andrew Lewis-Pye, Ehud Shapiro:
Grassroots Consensus. CoRR abs/2505.19216 (2025) - [i27]Andrew Lewis-Pye, Tim Roughgarden:
Beyond Optimal Fault-Tolerance. IACR Cryptol. ePrint Arch. 2025: 70 (2025) - [i26]Tiantian Gong, Gustavo Franco Camilo, Kartik Nayak, Andrew Lewis-Pye, Aniket Kate:
Recover from Excessive Faults in Partially-Synchronous BFT SMR. IACR Cryptol. ePrint Arch. 2025: 83 (2025) - [i25]Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca Zanolini:
Accountable Liveness. IACR Cryptol. ePrint Arch. 2025: 693 (2025) - 2024
- [i24]Aaron Buchwald, Stephen Buttolph, Andrew Lewis-Pye, Patrick O'Grady, Kevin Sekniqi:
Frosty: Bringing strong liveness guarantees to the Snow family of consensus protocols. CoRR abs/2404.14250 (2024) - [i23]Eric Budish, Andrew Lewis-Pye, Tim Roughgarden:
The Economic Limits of Permissionless Consensus. CoRR abs/2405.09173 (2024) - 2023
- [i22]Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. CoRR abs/2301.09881 (2023) - [i21]Andrew Lewis-Pye, Tim Roughgarden:
Permissionless Consensus. CoRR abs/2304.14701 (2023) - [i20]Andrew Lewis-Pye, Oded Naor, Ehud Shapiro:
Flash: An Asynchronous Payment System with Good-Case Linear Communication Complexity. CoRR abs/2305.03567 (2023) - [i19]Andrew Lewis-Pye, Oded Naor, Ehud Shapiro:
Grassroots Flash: A Payment System for Grassroots Cryptocurrencies. CoRR abs/2309.13191 (2023) - [i18]Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor, Kartik Nayak:
Lumiere: Making Optimal BFT for Partial Synchrony Practical. CoRR abs/2311.08091 (2023) - 2022
- [i17]Andrew Lewis-Pye:
Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. CoRR abs/2201.01107 (2022) - 2021
- [i16]Andrew Lewis-Pye:
Byzantine Generals in the Permissionless Setting. CoRR abs/2101.07095 (2021) - [i15]Andrew Lewis-Pye, Tim Roughgarden:
How Does Blockchain Security Dictate Blockchain Implementation? CoRR abs/2109.04848 (2021) - 2020
- [i14]Andrew Lewis-Pye, Tim Roughgarden:
Resource Pools and the CAP Theorem. CoRR abs/2006.10698 (2020) - 2018
- [i13]George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden:
The idemetric property: when most distances are (almost) the same. CoRR abs/1804.11187 (2018) - [i12]George Barmpalias, Nan Fang, Andrew Lewis-Pye:
Monotonous betting strategies in warped casinos. CoRR abs/1807.04635 (2018) - 2017
- [i11]George Barmpalias, Andrew Lewis-Pye:
Compression of data streams down to their information content. CoRR abs/1710.02092 (2017) - 2016
- [i10]George Barmpalias, Andrew Lewis-Pye, Nan Fang:
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. CoRR abs/1602.03208 (2016) - [i9]George Barmpalias, Andrew Lewis-Pye:
Computing halting probabilities from other halting probabilities. CoRR abs/1602.06395 (2016) - [i8]George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR abs/1602.07113 (2016) - [i7]George Barmpalias, Andrew Lewis-Pye:
Differences of halting probabilities. CoRR abs/1604.00216 (2016) - [i6]George Barmpalias, Andrew Lewis-Pye:
Optimal redundancy in computations from random oracles. CoRR abs/1606.07910 (2016) - [i5]George Barmpalias, Andrew Lewis-Pye, Angsheng Li:
Pointed computations and Martin-Löf randomness. CoRR abs/1608.02081 (2016) - 2015
- [i4]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
From randomness to order: unperturbed Schelling segregation in two or three dimensions. CoRR abs/1504.03809 (2015) - [i3]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
Minority population in the one-dimensional Schelling model of segregation. CoRR abs/1508.02497 (2015) - 2013
- [i2]Andy Lewis-Pye, George Barmpalias, Richard Elwes:
Digital morphogenesis via Schelling segregation. CoRR abs/1302.4014 (2013) - [i1]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
Tipping Points in Schelling Segregation. CoRR abs/1311.5934 (2013)
Coauthor Index
aka: Tim Roughgarden
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 2025-06-27 19:33 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:
