Local initial segments of the Turing degrees. - Bjørn Kjos-Hanssen (Bull. Symb. Log., 2003)

Comparing DNR and WWKL. - Klaus Ambos-Spies; Bjørn Kjos-Hanssen; Steffen Lempp; Theodore A. Slaman (J. Symb. Log., 2004)

Lowness for the Class of Schnorr Random Reals. - Bjørn Kjos-Hanssen; André Nies; Frank Stephan 001 (SIAM J. Comput., 2005)

Kolmogorov Complexity and the Recursion Theorem. - Bjørn Kjos-Hanssen; Wolfgang Merkle; Frank Stephan 001 (STACS, 2006)

On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; Reed Solomon (J. Symb. Log., 2006)

The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. - Bjørn Kjos-Hanssen; Anil Nerode (LFCS, 2007)

Self-Embeddings of Computable Trees. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; James H. Schmerl; Reed Solomon (Notre Dame J. Formal Log., 2008)

Numberings and Randomness. - Paul Brodhead 001; Bjørn Kjos-Hanssen (CiE, 2009)

The Strength of the Grätzer-Schmidt Theorem. - Paul Brodhead 001; Bjørn Kjos-Hanssen (CiE, 2009)

Members of Random Closed Sets. - David Diamondstone; Bjørn Kjos-Hanssen (CiE, 2009)

Google distance between words - Bjørn Kjos-Hanssen; Alberto J. Evangelista (CoRR, 2009)

Finding paths through narrow and wide trees. - Stephen Binns; Bjørn Kjos-Hanssen (J. Symb. Log., 2009)

Superhighness. - Bjørn Kjos-Hanssen; André Nies (Notre Dame J. Formal Log., 2009)

Effective dimension of points visited by Brownian motion. - Bjørn Kjos-Hanssen; Anil Nerode (Theor. Comput. Sci., 2009)

The Strength of the Besicovitch-Davies Theorem. - Bjørn Kjos-Hanssen; Jan Reimann 001 (CiE, 2010)

Higher Kurtz randomness. - Bjørn Kjos-Hanssen; André Nies; Frank Stephan 001; Liang Yu 004 (Ann. Pure Appl. Log., 2010)

Enumerating randoms - Bjørn Kjos-Hanssen; Frank Stephan 001; Jason Teutsch (CoRR, 2010)

A strong law of computationally weak subsets. - Bjørn Kjos-Hanssen (Electron. Colloquium Comput. Complex., 2010)

The probability distribution as a computational resource for randomness testing. - Bjørn Kjos-Hanssen (J. Log. Anal., 2010)

Lattice initial segments of the hyperdegrees. - Bjørn Kjos-Hanssen; Richard A. Shore (J. Symb. Log., 2010)

Martin-Löf randomness and Galton-Watson processes. - David Diamondstone; Bjørn Kjos-Hanssen (Ann. Pure Appl. Log., 2012)

Lowness notions, measure and domination. - Bjørn Kjos-Hanssen; Joseph S. Miller; Reed Solomon (J. Lond. Math. Soc., 2012)

Arithmetic complexity via effective names for random sequences. - Bjørn Kjos-Hanssen; Frank Stephan 001; Jason Teutsch (ACM Trans. Comput. Log., 2012)

Recovering randomness from an asymptotic Hamming distance - Bjørn Kjos-Hanssen (Log. Methods Comput. Sci., 2013)

Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics. - Bjørn Kjos-Hanssen (COCOA, 2014)

Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words. - Kayleigh Hyde; Bjørn Kjos-Hanssen (COCOON, 2014)

How much randomness is needed for statistics? - Bjørn Kjos-Hanssen; Antoine Taveneaux; Neil Thapen (Ann. Pure Appl. Log., 2014)

Algorithmic Aspects of Lipschitz Functions. - Cameron E. Freer; Bjørn Kjos-Hanssen; André Nies; Frank Stephan 001 (Comput., 2014)

Algorithmic randomness for Doob's martingale convergence theorem in continuous time. - Bjørn Kjos-Hanssen; Paul Kim Long V. Nguyen; Jason M. Rute (Log. Methods Comput. Sci., 2014)

