Personal information

Activities

Employment (1)

UC Berkeley: Berkeley, California, US

Employment
Source: Self-asserted source
Hongxun Wu

Works (33)

A Faster Algorithm for Pigeonhole Equal Sums

arXiv
2024 | Other
EID:

2-s2.0-85189359486

Part of ISSN: 23318422
Contributors: Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

A Faster Algorithm for Pigeonhole Equal Sums

Leibniz International Proceedings in Informatics, LIPIcs
2024 | Conference paper
EID:

2-s2.0-85198364188

Part of ISBN: 9783959773225
Part of ISSN: 18688969
Contributors: Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Breaking the Metric Voting Distortion Barrier

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2024 | Conference paper
EID:

2-s2.0-85183398020

Contributors: Charikar, M.; Wang, K.; Ramakrishnan, P.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Optimal quantile estimation: beyond the comparison model

arXiv
2024 | Other
EID:

2-s2.0-85191274346

Part of ISSN: 23318422
Contributors: Gupta, M.; Singhal, M.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Sample-Based Matroid Prophet Inequalities

arXiv
2024 | Other
EID:

2-s2.0-85197779949

Part of ISSN: 23318422
Contributors: Fu, H.; Lu, P.; Tang, Z.G.; Wu, H.; Wu, J.; Zhang, Q.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

The Cost of Parallelizing Boosting

arXiv
2024 | Other
EID:

2-s2.0-85187438054

Part of ISSN: 23318422
Contributors: Lyu, X.; Wu, H.; Yang, J.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

The Cost of Parallelizing Boosting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2024 | Conference paper
EID:

2-s2.0-85188330574

Contributors: Lyu, X.; Wu, H.; Yang, J.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Breaking the Metric Voting Distortion Barrier

Journal of the ACM
2024-12-31 | Journal article
Contributors: Moses Charikar; Prasanna Ramakrishnan; Kangning Wang; Hongxun Wu
Source: check_circle
Crossref

Sample-Based Matroid Prophet Inequalities

2024-07-08 | Conference paper
Contributors: Hu Fu; Pinyan Lu; Zhihao Gavin Tang; Hongxun Wu; Jinzhao Wu; Qianfan Zhang
Source: check_circle
Crossref

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

Proceedings of the ACM on Management of Data
2024-05-10 | Journal article
Contributors: Elena Gribelyuk; Pachara Sawettamalya; Hongxun Wu; Huacheng Yu
Source: check_circle
Crossref

Breaking the Metric Voting Distortion Barrier

arXiv
2023 | Other
EID:

2-s2.0-85165463724

Part of ISSN: 23318422
Contributors: Charikar, M.; Ramakrishnan, P.; Wang, K.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Faster Matrix Multiplication via Asymmetric Hashing

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2023 | Conference paper
EID:

2-s2.0-85182392020

Part of ISBN: 9798350318944
Part of ISSN: 02725428
Contributors: Duan, R.; Wu, H.; Zhou, R.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

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

Leibniz International Proceedings in Informatics, LIPIcs
2023 | Conference paper
EID:

2-s2.0-85166614156

Part of ISBN: 9783959772785
Part of ISSN: 18688969
Contributors: Chen, L.; Lyu, X.; Tal, A.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Tight Time-Space Lower Bounds for Constant-Pass Learning

arXiv
2023 | Other
EID:

2-s2.0-85174877484

Part of ISSN: 23318422
Contributors: Lyu, X.; Tal, A.; Wu, H.; Yang, J.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Tight Time-Space Lower Bounds for Constant-Pass Learning

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2023 | Conference paper
EID:

2-s2.0-85182394769

Part of ISBN: 9798350318944
Part of ISSN: 02725428
Contributors: Lyu, X.; Tal, A.; Wu, H.; Yang, J.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2023 | Conference paper
EID:

2-s2.0-85182003341

Part of ISBN: 9798350318944
Part of ISSN: 02725428
Contributors: Chen, L.; Hoza, W.M.; Lyu, X.; Tal, A.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

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

Proceedings of the Annual ACM Symposium on Theory of Computing
2022 | Conference paper
EID:

2-s2.0-85132773477

Part of ISBN: 9781450392648
Part of ISSN: 07378017
Contributors: Tang, Z.G.; Wu, J.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics

