Graph Algorithms, Dynamic Graph Data Structures, Distributed and Parallel Graph Algorithms
Department
SELECTED PUBLICATIONS
Shang-En Huang, Hsin-Hao Su, "(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings". ACM Symposium on Principles of Distributed Computing (PODC), 2023.
Nairen Cao, Shang-En Huang, Hsin-Hao Su, "Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence", ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023.
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang, "Vertex Sparsifiers for Hyperedge Connectivity", European Symposium on Algorithms (ESA), 2022.
Shang-En Huang, Seth Pettie, Leqi Zhu, "Byzantine Agreement in Polynomial Time with Near-Optimal Resilience", ACM SIGACT Symposium on Theory of Computing (STOC), 2022.
Shang-En Huang, Seth Pettie, "Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts", Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2018.
