 | 2012 |
| 22 |  | Bjørn Kjos-Hanssen,
Antoine Taveneaux,
Neil Thapen:
How Much Randomness Is Needed for Statistics?
CiE 2012: 395-404 |
| 21 |  | David Diamondstone,
Bjørn Kjos-Hanssen:
Martin-Löf randomness and Galton-Watson processes.
Ann. Pure Appl. Logic 163(5): 519-529 (2012) |
| 2010 |
| 20 |  | Bjørn Kjos-Hanssen,
Jan Reimann:
The Strength of the Besicovitch-Davies Theorem.
CiE 2010: 229-238 |
| 19 |  | Bjørn Kjos-Hanssen,
André Nies,
Frank Stephan,
Liang Yu:
Higher Kurtz randomness.
Ann. Pure Appl. Logic 161(10): 1280-1290 (2010) |
| 18 |  | Bjørn Kjos-Hanssen:
Recovering randomness from an asymptotic Hamming distance
CoRR abs/1008.0821: (2010) |
| 17 |  | Bjørn Kjos-Hanssen,
Frank Stephan,
Jason Teutsch:
Enumerating randoms
CoRR abs/1008.4825: (2010) |
| 16 |  | Bjørn Kjos-Hanssen:
A strong law of computationally weak subsets.
Electronic Colloquium on Computational Complexity (ECCC) 17: 150 (2010) |
| 15 |  | Bjørn Kjos-Hanssen,
Richard A. Shore:
Lattice initial segments of the hyperdegrees.
J. Symb. Log. 75(1): 103-130 (2010) |
| 2009 |
| 14 |  | David Diamondstone,
Bjørn Kjos-Hanssen:
Members of Random Closed Sets.
CiE 2009: 144-153 |
| 13 |  | Paul Brodhead,
Bjørn Kjos-Hanssen:
Numberings and Randomness.
CiE 2009: 49-58 |
| 12 |  | Paul Brodhead,
Bjørn Kjos-Hanssen:
The Strength of the Grätzer-Schmidt Theorem.
CiE 2009: 59-67 |
| 11 |  | Bjørn Kjos-Hanssen,
Alberto J. Evangelista:
Google distance between words
CoRR abs/0901.4180: (2009) |
| 10 |  | Stephen Binns,
Bjørn Kjos-Hanssen:
Finding paths through narrow and wide trees.
J. Symb. Log. 74(1): 349-360 (2009) |
| 9 |  | Bjørn Kjos-Hanssen,
André Nies:
Superhighness.
Notre Dame Journal of Formal Logic 50(4): 445-452 (2009) |
| 8 |  | Bjørn Kjos-Hanssen,
Anil Nerode:
Effective dimension of points visited by Brownian motion.
Theor. Comput. Sci. 410(4-5): 347-354 (2009) |
| 2008 |
| 7 |  | Stephen Binns,
Bjørn Kjos-Hanssen,
Manuel Lerman,
James H. Schmerl,
Reed Solomon:
Self-Embeddings of Computable Trees.
Notre Dame Journal of Formal Logic 49(1): 1-37 (2008) |
| 2007 |
| 6 |  | Bjørn Kjos-Hanssen,
Anil Nerode:
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion.
LFCS 2007: 310-317 |
| 2006 |
| 5 |  | Bjørn Kjos-Hanssen,
Wolfgang Merkle,
Frank Stephan:
Kolmogorov Complexity and the Recursion Theorem.
STACS 2006: 149-161 |
| 4 |  | Stephen Binns,
Bjørn Kjos-Hanssen,
Manuel Lerman,
Reed Solomon:
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination.
J. Symb. Log. 71(1): 119-136 (2006) |
| 2005 |
| 3 |  | Bjørn Kjos-Hanssen,
André Nies,
Frank Stephan:
Lowness for the Class of Schnorr Random Reals.
SIAM J. Comput. 35(3): 647-657 (2005) |
| 2004 |
| 2 |  | Klaus Ambos-Spies,
Bjørn Kjos-Hanssen,
Steffen Lempp,
Theodore A. Slaman:
Comparing DNR and WWKL.
J. Symb. Log. 69(4): 1089-1104 (2004) |
| 2003 |
| 1 |  | Bjørn Kjos-Hanssen:
Local initial segments of the Turing degrees.
Bulletin of Symbolic Logic 9(1): 26-36 (2003) |