- On the functions generated by the general purpose analog computeriandc, 257:34-57, 2017. [doi]

- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computationsicalp 2016: [doi]
- Computing with polynomial ordinary differential equationsjc, 36:106-140, 2016. [doi]

- Noncomputability, unpredictability, and financial marketscomplexity, 17(6):24-30, 2012. [doi]
- Computability, noncomputability, and hyperbolic systemsamc, 219(6):3039-3054, 2012. [doi]

- Solving Analytic Differential Equations in Polynomial Time over Unbounded Domainsmfcs 2011: 170-181 [doi]
- Computability in planar dynamical systemsnc, 10(4):1295-1312, 2011. [doi]

- Computational bounds on polynomial differential equationsamc, 215(4):1375-1385, 2009. [doi]

- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys ApproachENTCS, 221:103-114, 2008. [doi]
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEsENTCS, 202:49-57, 2008. [doi]
- Computability with polynomial differential equationsaam, 40(3):330-349, 2008. [doi]