Posts by Collection

portfolio

publications

Efficient Sink-Reachability Analysis via Graph Reduction


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

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

Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms


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

talks

teaching

Teaching experience 1

Undergraduate course, University 1, Department, 2014

This is a description of a teaching experience. You can use markdown like any other post.

Teaching experience 2

Workshop, University 1, Department, 2015

This is a description of a teaching experience. You can use markdown like any other post.