| Fully Dynamic Connectivity in Amortized Expected Time SE Huang, D Huang, T Kopelowitz, S Pettie, M Thorup TheoretiCS 2, 2023 | 55 | 2023 |
| Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts SE Huang, S Pettie SIAM Journal on Discrete Mathematics 35 (3), 2129-2144, 2021 | 50 | 2021 |
| Thorup–zwick emulators are universally optimal hopsets SE Huang, S Pettie Information Processing Letters 142, 9-13, 2019 | 44 | 2019 |
| (1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings SE Huang, HH Su Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | 9 | 2023 |
| Byzantine agreement in polynomial time with near-optimal resilience SE Huang, S Pettie, L Zhu Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 6 | 2022 |
| Byzantine agreement with optimal resilience via statistical fraud detection SE Huang, S Pettie, L Zhu Journal of the ACM 71 (2), 1-37, 2024 | 5 | 2024 |
| Breaking 3-factor approximation for correlation clustering in polylogarithmic rounds N Cao, SE Huang, HH Su Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4 | 2024 |
| Nearly optimal parallel algorithms for longest increasing subsequence N Cao, SE Huang, HH Su Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 4 | 2023 |
| Thorup-Zwick emulators are universally optimal hopsets. CoRR, abs/1705.00327, 2017 SE Huang, S Pettie arXiv preprint arXiv:1705.00327, 2017 | 3 | 2017 |
| Vertex sparsifiers for hyperedge connectivity H Jiang, SE Huang, T Saranurak, T Zhang arXiv preprint arXiv:2207.04115, 2022 | 2 | 2022 |
| Thorup-Zwick emulators are universally optimal hopsets. CoRR, abs/1705.00327 SE Huang, S Pettie arXiv preprint arXiv:1705.00327, 2017 | 2 | 2017 |
| Deterministic Expander Routing: Faster and More Versatile YJ Chang, SE Huang, HH Su arXiv preprint arXiv:2405.03908, 2024 | 1 | 2024 |
| Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts Z He, SE Huang, T Saranurak Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
| (1-ε)-Approximate Maximum Weighted Matching in poly (1/ε, log n) Time in the Distributed and Parallel Settings. SE Huang, HH Su CoRR, 2022 | 1 | 2022 |
| Cactus Representation of Minimum Cuts: Derandomize and Speed up Z He, SE Huang, T Saranurak Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | | 2024 |
| -Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings SE Huang, HH Su arXiv preprint arXiv:2212.14425, 2022 | | 2022 |
| Dynamic Connectivity, Hopsets, and Byzantine Agreement SE Huang | | 2022 |
