I'm Yang Hu

PhD student, Carnegie Mellon University

I am a first-year PhD student at Carnegie Mellon University, where I am fortunate to be co-advised by William Kuszmaul and Elaine Shi (I also publish under Yang S. Hu). Previously, I received my B.Eng. from Yao Class at Tsinghua University. I have broad interests in theoretical computer science, particularly in designing time- and space-efficient data structures.

During the spring of 2025, I had a great time visiting William Kuszmaul at CMU.

Publications

In theoretical computer science, authors are typically listed alphabetically.

  • Iterative Randomized Rounding for Better-Than-2 k-Median Approximation

    Jarosław Byrka, Yuhao Guo, Yang Hu, Shi Li, Yongho Shin, Phanu Vajanopath, Chengzhang Wan, Zaixuan Wang

    Preprint | paper

  • Quadratic Probing Insertions Are ε^{-(1+o(1))} Time

    Yang Hu, William Kuszmaul, Jingxun Liang, Stefan Walzer, Huacheng Yu, Renfei Zhou

    Preprint | paper

  • Optimal Time-Space Tradeoff for Dynamic Difference-Encoded Dictionaries

    Guy E. Blelloch, Yang Hu, William Kuszmaul, Jingxun Liang, Renfei Zhou

    SODA 2027 | paper

  • Dynamic Entropy-Encoded Arrays in O(1) Time with Nearly Optimal Space

    Guy E. Blelloch, Yang Hu, William Kuszmaul, Tianxiao Li, Renfei Zhou

    FOCS 2026 | paper

  • k-Clustering via Iterative Randomized Rounding

    Jarosław Byrka, Yuhao Guo, Yang Hu, Shi Li, Chengzhang Wan, Zaixuan Wang

    FOCS 2026 | paper

  • Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood

    Yang Hu, William Kuszmaul, Jingxun Liang, Stefan Walzer, Huacheng Yu, Renfei Zhou

    Preprint | paper

  • Fast Concurrent Primitives Despite Contention

    Michael A. Bender, Guy E. Blelloch, Martín Farach-Colton, Yang Hu, Rob Johnson, Rotem Oshman, Renfei Zhou

    SPAA 2026 | paper

  • New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String

    Lijie Chen, Yang Hu, Hanlin Ren

    ITCS 2026 | paper

  • Nearly Optimal Bounds for Stochastic Online Sorting

    Yang Hu

    SODA 2026 | paper

  • Static Retrieval Revisited: To Optimality and Beyond

    Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou

    FOCS 2025 | paper

  • Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps

    Xiaohui Bei, Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang

    STOC 2026 | paper

  • Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations

    Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang

    STOC 2025 | paper

  • Optimal Static Dictionary with Worst-Case Constant Query Time

    Yang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou

    STOC 2025 | paper