Fourth-year Ph.D. student at Stanford University, advised by Prof. Aaron Sidford.
Theoretical research focuses on the design and analysis of graph algorithms.
In the past two years, primarily worked on the fully dynamic (1−ε)-approximate matching problem, with particular attention to gaps between unweighted/weighted matchings and bipartite/non-bipartite settings.
Recently excited by rapid advancements in AI, especially its reasoning capabilities in mathematics and coding.
Interested in AI’s potential for autonomous research and complex decision-making, its societal impact—including reshaping expert beliefs—and aligning AI systems robustly with human values.