Donald M. Stull
Ph.D. Candidate
Department of Computer Science
Iowa State University
dstull [AT] iastate.edu
My research is focused on the interaction between analysis and theoretical computer science. For more detail you can read my Research Statement or CV.

Papers and preprints

Neil Lutz and D. M. Stull, Projection theorems using effective dimension. (submitted).

D. M. Stull, Some results on circuit lower bounds and derandomization of promise AM problems. (submitted).

Neil Lutz and D. M. Stull, Dimension spectra of lines, Computability in Europe (CiE), 2017.

Neil Lutz and D. M. Stull, Bounding the dimension of points on a line, Theory and Applications of Models of Computation (TAMC), 2017.

Joe Clanin, Timothy H. McNicholl, D. M. Stull, Analytic computable structure theory and $L^p$ spaces

Adam Case, Jack H. Lutz, and D. M. Stull, Reachability problems for continuous chemical reaction networks, Natural Computing (invited paper).

Timothy H. McNicholl and D. M. Stull, The isometry degree of a computable copy of lp, arXiv preprint arXiv:1605.00641.

Xiang Huang and D. M. Stull, Polynomial space randomness in analysis, Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016, Krakow, Poland August 22-26, 2016), 86:1-86:13.

Adam Case, Jack H. Lutz, and D. M. Stull, Reachability problems for continuous chemical reaction networks, Proceedings of the Fifteenth International Conference on Unconventional Computation and Natural Computation (UCNC 2016, Manchester, UK, July 11-15, 2016), pp. 1-10.

Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Titus H. Klinge, Divita Mathur, D. M. Stull, Taylor G. Bergquist, and Eric R. Henderson, Requirements analysis for a product family of DNA nanodevices, Proceedings of the Twentieth IEEE International Requirements Engineering Conference (RE 2012, Chicago, IL, September 24-28, 2012), pp. 211-220.