|
 | Up a level |
Lewis-Pye, Andrew, Malkhi, Dahlia, Naor, Oded and Nayak, Kartik (2024) Lumiere: making optimal BFT for partial synchrony practica. In: PODC 2024 - Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. ACM Press, 135 - 144. ISBN 9798400706684
Budish, Eric, Lewis-Pye, Andrew and Roughgarden, Tim (2024) The economic limits of permissionless consensus. ACM Transactions on Economics and Computation. ISSN 2167-8375 (In Press)
Lewis-Pye, Andrew and Abraham, Ittai (2024) Fever: optimal responsive view synchronisation. In: Bessani, Alysson, Défago, Xavier, Nakamura, Junya, Wada, Koichi and Yamauchi, Yukiko, (eds.) Proceedings of the 27th International Conference on Principles of Distributed Systems (OPODIS 2023). Leibniz International Proceedings in Informatics (LIPIcs). ACM Press. ISBN 9783959773089
Lewis-Pye, Andrew and Roughgarden, Tim (2023) Byzantine generals in the permissionless setting. In: Baldimtsi, Foteini and Cachin, Christian, (eds.) Financial Cryptography and Data Security: 27th International Conference, FC 2023, Bol, Brač, Croatia, May 1–5, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science. Springer-Verlag, Berlin, DE, 21 - 37. ISBN 9783031477539
Lewis-Pye, Andrew (2022) Cryptocurrencies: protocols for consensus. In: Pitici, Mircea, (ed.) The Best Writing on Mathematics 2021. The Best Writing on Mathematics. Princeton University Press, pp. 9-28. ISBN 9780691225708
Lewis-Pye, Andrew and Roughgarden, Tim (2021) How does blockchain security dictate blockchain implementation? In: CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security. ACM Press, USA, 1006 - 1019. ISBN 9781450384544
Lewis-Pye, Andrew (2020) Cryptocurrencies: protocols for consensus. Notices of the American Mathematical Society, 67 (9). 1307 - 1315.
Barmapalias, George, Fang, Nan and Lewis-Pye, Andrew (2020) Monotonous betting strategies in warped casinos. Information and Computation, 271. ISSN 0890-5401
Barmpalias, George and Lewis-Pye, Andrew (2019) Compression of data streams down to their information content. IEEE Transactions on Information Theory, 65 (7). pp. 4471-4485. ISSN 0018-9448
Barmpalias, George, Huang, Neng, Lewis-Pye, Andrew, Li, Angsheng, Li, Xuechen, Pan, Yicheng and Roughgarden, Tim (2019) The idemetric property: when most distances are (almost) the same. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 475 (2222). ISSN 1364-5021
Barmpalias, George, Lewis-Pye, Andrew and Li, Angsheng (2018) Pointed computations and Martin-Löf randomnesss. Computability, 7 (2-3). pp. 171-177. ISSN 2211-3568
Lewis-Pye, Andrew (2018) The search for natural definability in the Turing degrees. Computability, 7 (2-3). pp. 189-235. ISSN 2211-3568
Cooper, Barry, Lewis-Pye, Andrew, Li, Angsheng, Pan, Yicheng and Yong, Xi (2018) Establishing social cooperation: the role of hubs and community structure. Network Science, 6 (2). pp. 251-264. ISSN 2050-1242
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2018) Digital morphogenesis via Schelling segregation. Nonlinearity, 31 (4). 1593 - 1638. ISSN 0951-7715
Barmpalias, George and Lewis-Pye, Andrew (2017) Differences of halting probabilities. Journal of Computer and System Sciences, 89. pp. 349-360. ISSN 0022-0000
Barmpalias, George and Lewis-Pye, Andrew (2017) Optimal redundancy in computations from random oracles. Journal of Computer and System Sciences. ISSN 0022-0000
Lewis-Pye, Andrew and Montalbán, Antonio (2017) Sex versus asex: an analysis of the role of variance conversion. Theoretical Population Biology, 114. pp. 128-135. ISSN 0040-5809
Barmpalias, George and Lewis-Pye, Andrew (2017) Limits of the Kucera-Gacs coding method. In: Post-proceedings volume of SEALS 2016 (South Eastern Logic Symposium). World Scientific (Firm).
Barmpalias, George and Lewis-Pye, Andrew (2017) Computing halting probabilities from other halting probabilities. Theoretical Computer Science, 660. pp. 16-22. ISSN 0304-3975
Barmpalias, George and Lewis-Pye, Andrew (2017) A note on the differences of computably enumerable reals. In: Day, Adam, Fellows, Michael, Greenberg, Noam, Khoussainov, Bakhadyr, Melnikov, Alexander and Rosamond, Frances, (eds.) Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science. Springer International (Firm), Cham, Switzerland, pp. 623-632. ISBN 9783319500614
Barmpalias, George, Fang, Nan and Lewis-Pye, Andrew (2016) Optimal asymptotic bounds on the oracle use in computations from Chaitin’s Omega. Journal of Computer and System Sciences, 82 (8). pp. 1283-1299. ISSN 0022-0000
Barmpalias, George, Lewis-Pye, Andrew and Teutsch, Jason (2016) Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Information and Computation, 251. pp. 287-300. ISSN 0890-5401
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2016) Unperturbed Schelling segregation in two or three dimensions. Journal of Statistical Physics, 164 (6). pp. 1460-1487. ISSN 0022-4715
Durrant, Benedict, Lewis-Pye, Andrew, Meng Ng, Keng and Riley, James (2016) Computably enumerable Turing degrees and the meet property. Proceedings of the American Mathematical Society, 144 (4). 1735 - 1744. ISSN 0002-9939
Lewis-Pye, Andrew (2016) 5 minutes with Maura Paterson. Maths at LSE (03 Feb 2016). Website.
Lewis-Pye, Andrew (2015) 5 minutes with Frank Wilczek. Maths at LSE (03 Aug 2015). Website.
Lewis-Pye, Andrew (2015) 5 minutes with Andre Nies. Maths at LSE (19 Jun 2015). Website.
Lewis-Pye, Andrew (2015) 5 minutes with Yannai A. Gonczarowski. Maths at LSE (18 Jun 2015). Website.
Lewis-Pye, Andrew (2015) Andy Lewis-Pye: the strange patterns of segregation. Maths at LSE (18 Jun 2015). Website.
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2015) Tipping points in 1-dimensional Schelling models with switching agents. Journal of Statistical Physics, 158 (4). pp. 806-852. ISSN 0022-4715
Downey, Rodney G., Kach, Asher M., Lempp, Steffen, Lewis-Pye, Andrew, Montalbán, Antonio and Turetsky, Daniel D. (2015) The complexity of computable categoricity. Advances in Mathematics, 268. pp. 423-466. ISSN 0001-8708
Barmpalias, George and Lewis-Pye, Andrew (2015) The information content of typical reals. In: Sommaruga, Giovanni and Strahm, Thomas, (eds.) Turing’s revolution: the impact of his ideas about computability. Springer Berlin / Heidelberg, pp. 207-224. ISBN 9783319221557
Barmpalias, George, Day, Adam R. and Lewis-Pye, Andrew (2014) The typical Turing degree. Proceedings of the London Mathematical Society, 109 (1). pp. 1-39. ISSN 0024-6115
Lewis-Pye, Andrew (2014) Schelling segregation. In: LSE Research Festival 2014, 2014-05-08, London, United Kingdom, GBR. (Submitted)
Jockush, Carl G. and Lewis-Pye, Andrew (2014) Diagonally non-computable functions and bi-immunity. Journal of Symbolic Logic, 78 (3). pp. 977-988. ISSN 0022-4812
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2014) Digital morphogenesis via Schelling segregation. Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium. pp. 156-165. ISSN 0272-5428
Barmpalias, G., Hölzl, R., Lewis-Pye, Andrew and Merkle, W. (2013) Analogues of Chaitinʼs Omega in the computably enumerable sets. Information Processing Letters, 113 (5-6). pp. 171-178. ISSN 0020-0190
Downey, Rod, Greenberg, Noam, Lewis-Pye, Andrew and Montalbán, Antonio (2013) On the degree spectrum of a π01 class. Transactions of the American Mathematical Society, 365 (06). pp. 2977-3018. ISSN 0002-9947
Kent, Thomas F., Lewis-Pye, Andrew and Sorbi, Andrea (2012) Empty intervals in the enumeration degrees. Annals of Pure and Applied Logic, 163 (5). pp. 567-574. ISSN 0168-0072
Barmpalias, George and Lewis-Pye, Andrew (2012) Measure and cupping in the Turing degrees. Proceedings of the American Mathematical Society, 140 (10). pp. 3607-3622. ISSN 0002-9939
Lewis-Pye, Andrew (2012) Properties of the jump classes. Journal of Logic and Computation, 22 (4). pp. 845-855. ISSN 0955-792X
Lewis-Pye, Andrew (2012) A note on the join property. Proceedings of the American Mathematical Society, 140 (2). pp. 707-714. ISSN 0002-9939
Barmpalias, George and Lewis-Pye, Andrew (2011) Chaitin's halting probability and the compression of strings using oracles. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 467 (2134). pp. 2912-2926. ISSN 1364-5021
Lewis-Pye, Andrew, Shore, Richard A. and Sorbi, Andrea (2011) Topological aspects of the Medvedev lattice. Archive for Mathematical Logic, 50 (3-4). pp. 319-340. ISSN 0933-5846
Ellison, Philip and Lewis-Pye, Andrew (2010) Joining up to the generalized high degrees. Proceedings of the American Mathematical Society, 138 (8). pp. 2949-2960. ISSN 0002-9939
Kent, Thomas and Lewis-Pye, Andrew (2010) On the degree spectrum of a π01 class. Transactions of the American Mathematical Society, 362 (10). pp. 5283-5319. ISSN 0002-9947
Barmapalias, George, Lewis-Pye, Andrew and Meng Ng, Keng (2010) The importance of π⁰₁ classes in effective randomness. Journal of Symbolic Logic, 75 (1). pp. 387-400. ISSN 0022-4812
Lewis-Pye, Andrew (2009) Strong minimal covers and a question of Yates: the story so far. In: Cooper, Barry, Geuvers, Herman, Pillay, Anand and Väänänen, Jouko, (eds.) Logic Colloquium 2006. Lecture notes in logic (32). Cambridge University Press, Cambridge, UK, pp. 213-228. ISBN 9780521110815
Lewis-Pye, Andrew, Nies, André and Sorbi, Andrea (2009) The first order theories of the Medvedev and Muchnik lattices. In: Ambos-Spies, Klaus, Löwe, Benedikt and Merkle, Wolfgang, (eds.) Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, Cie 2009, Heidelberg, Germany, July 1. Lecture notes in computer science (5635). Springer Berlin / Heidelberg, Berlin, pp. 324-331. ISBN 9783642030727
Kumabe, Masahiro and Lewis-Pye, Andrew (2009) A fixed-point-free minimal degree. Journal of the London Mathematical Society, 80 (3). pp. 785-797. ISSN 0024-6107
Barmpalias, George, Lewis-Pye, Andrew and Stephan, Frank (2008) Π10 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, 156 (1). pp. 21-38. ISSN 0168-0072
Lewis-Pye, Andrew (2008) On a question of Slaman and Groszek. Proceedings of the American Mathematical Society, 136 (10). pp. 3663-3668. ISSN 0002-9939
Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2008) Randomness, lowness and degrees. Journal of Symbolic Logic, 73 (2). pp. 559-577. ISSN 0022-4812
Lewis-Pye, Andrew (2007) Π10 classes, strong minimal covers and hyperimmune-free degrees. Bulletin of the London Mathematical Society, 39 (6). pp. 845-855. ISSN 0024-6093
Lewis-Pye, Andrew and Barmpalias, George (2007) Randomness and the linear degrees of computability. Annals of Pure and Applied Logic, 145 (3). pp. 252-257. ISSN 0168-0072
Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2007) Working with the LR degrees. In: Cai, Jin-Yi, Cooper, S. Barry and Zhu, Hong, (eds.) Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007. Lecture notes in computer science (4484). Springer Berlin / Heidelberg, Berlin, pp. 89-99. ISBN 9783540725039
Lewis-Pye, Andrew (2007) A random degree with strong minimal cover. Bulletin of the London Mathematical Society, 39 (5). pp. 848-856. ISSN 0024-6093
Lewis-Pye, Andrew (2007) A single minimal complement for the c.e. degrees. Transactions of the American Mathematical Society, 359 (12). pp. 5817-5865. ISSN 0002-9947
Lewis-Pye, Andrew, Montalbán, Antonio and Nies, André (2007) A weakly 2-random set that is not generalized low. In: Cooper, S. Barry, Löwe, Benedikt and Sorbi, Andrea, (eds.) Computation and Logic in the Real World: Third Conference on Computability in Europe, Cie 2007, Siena, Italy, June 18-23, 2007. Lecture notes in computer science (4497). Springer Berlin / Heidelberg, Berlin, pp. 474-477. ISBN 9783540730002
Lewis-Pye, Andrew and Barmpalias, George (2006) Random reals and Lipschitz continuity. Mathematical Structures in Computer Science, 16 (5). pp. 737-749. ISSN 0960-1295
Barmpalias, George and Lewis-Pye, Andrew (2006) A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47 (2). pp. 197-209. ISSN 0029-4527
Barmpalias, George and Lewis-Pye, Andrew (2006) The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Notre Dame Journal of Formal Logic, 47 (3). pp. 361-370. ISSN 0029-4527
Barmpalias, George and Lewis-Pye, Andrew (2006) The ibT degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic, 141 (1-2). pp. 51-60. ISSN 0168-0072
Lewis-Pye, Andrew (2006) The jump classes of minimal covers. In: Beckmann, Arnold, Berger, Ulrich, Löwe, Benedikt and Tucker, John V., (eds.) Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, Cie 2006, Swansea, Uk, June 30-July. Lecture notes in computer science (3988). Springer Berlin / Heidelberg, Berlin, pp. 307-318. ISBN 9783540354666
Lewis-Pye, Andrew (2005) On a question of sacks: a partial solution on the positive side. In: Cooper, S. Barry, Löwe, Benedikt and Torenvliet, Leen, (eds.) New Computational Paradigms: First Conference on Computability in Europe, Cie 2005, Amsterdam, the Netherlands, June 8-12, 2005. Lecture notes in computer science (3526). Springer Berlin / Heidelberg, Berlin, pp. 275-286. ISBN 9783540261797
Cooper, S. Barry, Lewis-Pye, Andrew and Yang, Yue (2005) Properly Σ2 minimal degrees and 0″ complementation. Mathematical Logic Quarterly, 51 (3). pp. 274-276. ISSN 0942-5616
Lewis-Pye, Andrew (2005) The minimal complementation property above 0′. Mathematical Logic Quarterly, 51 (5). pp. 470-492. ISSN 0942-5616
Lewis-Pye, Andrew (2004) Finite cupping sets. Archive for Mathematical Logic, 43 (7). pp. 845-858. ISSN 0933-5846
Lewis-Pye, Andrew (2004) Minimal complements for degrees below 0'. Journal of Symbolic Logic, 69 (4). pp. 937-966. ISSN 0022-4812
