Hongxun Wu

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Near-optimal algorithm for constructing greedy consensus tree	2026-03-18	Paper
A faster algorithm for pigeonhole equal sums	2026-01-14	Paper
Breaking the metric voting distortion barrier	2024-11-28	Paper
The cost of parallelizing boosting	2024-11-28	Paper
New PRGs for unbounded-width/adaptive-order read-once branching programs	2024-11-14	Paper
A simple near-linear pseudopolynomial time randomized algorithm for subset sum	2024-08-26	Paper
Truly low-space element distinctness and subset sum via pseudorandom hash functions	2024-07-19	Paper
Fast and simple modular subset sum	2024-05-14	Paper
Oblivious online contention resolution schemes	2024-05-14	Paper
(Fractional) online stochastic matching via fine-grained offline statistics Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Faster Algorithms for All Pairs Non-Decreasing Paths Problem (available as arXiv preprint)	2022-07-21	Paper
Fast modular subset sum using linear sketching Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper

Research outcomes over time

This page was built for person: Hongxun Wu