My Research

For more information about my research and teaching experience, please see my CV.

Papers and preprints

Pinned distance sets using effective dimension
In progress

The dimension spectrum conjecture for planar lines
International Colloquium on Automata, Languages, and Programming (ICALP), 2022

Optimal oracles for point-to-set principles
Symposium on Theoretical Aspects of Computer Science (STACS), 2022

Asymptotic divergences and strong dichotomy
with Xiang Huang, Jack H. Lutz and Elvira Mayordomo
Symposium on Theoretical Aspects of Computer Science (STACS), 2020

Computability on quasi-Polish spaces
with Mathieu Hoyrup, Cristobal Rojas and Victor Selivanov
International Conference on Descriptional Complexity of Formal Systems (DCFS), 2019

Semicomputable points in Euclidean spaces
with Mathieu Hoyrup
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2019

Results on the dimension spectra of planar lines
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2018

Analytic computable structure theory and Lp spaces
with Joe Clanin, Timothy H. McNicholl
Fundamenta Mathematicae 244(3), pp. 255-285, 2019.

Projection theorems using effective dimension
with Neil Lutz
Conference version: International Symposium on Mathematical Foundations of Computer Science (MFCS), 2018.
Journal version: Computability 11, pp. 85-112, 2022.

The isometry degree of a computable copy of lp
with Timothy H. McNicholl
Conference version: Proceedings of the 14th Annual Conference on Computability in Europe (CiE 2018)
Journal version: Computability 8(2), pp. 179-189, 2019.

Semicomputable geometry
with Mathieu Hoyrup and Diego Nava Saucedo
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).

Dimension spectra of lines
with Neil Lutz
Proceedings of the 13th Annual Conference on Computability in Europe (CiE 2017)

Bounding the dimension of points on a line
with Neil Lutz
Conference version: Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC 2017)
Journal version:  Information & Computation 275, 2020.

Polynomial space randomness in analysis
with Xiang Huang
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)

Reachability problems for continuous chemical reaction networks
with Adam Case and Jack H. Lutz
Conference version: Proceedings of the Fifteenth International Conference on Unconventional Computation and Natural Computation (UCNC 2016)
Journal version: Natural Computing 17 (2018), pp. 223-230

Requirements analysis for a product family of DNA nanodevices
with Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Titus H. Klinge, Divita Mathur, Taylor G. Bergquist and Eric R. Henderson
Proceedings of the Twentieth IEEE International Requirements Engineering Conference (RE 2012).

Surveys and Expository Writings

Resource-bounded randomness and its applications