| Kolmogorov complexity and the recursion theorem B Kjos-Hanssen, W Merkle, F Stephan Transactions of the American Mathematical Society 363 (10), 5465-5480, 2011 | 153* | 2011 |
| Comparing DNR and WWKL K Ambos-Spies, B Kjos-Hanssen, S Lempp, TA Slaman Journal of Symbolic Logic, 1089-1104, 2004 | 76 | 2004 |
| Lowness notions, measure and domination B Kjos-Hanssen, JS Miller, R Solomon Journal of the London Mathematical Society 85 (3), 869-888, 2012 | 75 | 2012 |
| Lowness for the class of Schnorr random reals B Kjos-Hanssen, A Nies, F Stephan SIAM Journal on Computing 35 (3), 647-657, 2005 | 71 | 2005 |
| The strength of some combinatorial principles related to Ramsey's theorem for pairs DR Hirschfeldt, CG Jockusch Jr, B Kjos-Hanssen, S Lempp, TA Slaman Computational Prospects Of Infinity: Part II: Presented Talks, 143-161, 2008 | 62 | 2008 |
| Infinite subsets of random sets of integers B Kjos-Hanssen Mathematical Research Letters 16 (1), 103-110, 2009 | 53 | 2009 |
| Low for random reals and positive-measure domination B Kjos-Hanssen Proceedings of the American Mathematical Society, 3703-3709, 2007 | 53 | 2007 |
| Algorithmic aspects of Lipschitz functions C Freer, B Kjos-Hanssen, A Nies, F Stephan Computability 3 (1), 45-61, 2014 | 41* | 2014 |
| Nondeterministic automatic complexity of overlap-free and almost square-free words K Hyde, B Kjos-Hanssen arXiv preprint arXiv:1402.3856, 2014 | 36* | 2014 |
| Martin-Löf randomness and Galton–Watson processes D Diamondstone, B Kjos-Hanssen Annals of Pure and Applied Logic 163 (5), 519-529, 2012 | 34* | 2012 |
| On a conjecture of Dobrinen and Simpson concerning almost everywhere domination S Binns, B Kjos-Hanssen, M Lerman, R Solomon The Journal of Symbolic Logic 71 (1), 119-136, 2006 | 33 | 2006 |
| The probability distribution as a computational resource for randomness testing B Kjos-Hanssen arXiv preprint arXiv:1408.2850, 2014 | 32 | 2014 |
| Effective dimension of points visited by Brownian motion B Kjos-Hanssen, A Nerode Theoretical Computer Science 410 (4-5), 347-354, 2009 | 30 | 2009 |
| Google distance between words B Kjos-Hanssen, AJ Evangelista arXiv preprint arXiv:0901.4180, 2009 | 26* | 2009 |
| Higher Kurtz randomness B Kjos-Hanssen, A Nies, F Stephan, L Yu Annals of Pure and Applied Logic 161 (10), 1280-1290, 2010 | 19 | 2010 |
| The law of the iterated logarithm for algorithmically random Brownian motion B Kjos-Hanssen, A Nerode International Symposium on Logical Foundations of Computer Science, 310-317, 2007 | 19 | 2007 |
| Kolmogorov complexity and strong approximation of Brownian motion B Kjos-Hanssen, T Szabados Proceedings of the American Mathematical Society 139 (9), 3307-3316, 2011 | 17 | 2011 |
| Numberings and randomness P Brodhead, B Kjos-Hanssen Conference on Computability in Europe, 49-58, 2009 | 14 | 2009 |
| The number of languages with maximum state complexity B Kjos-Hanssen, L Liu International Conference on Theory and Applications of Models of Computation …, 2019 | 10 | 2019 |
| Automatic complexity of shift register sequences B Kjos-Hanssen Discrete Mathematics 341 (9), 2409-2417, 2018 | 10* | 2018 |
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer ScienceVerified email at comp.nus.edu.sg
