******Papers on arXiv **

**Other Papers:**

The Strength of the Graetzer-Schmidt theorem, with M. Khan, B. Kjos-Hanssen, W. A. Lampe, P. K. L. V. Nguyen, and R. A. Shore, Archive for Mathematical Logic 55 (2016) 687–704.

Bounded Randomness, with R. Downey, and K. M. Ng, Workshop on Theoretical Computer Science 2012 (Calude Festschrift), M.J. Dinneen et al. (Eds.), Lecture Notes in in Computer Science 7160, Springer, Heidelberg (2012) 59–70.

Algorithmic Randomness and Capacity of Closed Sets, with D. Cenzer, F. Toska, and S. Wyman, Logical Methods in Computer Science, Vol. 6 (2011) 1–16.

Effective Capacity and Randomness of Closed Sets, with D. Cenzer, Proceedings: Computability and Complexity in Analysis 2010, and Electronic Proceedings in Theoretical Computer Science 24 (2010) 67–76.

The Strength of the Grätzer-Schmidt Theorem, with B. Kjos-Hanssen, Proceedings: Computability in Europe 2009, Ambos-Spies, Löwe, and Merkle (Eds.), Lecture Notes in Computer Science 5635 (2009) 59–67.

Numberings and randomness, with B. Kjos-Hanssen, Proceedings: Computability in Europe 2009, Ambos-Spies, Löwe, and Merkle (Eds.), Lecture Notes in Computer Science 5635 (2009) 49–58.

Algorithmic Randomness of Continuous Functions, with G. Barmpalias, D. Cenzer, J.B. Remmel, and R. Weber, Archive for Mathematical Logic 45 (2008) 533–546.

Effectively Closed Sets and Enumerations, with D. Cenzer, Archive for Mathematical Logic 45 (2008) 565–582.

Continuity of Capping in $scr C_{ m bT}$, with A. Li, and W. Li, Annals of Pure and Applied Logic 155 (2008) 1–15.

Computable Aspects of Closed Sets, Ph.D. Thesis, University of Florida, ProQuest LLC (2008) 150 pp.

Algorithmic Randomness of Closed Sets, with G. Barmpalias, D. Cenzer, S. Dashti, and R. Weber, Journal of Logic and Computation 17 (2007) 1041–1062.

Random Continuous Functions, with D. Cenzer and J. Remmel, Proceedings: Third International Conference on Computability and Complexity in Analysis (2006) 76–89, and Electronic Notes in Theoretical Computer Science 167 (2007) 275–287.

Enumerations of $Pi^0_1$ Classes: Acceptability and Decidable Classes, Proceedings: Third International Conference on Computability and Complexity in Analysis (2006); Electronic Notes in Theoretical Computer Science 167 (2007) 289–301.

Random Closed Sets, with D. Cenzer and S. Dashti, Proceedings: Computability in Europe 2006, Beckmann, Berger, Loewe, and J.Tucker (Eds.): Logical Approaches to Computational Barriers, Lecture Notes in Computer Science 3988 (2006) 55–64.