Hongxun Wu

According to our database, Hongxun Wu authored at least 20 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald.

Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu

Proc. ACM Manag. Data, 2024

Optimal quantile estimation: beyond the comparison model.

Meghal Gupta, Mihir Singhal, Hongxun Wu

Electron. Colloquium Comput. Complex., 2024

Sample-Based Matroid Prophet Inequalities.

Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang

CoRR, 2024

The Cost of Parallelizing Boosting.

Xin Lyu, Hongxun Wu, Junzhao Yang

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Breaking the Metric Voting Distortion Barrier.

Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Faster Algorithm for Pigeonhole Equal Sums.

Ce Jin, Hongxun Wu

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.

Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu

Electron. Colloquium Comput. Complex., 2023

New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs.

Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Faster Matrix Multiplication via Asymmetric Hashing.

Ran Duan, Hongxun Wu, Renfei Zhou

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Tight Time-Space Lower Bounds for Constant-Pass Learning.

Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

(Fractional) online stochastic matching via fine-grained offline statistics.

Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Oblivious Online Contention Resolution Schemes.

Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions.

Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Fast and Simple Modular Subset Sum.

Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications.

Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Near-Optimal Algorithm for Constructing Greedy Consensus Tree.

Hongxun Wu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum.

Ce Jin, Hongxun Wu

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Fast Modular Subset Sum using Linear Sketching.

Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Faster Algorithms for All Pairs Non-Decreasing Paths Problem.

Ran Duan, Ce Jin, Hongxun Wu

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs.

Ran Duan, Kaifeng Lyu, Hongxun Wu, Yuanhang Xie

CoRR, 2018