Publications

Axiomatization of Compact Initial Value Problems: Open Properties


A complete axiomatization of initial value problems with compact initial conditions for topologically open properties.

Some Open Questions and Recent Results on Computable Banach Spaces


A discussion of results concerning computable Banach spaces based on my Master Thesis.

Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms


Connecting descriptive combinatorics with computable combinatorics through ASI algorithms, preprint with Felix Weilacher

Computability-theoretic complexity of effective Banach spaces


Examining the complexity of various geometric properties of Banach spaces through the lense of computability theory, Master Thesis supervised by Prof. Rod Downey and Prof. Noam Greenberg

Efficient Sink-Reachability Analysis via Graph Reduction


Speeding up reachability queries via graph compression, TKDE, with Dietrich et.al