Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (CoRR, 2016)

Computational complexity reduction for HEVC intra prediction with SVM. - Han-Yuan Hsu; Shang-En Huang; Yinyi Lin (GCCE, 2017)

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (SODA, 2017)

Thorup-Zwick emulators are universally optimal hopsets. - Shang-En Huang; Seth Pettie (Inf. Process. Lett., 2019)

Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts. - Shang-En Huang; Seth Pettie (SIAM J. Discret. Math., 2021)

Vertex Sparsifiers for Hyperedge Connectivity. - Han Jiang 002; Shang-En Huang; Thatchaphol Saranurak; Tian Zhang (ESA, 2022)

Byzantine agreement in polynomial time with near-optimal resilience. - Shang-En Huang; Seth Pettie; Leqi Zhu (STOC, 2022)

(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings. - Shang-En Huang; Hsin-Hao Su (CoRR, 2022)

Dynamic Connectivity, Hopsets, and Byzantine Agreement - Shang-En Huang (2022)

(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings. - Shang-En Huang; Hsin-Hao Su (PODC, 2023)

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. - Nairen Cao; Shang-En Huang; Hsin-Hao Su (SPAA, 2023)

Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (TheoretiCS, 2023)

Deterministic Expander Routing: Faster and More Versatile. - Yi-Jun Chang; Shang-En Huang; Hsin-Hao Su (PODC, 2024)

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. - Nairen Cao; Shang-En Huang; Hsin-Hao Su (SODA, 2024)

Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. - Zhongtian He; Shang-En Huang; Thatchaphol Saranurak (SODA, 2024)

Cactus Representation of Minimum Cuts: Derandomize and Speed up. - Zhongtian He; Shang-En Huang; Thatchaphol Saranurak (SODA, 2024)

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. - Shang-En Huang; Seth Pettie; Leqi Zhu (J. ACM, 2024)

Hardness and Approximation Algorithms for Balanced Districting Problems. - Prathamesh Dharangutte; Jie Gao 001; Shang-En Huang; Fang-Yi Yu (FORC, 2025)