On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. - Jingxun Liang; Zhihao Gavin Tang; Yixuan Even Xu; Yuhao Zhang 001; Renfei Zhou (ESA, 2023)

Faster Matrix Multiplication via Asymmetric Hashing. - Ran Duan; Hongxun Wu; Renfei Zhou (FOCS, 2023)

Dynamic "Succincter". - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (FOCS, 2023)

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (FOCS, 2023)

Bidder Selection Problem in Position Auctions via Poisson Approximation. - Nick Gravin; Yixuan Even Xu; Renfei Zhou (CoRR, 2023)

Tight Bounds for Classical Open Addressing. - Michael A. Bender; William Kuszmaul; Renfei Zhou (FOCS, 2024)

Dynamic Dictionary with Subconstant Wasted Bits per Key. - Tianxiao Li; Jingxun Liang; Huacheng Yu; Renfei Zhou (SODA, 2024)

New Bounds for Matrix Multiplication: from Alpha to Omega. - Virginia Vassilevska Williams; Yinzhan Xu; Zixuan Xu; Renfei Zhou (SODA, 2024)

Listing 6-Cycles. - Ce Jin 001; Virginia Vassilevska Williams; Renfei Zhou (SOSA, 2024)

Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation. - Nikolai Gravin; Yixuan Even Xu; Renfei Zhou (WWW, 2024)

Optimal Static Fully Indexable Dictionaries. - Jingxun Liang; Renfei Zhou (ICALP, 2025)

More Asymmetry Yields Faster Matrix Multiplication. - Josh Alman; Ran Duan; Virginia Vassilevska Williams; Yinzhan Xu; Zixuan Xu; Renfei Zhou (SODA, 2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. - William Kuszmaul; Aaron Putterman; Tingqiang Xu; Hangrui Zhou; Renfei Zhou (SODA, 2025)

Optimal Non-oblivious Open Addressing. - Michael A. Bender; William Kuszmaul; Renfei Zhou (STOC, 2025)

Optimal Static Dictionary with Worst-Case Constant Query Time. - Yang Hu; Jingxun Liang; Huacheng Yu; Junkai Zhang; Renfei Zhou (STOC, 2025)