Yang P. Liu

Yang P. Liu is an Assistant Professor at Carnegie Mellon University's Department of Computer Science. He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT.

• Fields of Interest: Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science.

His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games, combinatorial lines, and dynamic graph algorithms.

In 2024, his research spanned FOCS, STOC, and RANDOM conferences, addressing problems in k-CSPs, min-cost flow, and hypergraph sparsification. Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques.

• Scientific Awards: NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021).

He teaches CS 15-759, a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.