default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHongxun Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Elena Gribelyuk
, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu:
Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. Proc. ACM Manag. Data 2(2): 109 (2024)- [c16]Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. ICALP 2024: 94:1-94:11 - [c15]Moses Charikar, Kangning Wang, Prasanna Ramakrishnan, Hongxun Wu:
Breaking the Metric Voting Distortion Barrier. SODA 2024: 1621-1640 - [c14]Xin Lyu, Hongxun Wu, Junzhao Yang:
The Cost of Parallelizing Boosting. SODA 2024: 3140-3155 - [i16]Xin Lyu, Hongxun Wu, Junzhao Yang:
The Cost of Parallelizing Boosting. CoRR abs/2402.15145 (2024) - [i15]Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. CoRR abs/2403.19117 (2024) - [i14]Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. CoRR abs/2404.03847 (2024) - [i13]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Sample-Based Matroid Prophet Inequalities. CoRR abs/2406.12799 (2024) - [i12]Meghal Gupta, Mihir Singhal, Hongxun Wu:
Optimal quantile estimation: beyond the comparison model. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c13]Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang:
Tight Time-Space Lower Bounds for Constant-Pass Learning. FOCS 2023: 1195-1202 - [c12]Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu:
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting. FOCS 2023: 1224-1239 - [c11]Ran Duan, Hongxun Wu, Renfei Zhou:
Faster Matrix Multiplication via Asymmetric Hashing. FOCS 2023: 2129-2138 - [c10]Lijie Chen, Xin Lyu, Avishay Tal, Hongxun Wu:
New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs. ICALP 2023: 39:1-39:20 - [i11]Moses Charikar, Prasanna Ramakrishnan, Kangning Wang, Hongxun Wu:
Breaking the Metric Voting Distortion Barrier. CoRR abs/2306.17838 (2023) - [i10]Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang:
Tight Time-Space Lower Bounds for Constant-Pass Learning. CoRR abs/2310.08070 (2023) - [i9]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. TR23 (2023) - 2022
- [c9]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA 2022: 1661-1678 - [c8]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. SOSA 2022: 268-278 - [c7]Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu:
(Fractional) online stochastic matching via fine-grained offline statistics. STOC 2022: 77-90 - [i8]Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu:
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics. CoRR abs/2204.06851 (2022) - [i7]Ran Duan, Hongxun Wu, Renfei Zhou:
Faster Matrix Multiplication via Asymmetric Hashing. CoRR abs/2210.10173 (2022) - 2021
- [c6]Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. ICALP 2021: 68:1-68:20 - [c5]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [i6]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR abs/2111.01759 (2021) - [i5]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. CoRR abs/2111.10607 (2021) - 2020
- [c4]Hongxun Wu:
Near-Optimal Algorithm for Constructing Greedy Consensus Tree. ICALP 2020: 105:1-105:14 - [i4]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020)
2010 – 2019
- 2019
- [c3]Ran Duan, Ce Jin, Hongxun Wu:
Faster Algorithms for All Pairs Non-Decreasing Paths Problem. ICALP 2019: 48:1-48:13 - [c2]Ce Jin, Hongxun Wu:
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. SOSA 2019: 17:1-17:6 - [c1]Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu:
Fast Modular Subset Sum using Linear Sketching. SODA 2019: 58-69 - [i3]Ran Duan, Ce Jin, Hongxun Wu:
Faster Algorithms for All Pairs Non-decreasing Paths Problem. CoRR abs/1904.10701 (2019) - 2018
- [i2]Ce Jin, Hongxun Wu:
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. CoRR abs/1807.11597 (2018) - [i1]Ran Duan, Kaifeng Lyu, Hongxun Wu, Yuanhang Xie:
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. CoRR abs/1808.10658 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
