Hello! I’m a third-year (as of Fall 2024) 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 two years thinking about online selection problems. I’m particuarly interested in questions about what makes certain OSPs tricky, including:
If you have an idea for a project that you’d like to collaborate on or chat about, feel free to reach out!
"*" denotes myself.
Sublinear-Overhead Secure Linear Algebra on a Dishonest Server
Mark Braverman, *. Forthcoming.
Decentralization Cheapens Corruptive Majority Attacks
*, AFT 2023.
Optimal Rates for Bandit Nonstochastic Control
Y. Jennifer Sun, *, Elad Hazan. NeurIPS 2023.
Links and such are below.
My current local time is .