Pricing complexity options. - Malihe Alikhani; Bjørn Kjos-Hanssen; Amirarsalan Pakravan; Babak Saadat (Algorithmic Finance, 2015)

Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words. - Kayleigh Hyde; Bjørn Kjos-Hanssen (Electron. J. Comb., 2015)

Kolmogorov structure functions for automatic complexity. - Bjørn Kjos-Hanssen (Theor. Comput. Sci., 2015)

The strength of the Grätzer-Schmidt theorem. - Katie Brodhead; Mushfeq Khan; Bjørn Kjos-Hanssen; William A. Lampe; Paul Kim Long V. Nguyen; Richard A. Shore (Arch. Math. Log., 2016)

Models of the Chisholm set. - Bjørn Kjos-Hanssen (CoRR, 2016)

Effective Bi-immunity and Randomness. - Achilles A. Beros; Mushfeq Khan; Bjørn Kjos-Hanssen (Computability and Complexity, 2017)

A Rigid Cone in the Truth-Table Degrees with Jump. - Bjørn Kjos-Hanssen (Computability and Complexity, 2017)

Superposition as Memory: Unlocking Quantum Automatic Complexity. - Bjørn Kjos-Hanssen (UCNC, 2017)

Shift Registers Fool Finite Automata. - Bjørn Kjos-Hanssen (WoLLIC, 2017)

Covering the recursive sets. - Bjørn Kjos-Hanssen; Frank Stephan 001; Sebastiaan A. Terwijn (Ann. Pure Appl. Log., 2017)

On the Complexity of Automatic Complexity. - Bjørn Kjos-Hanssen (Theory Comput. Syst., 2017)

A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty Obligations. - Bjørn Kjos-Hanssen (Stud Logica, 2017)

From Eventually Different Functions to Pandemic Numberings. - Achilles A. Beros; Mushfeq Khan; Bjørn Kjos-Hanssen; André Nies (CiE, 2018)

Permutations of the Integers Induce only the Trivial automorphism of the Turing Degrees. - Bjørn Kjos-Hanssen (Bull. Symb. Log., 2018)

Automatic complexity of shift register sequences. - Bjørn Kjos-Hanssen (Discret. Math., 2018)

Preface. - Rod Downey; Denis R. Hirschfeldt; Bjørn Kjos-Hanssen (Theory Comput. Syst., 2018)

Planar Digraphs for Automatic Complexity. - Achilles A. Beros; Bjørn Kjos-Hanssen; Daylan Kaui Yogi (TAMC, 2019)

The Number of Languages with Maximum State Complexity. - Bjørn Kjos-Hanssen; Lei Liu (TAMC, 2019)

An Incompressibility Theorem for Automatic Complexity. - Bjørn Kjos-Hanssen (CoRR, 2019)

Few Paths, Fewer Words: Model Selection With Automatic Structure Functions. - Bjørn Kjos-Hanssen (Exp. Math., 2019)

On the Degrees of Constructively Immune Sets. - Samuel D. Birns; Bjørn Kjos-Hanssen (CiE, 2021)

KL-Randomness and Effective Dimension Under Strong Reducibility. - Bjørn Kjos-Hanssen; David J. Webb (CiE, 2021)

Automatic complexity of Fibonacci and Tribonacci words. - Bjørn Kjos-Hanssen (Discret. Appl. Math., 2021)

Strong Medvedev Reducibilities and the KL-Randomness Problem. - Bjørn Kjos-Hanssen; David J. Webb (CiE, 2022)

A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance. - Bjørn Kjos-Hanssen; Saroj Niraula; Soowhan Yoon (LFCS, 2022)

VC-dimensions of nondeterministic finite automata for words of equal length. - Bjørn Kjos-Hanssen; Clyde James Felix; Sun Young Kim; Ethan Lamb; Davin Takahashi (Ann. Math. Artif. Intell., 2022)

Maximal automatic complexity and context-free languages. - Bjørn Kjos-Hanssen (CoRR, 2022)

Interpolating between the Jaccard distance and an analogue of the normalized information distance. - Bjørn Kjos-Hanssen (J. Log. Comput., 2022)

Conditional Automatic Complexity and Its Metrics. - Bjørn Kjos-Hanssen (COCOON (1), 2023)

Index Set Complexity for Congruence Lattices of Lattices. - Bjørn Kjos-Hanssen; Paul Kim Long V. Nguyen (WoLLIC, 2025)