An Alternative, Priority-Free, Solution to Post's Problem. - Antonín Kucera 002 (MFCS, 1986)

On Recursion Theory in I Sigma1. - Petr Hájek 001; Antonín Kucera 002 (J. Symb. Log., 1989)

On Relative Randomness. - Antonín Kucera 002 (Ann. Pure Appl. Log., 1993)

Lowness for The Class of Random Sets. - Antonín Kucera 002; Sebastiaan Terwijn (J. Symb. Log., 1999)

Randomness and Recursive Enumerability. - Antonín Kucera 002; Theodore A. Slaman (SIAM J. Comput., 2001)

Low upper bounds of ideals. - Antonín Kucera 002; Theodore A. Slaman (J. Symb. Log., 2009)

Demuth randomness and computational complexity. - Antonín Kucera 002; André Nies (Ann. Pure Appl. Log., 2011)

Demuth's Path to Randomness. - Antonín Kucera 002; André Nies (Computation, Physics and Beyond, 2012)

Joining non-low C.E. sets with diagonally non-computable functions. - Laurent Bienvenu; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Daniel Turetsky (J. Log. Comput., 2013)

Computing k-Trivial Sets by Incomplete Random Sets. - Laurent Bienvenu; Adam R. Day; Noam Greenberg; Antonín Kucera 002; Joseph S. Miller; André Nies; Dan Turetsky (Bull. Symb. Log., 2014)

Demuth's Path to Randomness. - Antonín Kucera 002; André Nies; Christopher P. Porter (Bull. Symb. Log., 2015)