$K$-trivial degrees and the jump-traceability hierarchy, Proc. Amer, pp.2099-2109, 2009. ,
DOI : 10.1090/S0002-9939-09-09761-5
Reconciling Data Compression and Kolmogorov Complexity, Proceedings of the International Conference on Automata, Languages and Programming (ICALP), pp.643-654, 2007. ,
DOI : 10.1007/978-3-540-73420-8_56
Strong jump-traceability I: The computably enumerable case, Advances in Mathematics, vol.217, issue.5, pp.2045-2074, 2008. ,
DOI : 10.1016/j.aim.2007.09.008
Algorithmic randomness, Scholarpedia, vol.2, issue.10 ,
DOI : 10.4249/scholarpedia.2574
Anticomplexity , lowness and highness notions, and reducibilities with tiny use, 2009. ,
Abstract, The Journal of Symbolic Logic, vol.218, issue.02, pp.501-521, 2010. ,
DOI : 10.1002/malq.19930390153
Degrees of Functions with no Fixed Points, Proceedings of the Eighth International Congress of Logic, pp.191-201, 1987. ,
DOI : 10.1016/S0049-237X(08)70045-4
On the complexity of enumeration and decision of predicates, Soviet Math. Dokl, vol.11, pp.17-20, 1970. ,
Kolmogorov complexity and the recursion theorem, Trans. Amer. Math. Soc. In print ,
An Introduction to Kolmogorov Complexity and Its Applications, 2008. ,
Private communication, 2010. ,
Computational randomness and lowness. The Journal of Symbolic Logic, pp.1199-1205, 2001. ,