Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. - Ran Duan; Kaifeng Lyu; Hongxun Wu; Yuanhang Xie (CoRR, 2018)

Faster Algorithms for All Pairs Non-Decreasing Paths Problem. - Ran Duan; Ce Jin 001; Hongxun Wu (ICALP, 2019)

Fast Modular Subset Sum using Linear Sketching. - Kyriakos Axiotis; Arturs Backurs; Ce Jin 001; Christos Tzamos; Hongxun Wu (SODA, 2019)

A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. - Ce Jin 001; Hongxun Wu (SOSA, 2019)

Near-Optimal Algorithm for Constructing Greedy Consensus Tree. - Hongxun Wu (ICALP, 2020)

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. - Hu Fu 001; Zhihao Gavin Tang; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (ICALP, 2021)

Fast and Simple Modular Subset Sum. - Kyriakos Axiotis; Arturs Backurs; Karl Bringmann; Ce Jin 001; Vasileios Nakos; Christos Tzamos; Hongxun Wu (SOSA, 2021)

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. - Lijie Chen 001; Ce Jin 001; R. Ryan Williams; Hongxun Wu (SODA, 2022)

Oblivious Online Contention Resolution Schemes. - Hu Fu 001; Pinyan Lu; Zhihao Gavin Tang; Abner Turkieltaub; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (SOSA, 2022)

(Fractional) online stochastic matching via fine-grained offline statistics. - Zhihao Gavin Tang; Jinzhao Wu; Hongxun Wu (STOC, 2022)

Tight Time-Space Lower Bounds for Constant-Pass Learning. - Xin Lyu 002; Avishay Tal; Hongxun Wu; Junzhao Yang (FOCS, 2023)

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

New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. - Lijie Chen 001; Xin Lyu 002; Avishay Tal; Hongxun Wu (ICALP, 2023)

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. - Lijie Chen 001; William Hoza; Xin Lyu 002; Avishay Tal; Hongxun Wu (Electron. Colloquium Comput. Complex., 2023)

A Faster Algorithm for Pigeonhole Equal Sums. - Ce Jin 001; Hongxun Wu (ICALP, 2024)

Sample-Based Matroid Prophet Inequalities. - Hu Fu 001; Pinyan Lu; Zhihao Gavin Tang; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (EC, 2024)

The Cost of Parallelizing Boosting. - Xin Lyu 002; Hongxun Wu; Junzhao Yang (SODA, 2024)

Theoretical limitations of multi-layer Transformer. - Lijie Chen 001; Binghui Peng; Hongxun Wu (CoRR, 2024)

Optimal quantile estimation: beyond the comparison model. - Meghal Gupta; Mihir Singhal; Hongxun Wu (Electron. Colloquium Comput. Complex., 2024)

Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. - Elena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu (Proc. ACM Manag. Data, 2024)

Breaking the Metric Voting Distortion Barrier. - Moses Charikar; Prasanna Ramakrishnan; Kangning Wang 001; Hongxun Wu (J. ACM, 2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors. - Elena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu (SODA, 2025)