A simple near-linear pseudopolynomial time randomized algorithm for subset sum C Jin, H Wu arXiv preprint arXiv:1807.11597, 2018 | 17 | 2018 |

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 | 16 | 2019 |

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 | 15 | 2021 |

Faster algorithms for all pairs non-decreasing paths problem R Duan, C Jin, H Wu arXiv preprint arXiv:1904.10701, 2019 | 9 | 2019 |

Faster matrix multiplication via asymmetric hashing R Duan, H Wu, R Zhou arXiv preprint arXiv:2210.10173, 2022 | 8 | 2022 |

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 | 7 | 2021 |

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 | 4 | 2018 |

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 | 3 | 2022 |

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 | 2 | 2022 |

(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 | 1 | 2022 |

Near-Optimal Algorithm for Constructing Greedy Consensus Tree H Wu 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | | 2020 |