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.

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,

Neil Lutz and D. M. Stull, Bounding the dimension of points on a line,

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,

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,

Adam Case, Jack H. Lutz, and D. M. Stull, Reachability problems for continuous chemical reaction networks,

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,