George Z. Li

George Z. Li

Auto-generated profile, based on publicly available information

George Z. Li

Carnegie Mellon University

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
HFHenry Fleischmann
Henry Fleischmann
GLGeorge Z. Li
George Z. Li
JLJason Li
Jason Li
We give faster algorithms for weak expander decompositions and approximate max flow on undirected graphs. First, we show that it is possible to "warm start" the cut-matching game when computing weak expander decompositions, avoiding the cost of the recursion depth. Our algorithm is also flexible enough to support weaker flow subroutines than previous algorithms. Our second contribution is to streamline the recent non-recursive approximate max flow algorithm of Li, Rao, and Wang (SODA, 2025) and adapt their framework to use our new weak expander decomposition primitive. Consequently, we give an approximate max flow algorithm within a few logarithmic factors of the limit of expander decomposition-based approaches.

5 June 2025 in arXiv
Verified
Preprint
Open access
PDF file
SFShiyuan Feng
Shiyuan Feng
YFYing Feng
Ying Feng
GLGeorge Z. Li
George Z. Li
ZSZhao Song
Zhao Song
DWDavid P. Woodruff
David P. Woodruff
LZLichen Zhang
Lichen Zhang
Recently differential privacy has been used for a number of streaming, data structure, and dynamic graph problems as a means of hiding the internal randomness of the data structure, so that multiple possibly adaptive queries can be made without sacrificing the correctness of the responses. Although these works use differential privacy to show that for some problems it is possible to tolerate $T$ queries using $\widetilde{O}(\sqrt{T})$ copies of a data structure, such results only apply to numerical estimation problems, and only return the cost of an optimization problem rather than the solution itself. In this paper, we investigate the use of differential privacy for adaptive queries to search problems, which are significantly more challenging since the responses to queries can reveal much more about the internal randomness than a single numerical query. We focus on two classical search problems: nearest neighbor queries and regression with arbitrary turnstile updates. We identify key parameters to these problems, such as the number of $c$-approximate near neighbors and the matrix condition number, and use different differential privacy techniques to design algorithms returning the solution vector with memory and time depending on these parameters. We give algorithms for each of these problems that achieve similar tradeoffs.

18 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
GLGeorge Z. Li
George Z. Li
JLJason Li
Jason Li
JZJunkai Zhang
Junkai Zhang
We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in $n^{2+o(1)}$ time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026).