Research Publications

Extending the Reach of the Point-to-Set Principle
with Jack H. Lutz and Elvira Mayordomo
International Symposium on Theoretical Aspects of Computer Science (STACS), 2022.

Dimension Spectra of Lines
with D. M. Stull
Computability, to appear.

Fractal Intersections and Products via Algorithmic Dimension
ACM Transactions on Computation Theory (TOCT), 2021.

Bounding the Dimension of Points on a Line
with D. M. Stull
Information and Computation, 2020.

A Center in Your Neighborhood: Fairness in Facility Location
with Christopher Jung and Sampath Kannan
Symposium on Foundations of Responsible Computing (FORC), 2020.

Quantifying the Burden of Exploration and the Unfairness of Free Riding
with Christopher Jung and Sampath Kannan
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020.

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.

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.

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

Dimension and the Structure of Complexity Classes
with Jack H. Lutz and Elvira Mayordomo

Algorithmically Optimal Outer Measures
with Jack H. Lutz
Conference on Computability and Complexity in Analysis (CCA), 2020

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.), 2020.

Some open problems in algorithmic fractal geometry
edited by William Gasarch
Open Problems Column, SIGACT News, 2017.

Recent and Upcoming Meetings

International Conference on Computability, Complexity and Randomness (CCR)
Isaac Newton Institute for Mathematical Sciences, University of Cambridge, June 2022

Descriptive Set Theory and Computable Topology
Schloss Dagstuhl — Leibniz Center for Informatics, Warden, Germany, November 2021

Special Session on Computability Theory
ASL North American Annual Meeting, University of Notre Dame, June 2021

Computability Theory
Oberwolfach Research Institute for Mathematics, Oberwolfach, Germany, April–May 2021

Algorithmic Randomness
American Institute of Mathematics, San Jose, CA, August 2020

South Eastern Logic Symposium (SEALS)
University of Florida, February–March 2020

Midwest Computability Seminar
University of Chicago, February 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