1. Effective strong dimension in algorithmic information and computational complexity;Athreya;SIAM Journal on Computing,2007
2. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set;Barzdins;Soviet Mathematics Doklady,1968
3. Constructive dimension and weak truth-table degrees. Conference of Computability in Europe 2007;Bienvenu,2007
4. C. Conidis, PhD Thesis, University of Chicago, in preparation
5. Computability by probabilistic machines;de Leeuw,1956