|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 5 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | David Diamondstone, Bjørn Kjos-Hanssen |
Martin-Löf randomness and Galton-Watson processes.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen |
A strong law of computationally weak subsets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Richard A. Shore |
Lattice initial segments of the hyperdegrees. |
J. Symb. Log. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu |
Higher Kurtz randomness. |
Ann. Pure Appl. Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch |
Enumerating randoms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen |
Recovering randomness from an asymptotic Hamming distance |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Jan Reimann |
The Strength of the Besicovitch-Davies Theorem. |
CiE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Anil Nerode |
Effective dimension of points visited by Brownian motion. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies |
Superhighness. |
Notre Dame Journal of Formal Logic |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stephen Binns, Bjørn Kjos-Hanssen |
Finding paths through narrow and wide trees. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Alberto J. Evangelista |
Google distance between words |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Diamondstone, Bjørn Kjos-Hanssen |
Members of Random Closed Sets. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
random closed sets, computability theory |
| 1 | Paul Brodhead, Bjørn Kjos-Hanssen |
The Strength of the Grätzer-Schmidt Theorem. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
computability theory, lattice theory |
| 1 | Paul Brodhead, Bjørn Kjos-Hanssen |
Numberings and Randomness. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon |
Self-Embeddings of Computable Trees. |
Notre Dame Journal of Formal Logic |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Anil Nerode |
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
law of the iterated logarithm, randomness, Kolmogorov complexity, Brownian motion |
| 1 | Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon |
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. |
J. Symb. Log. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan |
Kolmogorov Complexity and the Recursion Theorem. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies, Frank Stephan |
Lowness for the Class of Schnorr Random Reals. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman |
Comparing DNR and WWKL. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen |
Local initial segments of the Turing degrees. |
Bulletin of Symbolic Logic |
2003 |
DBLP BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")