arXiv
2022 | Other
EID:

2-s2.0-85170459678

Part of ISSN: 23318422
Contributors: Tang, Z.G.; Wu, H.; Wu, J.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Faster Matrix Multiplication via Asymmetric Hashing

arXiv
2022 | Other
EID:

2-s2.0-85141566142

Part of ISSN: 23318422
Contributors: Duan, R.; Wu, H.; Zhou, R.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Oblivious Online Contention Resolution Schemes

SIAM Symposium on Simplicity in Algorithms, SOSA 2022
2022 | Conference paper
EID:

2-s2.0-85143384958

Part of ISBN: 9781713852087
Contributors: Fu, H.; Lu, P.; Tang, Z.G.; Turkieltaub, A.; Wu, H.; Wu, J.; Zhang, Q.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2022 | Conference paper
EID:

2-s2.0-85130728848

Part of ISBN: 9781611977073
Contributors: Chen, L.; Jin, C.; Williams, R.R.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Fast and Simple Modular Subset Sum

4th Symposium on Simplicity in Algorithms, SOSA 2021
2021 | Conference paper
EID:

2-s2.0-85108000038

Part of ISBN: 9781713827122
Contributors: Axiotis, K.; Backurs, A.; Bringmann, K.; Jin, C.; Nakos, V.; Tzamos, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Oblivious online contention resolution schemes

arXiv
2021 | Other
EID:

2-s2.0-85170901495

Part of ISSN: 23318422
Contributors: Fu, H.; Lu, P.; Tang, Z.G.; Turkieltaub, A.; Wu, H.; Wu, J.; Zhang, Q.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Random order vertex arrival contention resolution schemes for matching, with applications

Leibniz International Proceedings in Informatics, LIPIcs
2021 | Conference paper
EID:

2-s2.0-85108392087

Part of ISBN: 9783959771955
Part of ISSN: 18688969
Contributors: Fu, H.; Tang, Z.G.; Wu, H.; Wu, J.; Zhang, Q.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Truly low-space element distinctness and subset sum via pseudorandom hash functions

arXiv
2021 | Other
EID:

2-s2.0-85169224712

Part of ISSN: 23318422
Contributors: Chen, L.; Jin, C.; Williams, R.R.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Fast and simple modular subset Sum

arXiv
2020 | Other
EID:

2-s2.0-85170296498

Part of ISSN: 23318422
Contributors: Axiotis, K.; Backurs, A.; Bringmann, K.; Jin, C.; Nakos, V.; Tzamos, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Near-optimal algorithm for constructing greedy consensus tree

Leibniz International Proceedings in Informatics, LIPIcs
2020 | Conference paper
EID:

2-s2.0-85089338605

Part of ISBN: 9783959771382
Part of ISSN: 18688969
Contributors: Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

A simple near-linear pseudopolynomial time randomized algorithm for subset sum

OpenAccess Series in Informatics
2019 | Conference paper
EID:

2-s2.0-85069495642

Part of ISBN: 9783959770996
Part of ISSN: 21906807
Contributors: Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Fast modular subset sum using linear sketching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2019 | Conference paper
EID:

2-s2.0-85066930419

Contributors: Axiotis, K.; Backurs, A.; Jin, C.; Tzamos, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Faster algorithms for all pairs non-decreasing paths problem

arXiv
2019 | Other
EID:

2-s2.0-85169209274

Part of ISSN: 23318422
Contributors: Duan, R.; Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Faster algorithms for all pairs non-decreasing paths problem

Leibniz International Proceedings in Informatics, LIPIcs
2019 | Conference paper
EID:

2-s2.0-85069183407

Part of ISBN: 9783959771092
Part of ISSN: 18688969
Contributors: Duan, R.; Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

A simple near-linear pseudopolynomial time randomized algorithm for subset sum

arXiv
2018 | Other
EID:

2-s2.0-85171081593

Part of ISSN: 23318422
Contributors: Jin, C.; Wu, H.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier

Single-source bottleneck path algorithm faster than sorting for sparse graphs

arXiv
2018 | Other
EID:

2-s2.0-85170962022

Part of ISSN: 23318422
Contributors: Duan, R.; Lyu, K.; Wu, H.; Xie, Y.
Source: Self-asserted source
Hongxun Wu via Scopus - Elsevier