About
Hello! I’m (as of Spring 2026) a fourth-year computer science Ph.D. candidate at Princeton University. Before that, I was an undergraduate student at Yale, where I studied mathematics (combined M.S./B.S.) and computer science. I’m lucky to have two advisors: Mark Braverman and Matt Weinberg.
I’ve spent much of the past few years thinking about online selection problems. I’m particuarly interested in questions about what makes certain OSPs tricky, including:
- Why can’t we seem to do better than a \(O(m)\)-competitive ratio for an intersection of \(m\) matroids, even though the best known lower bound is \(O(m^{\frac{1}{2}+o(1)})\)? Why is the gap so large?
- Why isn’t random-order enough to give us \(O(1)\)-competitive algorithms for matroid secretary (so far)?
More recently, I’ve also been trying to figure out how cryptography can help us build more efficient algorithms and protocols even when privacy isn’t a concern, and exactly how “trapdoored” pseudorandom objects fit into this picture.