Andy Lewis-Pye

Orcid: 0000-0003-0228-2243

According to our database1, Andy Lewis-Pye authored at least 29 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Lumiere: Making Optimal BFT for Partial Synchrony Practical.
CoRR, 2023

Grassroots Flash: A Payment System for Grassroots Cryptocurrencies.
CoRR, 2023

Flash: An Asynchronous Payment System with Good-Case Linear Communication Complexity.
CoRR, 2023

Permissionless Consensus.
CoRR, 2023

Fever: Optimal Responsive View Synchronisation.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Byzantine Generals in the Permissionless Setting.
Proceedings of the Financial Cryptography and Data Security, 2023

2022
Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model.
CoRR, 2022

2021
Byzantine Generals in the Permissionless Setting.
CoRR, 2021

How Does Blockchain Security Dictate Blockchain Implementation?
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Monotonous betting strategies in warped casinos.
Inf. Comput., 2020

Resource Pools and the CAP Theorem.
CoRR, 2020

2019
Compression of Data Streams Down to Their Information Content.
IEEE Trans. Inf. Theory, 2019

2018
Establishing social cooperation: The role of hubs and community structure.
Netw. Sci., 2018

Optimal redundancy in computations from random oracles.
J. Comput. Syst. Sci., 2018

The idemetric property: when most distances are (almost) the same.
CoRR, 2018

The search for natural definability in the Turing degrees.
Comput., 2018

S. Barry Cooper (1943-2015).
Comput., 2018

Pointed computations and Martin-Löf randomness.
Comput., 2018

2017
Computing halting probabilities from other halting probabilities.
Theor. Comput. Sci., 2017

Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015).
Theory Comput. Syst., 2017

Differences of halting probabilities.
J. Comput. Syst. Sci., 2017

A Note on the Differences of Computably Enumerable Reals.
Proceedings of the Computability and Complexity, 2017

2016
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega.
J. Comput. Syst. Sci., 2016

Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers.
Inf. Comput., 2016

In Memoriam: Barry Cooper 1943-2015.
Bull. Symb. Log., 2016

2015
Minority population in the one-dimensional Schelling model of segregation.
CoRR, 2015

From randomness to order: unperturbed Schelling segregation in two or three dimensions.
CoRR, 2015

2014
Digital Morphogenesis via Schelling Segregation.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Tipping Points in Schelling Segregation.
CoRR, 2013


  Loading...