I am a mathematician and theoretical computer scientist in Booz Allen Hamilton, where I apply new and existing ideas in machine learning and social network analysis to create models, algorithms, and statistical techniques for analyzing international relations and geopolitical conflicts.
In addition to my professional work, I am interested in topics in theoretical computer science including algorithms, graph theory, and computability theory. I enjoy spending my free time investigating the computational complexity of games and puzzles.
- Magic: the Gathering is as Hard as Arithmetic, the follow-up tp my paper "Magic: the Gathering is Turing Complete," is now available as a pre-print on arXiv. (March 2020)
- I am thrilled to share that my research was awarded the Eugene P. Visco Prize for best research by a junior analyst at the MORS Emerging Techniques Forum. This prize comes with an invitation and funding to present at the International Symposium on Military Operational Research next summer. Read the slides. (December 2019)
- I presented a talk on Verifiable Computation at DC DevFest on 6/14. Read the slides or watch the talk. (June 2019)
- I am honored to be one of the awardees of the 2019 DC FemTech Awards, which "honors Washington’s top tech talent who are helping to build the area’s fastest-growing companies and most impactful nonprofit organizations ." (June 2019)
M.S. in Computer Science, the Georgia Institute of Technology, ongoing
B.S. in Mathematics with honors, the University of Chicago, 2016
B.A. in Philosophy, the University of Chicago, 2016