Hongxun Wu

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 33

Top Topics

Randomized Algorithm

Highly Efficient

Top Venues

Publications

Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu
Breaking the Metric Voting Distortion Barrier. SODA (2024)
Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu
Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. Proc. ACM Manag. Data 2 (2) (2024)
Ce Jin, Hongxun Wu
A Faster Algorithm for Pigeonhole Equal Sums. CoRR (2024)
Xin Lyu, Hongxun Wu, Junzhao Yang
The Cost of Parallelizing Boosting. SODA (2024)
Ce Jin, Hongxun Wu
A Faster Algorithm for Pigeonhole Equal Sums. ICALP (2024)
Meghal Gupta, Mihir Singhal, Hongxun Wu
Optimal quantile estimation: beyond the comparison model. CoRR (2024)
Meghal Gupta, Mihir Singhal, Hongxun Wu
Optimal quantile estimation: beyond the comparison model. Electron. Colloquium Comput. Complex. (2024)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Sample-Based Matroid Prophet Inequalities. CoRR (2024)
Xin Lyu, Hongxun Wu, Junzhao Yang
The Cost of Parallelizing Boosting. CoRR (2024)
Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS (2023)
Lijie Chen, William Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. Electron. Colloquium Comput. Complex. (2023)
Moses Charikar, Prasanna Ramakrishnan, Kangning Wang, Hongxun Wu
Breaking the Metric Voting Distortion Barrier. CoRR (2023)
Ran Duan, Hongxun Wu, Renfei Zhou
Faster Matrix Multiplication via Asymmetric Hashing. FOCS (2023)
Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang
Tight Time-Space Lower Bounds for Constant-Pass Learning. FOCS (2023)
Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP (2023)
Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang
Tight Time-Space Lower Bounds for Constant-Pass Learning. CoRR (2023)
Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu
(Fractional) online stochastic matching via fine-grained offline statistics. STOC (2022)
Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA (2022)
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics. CoRR (2022)
Ran Duan, Hongxun Wu, Renfei Zhou
Faster Matrix Multiplication via Asymmetric Hashing. CoRR (2022)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. SOSA (2022)
Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR (2021)
Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. ICALP (2021)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. SOSA (2021)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. CoRR (2021)
Hongxun Wu
Near-Optimal Algorithm for Constructing Greedy Consensus Tree. ICALP (2020)
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu
Fast and Simple Modular Subset Sum. CoRR (2020)
Ce Jin, Hongxun Wu
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. SOSA (2019)
Ran Duan, Ce Jin, Hongxun Wu
Faster Algorithms for All Pairs Non-decreasing Paths Problem. CoRR (2019)
Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu
Fast Modular Subset Sum using Linear Sketching. SODA (2019)
Ran Duan, Ce Jin, Hongxun Wu
Faster Algorithms for All Pairs Non-Decreasing Paths Problem. ICALP (2019)
Ce Jin, Hongxun Wu
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. CoRR (2018)
Ran Duan, Kaifeng Lyu, Hongxun Wu, Yuanhang Xie
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. CoRR (2018)