Published multiple papers, including 'Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches' (SODA 2022), 'Massively Parallel and Dynamic Algorithms for Minimum Size Clustering' (SODA 2022), 'Almost Linear Time Density Level Set Estimation via DBSCAN' (AAAI 2021), etc.
Research Experience
Research scientist at Google New York in the Algorithms and Optimization team led by Vahab Mirrokni.
Education
Ph.D. from Columbia University (Advisors: Alex Andoni, Cliff Stein, Mihalis Yannakakis). Undergraduate from Institute for Interdisciplinary Information Sciences (Yao Class), Tsinghua University.
Background
Research scientist at Google NYC in the Algorithms and Optimization team. Main research interests include parallel and massively parallel algorithms, sketching, streaming algorithms, graph algorithms, machine learning, high dimensional geometry, metric embedding, numerical linear algebra, clustering, and other algorithms related to large-scale data computation.