About
I'm an MS student in computer science at ETH Zürich, working in theory. I like questions about when hard combinatorial problems become tractable, and how close we can get to optimal when they don't.
Before ETH I studied CS and math at Columbia, where I TA'd Discrete Mathematics and CS Theory for two years, and I worked as a software engineer for a few years. Through high school I competed in math olympiads (IMO, EGMO bronze, Balkan, Mediterranean).
Off duty I'm into art, video games, and martial arts. I hold a 1st dan in Goju-ryu karate and 2nd kyu in Shotokan karate :)
Research Interests
Mostly approximation algorithms and combinatorial optimization. My favorite corner of the field is network design, problems like the traveling salesman, Steiner trees, and connectivity augmentation: simple to state, stubbornly hard, and full of beautiful structure. Lately I've also been drawn to fast graph algorithms.
- Approximation algorithms
- Network design & combinatorial optimization
- Graph algorithms & graph theory
- Computational complexity
Where it started: my high school thesis on Turán's theorem.
Now
Taking courses at ETH; right now that mostly means exam prep for Graph Theory and Principles of Distributed Computing. Next up is a semester project in theory, hopefully this coming winter.