Neil Lutz



Application Materials
Curriculum vitae
Research statement
Teaching statement

Publications
Bounding the Dimension of Points on a Line
with D. M. Stull
Information and Computation, to appear.
Quantifying the Burden of Exploration and the Unfairness of Free Riding
with Christopher Jung and Sampath Kannan
ACM-SIAM Symposium on Discrete Algorithms (SODA), to appear.
Robustness and Games Against Nature in Molecular Programming
with Jack H. Lutz, Robyn R. Lutz, and Matthew R. Riley
International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER), 2019.
Projection Theorems Using Effective Dimension
with D. M. Stull
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2018.
Algorithmic information, plane Kakeya sets, and conditional dimension
with Jack H. Lutz
ACM Transactions on Computation Theory (TOCT), 2018.
Fractal Intersections and Products via Algorithmic Dimension
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2017.
Dynamics at the Boundary of Game Theory and Distributed Computing
with Aaron D. Jaggard, Michael Schapira, and Rebecca N. Wright
ACM Transactions on Economics and Computation (TEAC), 2017.
Dimension Spectra of Lines
with D. M. Stull
Conference on Computability in Europe (CiE), 2017.
Stateless Computation
with Danny Dolev, Michael Erdmann, Michael Schapira, and Adva Zair
Brief announcement at ACM Symposium on Principles of Distributed Computing (PODC), 2017.
Lines missing every random point
with Jack H. Lutz
Computability, 2015.
Self-stabilizing uncoupled dynamics
with Aaron D. Jaggard, Michael Schapira, and Rebecca N. Wright
Symposium on Algorithmic Game Theory (SAGT), 2014.

Pre-prints and Expository Writing
Who asked us?  How the theory of computing answers questions about analysis
with Jack H. Lutz
Complexity and Approximation, Ding-Zhu Du and Jie Wang (eds.), to appear.
A Center in Your Neighborhood: Fairness in Facility Location
with Christopher Jung and Sampath Kannan
Some open problems in algorithmic fractal geometry
edited by William Gasarch
Open Problems Column, SIGACT News, 2017.
A Note on Pointwise Dimensions

Recent and Upcoming Meetings
Algorithmic Randomness
American Institute of Mathematics, San Jose, CA, August 2020
International Conference on Computability, Complexity and Randomness (CCR)
Isaac Newton Institute for Mathematical Sciences, University of Cambridge, June–July 2020
Descriptive Set Theory and Computable Topology
Schloss Dagstuhl — Leibniz Center for Informatics, Warden, Germany, April 2020
South Eastern Logic Symposium (SEALS)
University of Florida, February–March 2020
ACM-SIAM Symposium on Discrete Algorithms (SODA)
Salt Lake City, UT, January 2020
Iowa Colloquium on Information, Complexity, and Logic (ICICL)
Grinnell College, October 2019
Summer Cluster: Fairness
Simons Institute for the Theory of Computing, University of California, Berkeley, May–July 2019