| Faster matrix multiplication via asymmetric hashing R Duan, H Wu, R Zhou 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 104 | 2023 |
| A simple near-linear pseudopolynomial time randomized algorithm for subset sum C Jin, H Wu arXiv preprint arXiv:1807.11597, 2018 | 29 | 2018 |
| Random order vertex arrival contention resolution schemes for matching, with applications H Fu, ZG Tang, H Wu, J Wu, Q Zhang 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 25 | 2021 |
| Fast modular subset sum using linear sketching K Axiotis, A Backurs, C Jin, C Tzamos, H Wu Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 20 | 2019 |
| Faster matrix multiplication via asymmetric hashing (2022) R Duan, H Wu, R Zhou URL: https://arxiv. org/abs/2210.10173, 0 | 13 | |
| Breaking the metric voting distortion barrier M Charikar, P Ramakrishnan, K Wang, H Wu Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 12 | 2024 |
| Fast and Simple Modular Subset Sum∗ K Axiotis, A Backurs, K Bringmann, C Jin, V Nakos, C Tzamos, H Wu Symposium on Simplicity in Algorithms (SOSA), 57-67, 2021 | 12 | 2021 |
| Faster algorithms for all pairs non-decreasing paths problem R Duan, C Jin, H Wu arXiv preprint arXiv:1904.10701, 2019 | 9 | 2019 |
| Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions∗ L Chen, C Jin, RR Williams, H Wu Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 8 | 2022 |
| Single-source bottleneck path algorithm faster than sorting for sparse graphs R Duan, K Lyu, H Wu, Y Xie arXiv preprint arXiv:1808.10658, 2018 | 7 | 2018 |
| New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs L Chen, X Lyu, A Tal, H Wu 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 6 | 2023 |
| Oblivious online contention resolution schemes H Fu, P Lu, ZG Tang, A Turkieltaub, H Wu, J Wu, Q Zhang Symposium on Simplicity in Algorithms (SOSA), 268-278, 2022 | 6 | 2022 |
| Weighted pseudorandom generators via inverse analysis of random walks and shortcutting L Chen, WM Hoza, X Lyu, A Tal, H Wu 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 5 | 2023 |
| Near-optimal algorithm for constructing greedy consensus tree H Wu 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 3 | 2020 |
| (Fractional) online stochastic matching via fine-grained offline statistics ZG Tang, J Wu, H Wu Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 2 | 2022 |
| Optimal quantile estimation: beyond the comparison model M Gupta, M Singhal, H Wu arXiv preprint arXiv:2404.03847, 2024 | 1 | 2024 |
| Tight Time-Space Lower Bounds for Constant-Pass Learning X Lyu, A Tal, H Wu, J Yang 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 1 | 2023 |
| Sample-Based Matroid Prophet Inequalities H Fu, P Lu, ZG Tang, H Wu, J Wu, Q Zhang arXiv preprint arXiv:2406.12799, 2024 | | 2024 |
| Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald E Gribelyuk, P Sawettamalya, H Wu, H Yu Proceedings of the ACM on Management of Data 2 (2), 1-25, 2024 | | 2024 |
| A Faster Algorithm for Pigeonhole Equal Sums C Jin, H Wu arXiv preprint arXiv:2403.19117, 2024 | | 2024 |
Ce JinMIT在 mit.edu 的电子邮件经过验证
