Bjørn Kjos-Hanssen

80 papers A 1C 15Misc 4Journal 54Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Unbounded length minimal synchronizing words for quantum channels over qutrits. CoRR Bjørn Kjos-Hanssen, Swarnalakshmi Lakshmanan
2025	C	`conf`	Index Set Complexity for Congruence Lattices of Lattices. WoLLIC Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen
2025	—	`conf`	Languages of Words of Low Automatic Complexity Are Hard to Compute. FSTTCS Joey Chen, Bjørn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan
2025	J	`jnl`	Languages of Words of Low Automatic Complexity Are Hard to Compute. CoRR Joey Chen, Bjørn Kjos-Hanssen, Ivan Koswara, Linus Richter, Frank Stephan
2023	—	`conf`	Conditional Automatic Complexity and Its Metrics. COCOON (1) Bjørn Kjos-Hanssen
2023	J	`jnl`	Conditional automatic complexity and its metrics. CoRR Bjørn Kjos-Hanssen
2022	Misc	`conf`	A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance. LFCS Bjørn Kjos-Hanssen, Saroj Niraula, Soowhan Yoon
2022	J	`jnl`	Interpolating between the Jaccard distance and an analogue of the normalized information distance. J. Log. Comput. Bjørn Kjos-Hanssen
2022	J	`jnl`	Maximal automatic complexity and context-free languages. CoRR Bjørn Kjos-Hanssen
2022	C	`conf`	Strong Medvedev Reducibilities and the KL-Randomness Problem. CiE Bjørn Kjos-Hanssen, David J. Webb
2022	J	`jnl`	VC-dimensions of nondeterministic finite automata for words of equal length. Ann. Math. Artif. Intell. Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
2021	J	`jnl`	Automatic complexity of Fibonacci and Tribonacci words. Discret. Appl. Math. Bjørn Kjos-Hanssen
2021	C	`conf`	KL-Randomness and Effective Dimension Under Strong Reducibility. CiE Bjørn Kjos-Hanssen, David J. Webb
2021	C	`conf`	On the Degrees of Constructively Immune Sets. CiE Samuel D. Birns, Bjørn Kjos-Hanssen
2020	J	`jnl`	A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations. CoRR Bjørn Kjos-Hanssen
2020	J	`jnl`	Automatic complexity of Fibonacci and Tribonacci words. CoRR Bjørn Kjos-Hanssen
2020	Misc	`conf`	VC-dimensions of nondeterministic finite automata for words of equal length. ISAIM Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
2020	J	`jnl`	VC-dimensions of nondeterministic finite automata for words of equal length. CoRR Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
2019	J	`jnl`	An Incompressibility Theorem for Automatic Complexity. CoRR Bjørn Kjos-Hanssen
2019	J	`jnl`	Few Paths, Fewer Words: Model Selection With Automatic Structure Functions. Exp. Math. Bjørn Kjos-Hanssen
2019	C	`conf`	Planar Digraphs for Automatic Complexity. TAMC Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
2019	J	`jnl`	Planar digraphs for automatic complexity. CoRR Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
2019	C	`conf`	The Number of Languages with Maximum State Complexity. TAMC Bjørn Kjos-Hanssen, Lei Liu
2019	J	`jnl`	The number of languages with maximum state complexity. CoRR Bjørn Kjos-Hanssen, Lei Liu
2018	J	`jnl`	Automatic complexity of shift register sequences. Discret. Math. Bjørn Kjos-Hanssen
2018	C	`conf`	From Eventually Different Functions to Pandemic Numberings. CiE Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies
2018	J	`jnl`	Permutations of the Integers Induce only the Trivial automorphism of the Turing Degrees. Bull. Symb. Log. Bjørn Kjos-Hanssen
2018	J	`jnl`	Preface. Theory Comput. Syst. Rod Downey, Denis R. Hirschfeldt, Bjørn Kjos-Hanssen
2017	J	`jnl`	A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty Obligations. Stud Logica Bjørn Kjos-Hanssen
2017	—	`conf`	A Rigid Cone in the Truth-Table Degrees with Jump. Computability and Complexity Bjørn Kjos-Hanssen
2017	J	`jnl`	Covering the recursive sets. Ann. Pure Appl. Log. Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
2017	—	`conf`	Effective Bi-immunity and Randomness. Computability and Complexity Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen
2017	J	`jnl`	On the Complexity of Automatic Complexity. Theory Comput. Syst. Bjørn Kjos-Hanssen
2017	—	`conf`	Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. Computability and Complexity Bjørn Kjos-Hanssen
2017	C	`conf`	Shift Registers Fool Finite Automata. WoLLIC Bjørn Kjos-Hanssen
2017	—	`conf`	Superposition as Memory: Unlocking Quantum Automatic Complexity. UCNC Bjørn Kjos-Hanssen
2017	J	`jnl`	Superposition as memory: unlocking quantum automatic complexity. CoRR Bjørn Kjos-Hanssen
2016	J	`jnl`	Few paths, fewer words: model selection with automatic structure functions. CoRR Bjørn Kjos-Hanssen
2016	J	`jnl`	Models of the Chisholm set. CoRR Bjørn Kjos-Hanssen
2016	J	`jnl`	Shift registers fool finite automata. CoRR Bjørn Kjos-Hanssen
2016	J	`jnl`	The complexity of automatic complexity. CoRR Bjørn Kjos-Hanssen
2016	J	`jnl`	The strength of the Grätzer-Schmidt theorem. Arch. Math. Log. Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen, Richard A. Shore
2015	C	`conf`	Covering the Recursive Sets. CiE Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
2015	J	`jnl`	Kolmogorov structure functions for automatic complexity. Theor. Comput. Sci. Bjørn Kjos-Hanssen
2015	J	`jnl`	Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words. Electron. J. Comb. Kayleigh Hyde, Bjørn Kjos-Hanssen
2015	J	`jnl`	Pricing complexity options. Algorithmic Finance Malihe Alikhani, Bjørn Kjos-Hanssen, Amirarsalan Pakravan, Babak Saadat
2015	J	`jnl`	Pricing complexity options. CoRR Malihe Alikhani, Bjørn Kjos-Hanssen, Amirarsalan Pakravan, Babak Saadat
2014	J	`jnl`	Algorithmic Aspects of Lipschitz Functions. Comput. Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies, Frank Stephan
2014	J	`jnl`	Algorithmic randomness for Doob's martingale convergence theorem in continuous time. Log. Methods Comput. Sci. Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen, Jason M. Rute
2014	J	`jnl`	How much randomness is needed for statistics? Ann. Pure Appl. Log. Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
2014	C	`conf`	Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics. COCOA Bjørn Kjos-Hanssen
2014	J	`jnl`	Kolmogorov structure functions for automatic complexity in computational statistics. CoRR Bjørn Kjos-Hanssen
2014	Misc	`conf`	Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words. COCOON Kayleigh Hyde, Bjørn Kjos-Hanssen
2014	J	`jnl`	Nondeterministic automatic complexity of almost square-free and strongly cube-free words. CoRR Kayleigh Hyde, Bjørn Kjos-Hanssen
2013	J	`jnl`	Recovering randomness from an asymptotic Hamming distance Log. Methods Comput. Sci. Bjørn Kjos-Hanssen
2012	J	`jnl`	Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch
2012	C	`conf`	How Much Randomness Is Needed for Statistics? CiE Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
2012	J	`jnl`	Lowness notions, measure and domination. J. Lond. Math. Soc. Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon
2012	J	`jnl`	Martin-Löf randomness and Galton-Watson processes. Ann. Pure Appl. Log. David Diamondstone, Bjørn Kjos-Hanssen
2011	J	`jnl`	A Strong Law of computationally Weak Subsets. J. Math. Log. Bjørn Kjos-Hanssen
2010	J	`jnl`	A strong law of computationally weak subsets. Electron. Colloquium Comput. Complex. Bjørn Kjos-Hanssen
2010	J	`jnl`	Enumerating randoms CoRR Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch
2010	J	`jnl`	Higher Kurtz randomness. Ann. Pure Appl. Log. Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu
2010	J	`jnl`	Lattice initial segments of the hyperdegrees. J. Symb. Log. Bjørn Kjos-Hanssen, Richard A. Shore
2010	C	`conf`	The Strength of the Besicovitch-Davies Theorem. CiE Bjørn Kjos-Hanssen, Jan Reimann
2010	J	`jnl`	The probability distribution as a computational resource for randomness testing. J. Log. Anal. Bjørn Kjos-Hanssen
2009	J	`jnl`	Effective dimension of points visited by Brownian motion. Theor. Comput. Sci. Bjørn Kjos-Hanssen, Anil Nerode
2009	J	`jnl`	Finding paths through narrow and wide trees. J. Symb. Log. Stephen Binns, Bjørn Kjos-Hanssen
2009	J	`jnl`	Google distance between words CoRR Bjørn Kjos-Hanssen, Alberto J. Evangelista
2009	C	`conf`	Members of Random Closed Sets. CiE David Diamondstone, Bjørn Kjos-Hanssen
2009	C	`conf`	Numberings and Randomness. CiE Paul Brodhead, Bjørn Kjos-Hanssen
2009	J	`jnl`	Superhighness. Notre Dame J. Formal Log. Bjørn Kjos-Hanssen, André Nies
2009	C	`conf`	The Strength of the Grätzer-Schmidt Theorem. CiE Paul Brodhead, Bjørn Kjos-Hanssen
2008	J	`jnl`	Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
2007	Misc	`conf`	The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. LFCS Bjørn Kjos-Hanssen, Anil Nerode
2006	A	`conf`	Kolmogorov Complexity and the Recursion Theorem. STACS Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
2006	J	`jnl`	On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon
2005	J	`jnl`	Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. Bjørn Kjos-Hanssen, André Nies, Frank Stephan
2004	J	`jnl`	Comparing DNR and WWKL. J. Symb. Log. Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
2003	J	`jnl`	Local initial segments of the Turing degrees. Bull. Symb. Log. Bjørn Kjos-Hanssen