| The ibT degrees of computably enumerable sets are not dense G Barmpalias, AEM Lewis Annals of Pure and Applied Logic 141 (1-2), 51-60, 2006 | 48* | 2006 |
| Algorithmic randomness of closed sets G Barmpalias, P Brodhead, D Cenzer, S Dashti, R Weber Journal of Logic and Computation 17 (6), 1041-1062, 2007 | 46 | 2007 |
| Digital morphogenesis via Schelling segregation G Barmpalias, R Elwes, A Lewis-Pye 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 156-165, 2014 | 44* | 2014 |
| Working with strong reducibilities above totally 𝜔-ce and array computable degrees G Barmpalias, R Downey, N Greenberg Transactions of the American Mathematical Society 362 (2), 777-813, 2010 | 33 | 2010 |
| Randomness, lowness and degrees G Barmpalias, AEM Lewis, M Soskova The Journal of Symbolic Logic 73 (2), 559-577, 2008 | 32 | 2008 |
| Randomness notions and partial relativization G Barmpalias, JS Miller, A Nies Israel Journal of Mathematics 191 (2), 791-816, 2012 | 31 | 2012 |
| Computably enumerable sets in the Solovay and the strong weak truth table degrees G Barmpalias New Computational Paradigms: First Conference on Computability in Europe …, 2005 | 29 | 2005 |
| Unperturbed Schelling segregation in two or three dimensions G Barmpalias, R Elwes, A Lewis-Pye Journal of Statistical Physics 164, 1460-1487, 2016 | 28 | 2016 |
| The importance of Π10 classes in effective randomness G Barmpalias, AEM Lewis, KM Ng The Journal of Symbolic Logic 75 (1), 387-400, 2010 | 27 | 2010 |
| A ce real that cannot be sw-computed by any Ω number G Barmpalias, AEM Lewis Notre Dame Journal of Formal Logic 47 (2), 197-209, 2006 | 24 | 2006 |
| Tipping points in 1-dimensional Schelling models with switching agents G Barmpalias, R Elwes, A Lewis-Pye Journal of Statistical Physics 158, 806-852, 2015 | 22 | 2015 |
| Algorithmic randomness of continuous functions G Barmpalias, P Brodhead, D Cenzer, JB Remmel, R Weber Archive for Mathematical Logic 46 (7-8), 533-546, 2008 | 21 | 2008 |
| Random reals and Lipschitz continuity AEM Lewis, G Barmpalias Mathematical Structures in Computer Science 16 (5), 737-749, 2006 | 21 | 2006 |
| Kolmogorov complexity of initial segments of sequences and arithmetical definability G Barmpalias, CS Vlek Theoretical Computer Science 412 (41), 5656-5667, 2011 | 18 | 2011 |
| Randomness and the linear degrees of computability AEM Lewis, G Barmpalias Annals of Pure and Applied Logic 145 (3), 252-257, 2007 | 17 | 2007 |
| Minority population in the one-dimensional Schelling model of segregation G Barmpalias, R Elwes, A Lewis-Pye Journal of Statistical Physics 173, 1408-1458, 2018 | 16 | 2018 |
| Elementary differences between the degrees of unsolvability and degrees of compressibility G Barmpalias Annals of Pure and Applied Logic 161 (7), 923-934, 2010 | 15 | 2010 |
| 𝐾-trivial degrees and the jump-traceability hierarchy G Barmpalias, R Downey, N Greenberg Proceedings of the American Mathematical Society 137 (6), 2099-2109, 2009 | 15 | 2009 |
| Chaitin's halting probability and the compression of strings using oracles G Barmpalias, AEM Lewis Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2011 | 14 | 2011 |
| Relative randomness and cardinality G Barmpalias | 14 | 2010 |
Richard ElwesUniversity of LeedsVerified email at leeds.ac.uk
