Hongxun Wu

From MaRDI portal
Person:5091201

Available identifiers

zbMath Open wu.hongxunMaRDI QIDQ5091201

List of research outcomes





PublicationDate of PublicationType
Breaking the metric voting distortion barrier2024-11-28Paper
The cost of parallelizing boosting2024-11-28Paper
New PRGs for unbounded-width/adaptive-order read-once branching programs2024-11-14Paper
A simple near-linear pseudopolynomial time randomized algorithm for subset sum2024-08-26Paper
Truly low-space element distinctness and subset sum via pseudorandom hash functions2024-07-19Paper
Fast and simple modular subset sum2024-05-14Paper
Oblivious online contention resolution schemes2024-05-14Paper
(Fractional) online stochastic matching via fine-grained offline statistics2023-12-08Paper
Faster Algorithms for All Pairs Non-Decreasing Paths Problem2022-07-21Paper
Fast Modular Subset Sum using Linear Sketching2019-10-15Paper

Research outcomes over time

This page was built for person: Hongxun Wu

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:5091201&oldid=11351805"
Powered by MediaWiki