Embedded Files
About Me
About Me
I started as a PhD student at CMU in Fall 2024, advised by Jason Li. Previously, I completed my undergraduate at the University of Maryland, where I was advised by Aravind Srinivasan. I am primarily interested in graph algorithms, approximation algorithms, and differential privacy.
I am also thankful for a number of mentors who have supported my career, including: Laxman Dhulipala, Ariel Schvartzman, Zihan Tan, Jalaj Upadhyay, and Anil Vullikanti.
You can reach me by email at gzli929 [at] umd [dot] edu.
Selected Work
Selected Work
Improved Directed Expander Decompositions [arXiv]
with Henry Fleischmann and Jason Li.Fast Algorithms for Graph Arboricity and Related Problems [arXiv]
with Ruoxu Cen, Henry Fleischmann, Jason Li, and Debmalya Panigrahi
Symposium on Foundations of Computer Science (FOCS), 2025.Paths and Intersections: Exact Emulators for Planar Graphs [arXiv]
with Zihan Tan and Tianyi Zhang
Symposium on Foundations of Computer Science (FOCS), 2025.On Differential Privacy for Adaptively Solving Search Problems via Sketching [arXiv]
with Shiyuan Feng, Ying Feng, Zhao Song, David P. Woodruff, and Lichen Zhang
International Conference on Machine Learning (ICML), 2025.
Selected for Oral Presentation (top 1% of submissions)Concentration of Submodular Functions and Read-k Families Under Negative Dependence [arXiv]
with Sharmila Duppala, Juan Luque, Aravind Srinivasan, and Renata Valieva
Innovations in Theoretical Computer Science Conference (ITCS), 2025.
Page updated
Google Sites
Report abuse