I am a computer science PhD student in the group of Rasmus Kyng at the Department of Computer Science, ETH Zurich.
My research is supported by the 2024 Google PhD Fellowship.
My interests lie in the realm of algorithms and optimization. In particular, I am fascinated by fast graph algorithms and their relations to linear algebra. I occasionally dabble in other fields, such as deep learning and high performance computing, and I have very broad interests.
Recently, my work has led to almost optimal minimum-cost flow algorithms for 'partially dynamic' graphs. These algorithms generalize minimum-cost flow algorithms to networks that either only increase or only decrease in connectivity, and resolve many core problems on partially dynamic graphs via direct reductions. Notably, our result for decreasing connectivity achieves the best known time bounds even for static graphs. You can read about this line of work in the Simons Institute Newsletter by Nikhil Srivastava and in an accessible article featured in the ETH news, or watch me give a technical talk about it. See also publications below.
In Fall 2023 I was a visitor at the Data Structures and Optimization for Fast Algorithms program at the Simons Institute in Berkeley, California.
I was awarded the ETH Medal for my Master Thesis on Incremental Single Source Shortest Paths supervised by Maximilian Probst Gutenberg and Rasmus Kyng.
My pronouns are he/him.
I maintain a Google Scholar profile listing the articles I contributed to. The ones made available on arXiv are openly accessible.
You can reach me by email at: