| 2025 | FOCS | Theoretical limitations of multi-layer Transformer. | Lijie Chen, Binghui Peng, Hongxun Wu |
| 2025 | GLOBECOM | Efficient on-board beam hopping via two stage scheduling for Mega-Constellation Satellite Networks. | Hongxun Wu, Weigang Bai, Min Sheng, Junyu Liu, Di Zhou |
| 2025 | SODA | Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors. | Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu |
| 2024 | FOCS | Optimal Quantile Estimation: Beyond the Comparison Model. | Meghal Gupta, Mihir Singhal, Hongxun Wu |
| 2024 | ICALP | A Faster Algorithm for Pigeonhole Equal Sums. | Ce Jin, Hongxun Wu |
| 2024 | SODA | Breaking the Metric Voting Distortion Barrier. | Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu |
| 2024 | SODA | The Cost of Parallelizing Boosting. | Xin Lyu, Hongxun Wu, Junzhao Yang |
| 2023 | FOCS | Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. | Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu |
| 2023 | FOCS | Tight Time-Space Lower Bounds for Constant-Pass Learning. | Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang |
| 2023 | FOCS | Faster Matrix Multiplication via Asymmetric Hashing. | Ran Duan, Hongxun Wu, Renfei Zhou |
| 2023 | ICALP | New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. | Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu |
| 2022 | SODA | Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. | Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu |
| 2022 | STOC | (Fractional) online stochastic matching via fine-grained offline statistics. | Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu |
| 2021 | ICALP | Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. | Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
| 2020 | ICALP | Near-Optimal Algorithm for Constructing Greedy Consensus Tree. | Hongxun Wu |
| 2019 | ICALP | Faster Algorithms for All Pairs Non-Decreasing Paths Problem. | Ran Duan, Ce Jin, Hongxun Wu |
| 2019 | SODA | Fast Modular Subset Sum using Linear Sketching. | Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu |
| 2019 | SODA | A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. | Ce Jin, Hongxun Wu |