Shang-En Huang

According to our database, Shang-En Huang authored at least 18 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Hardness and Approximation Algorithms for Balanced Districting Problems.

Prathamesh Dharangutte, Jie Gao, Shang-En Huang, Fang-Yi Yu

Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

2024

Cactus Representation of Minimum Cuts: Derandomize and Speed up.

Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts.

Zhongtian He, Shang-En Huang, Thatchaphol Saranurak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds.

Nairen Cao, Shang-En Huang, Hsin-Hao Su

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Deterministic Expander Routing: Faster and More Versatile.

Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Fully Dynamic Connectivity in O(log n(loglog n)²) Amortized Expected Time.

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup

TheoretiCS, 2023

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence.

Nairen Cao, Shang-En Huang, Hsin-Hao Su

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection.

Shang-En Huang, Seth Pettie, Leqi Zhu

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

(1-<i>ϵ</i>)-Approximate Maximum Weighted Matching in poly(1/<i>ϵ</i>, log <i>n</i>) Time in the Distributed and Parallel Settings.

Shang-En Huang, Hsin-Hao Su

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022

Dynamic Connectivity, Hopsets, and Byzantine Agreement

Shang-En Huang

PhD thesis, 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

Byzantine agreement in polynomial time with near-optimal resilience.

Shang-En Huang, Seth Pettie, Leqi Zhu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Vertex Sparsifiers for Hyperedge Connectivity.

Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2019

Thorup-Zwick emulators are universally optimal hopsets.

Shang-En Huang, Seth Pettie

Inf. Process. Lett., 2019

2018

Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts.

Shang-En Huang, Seth Pettie

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

Fully Dynamic Connectivity in <i>O</i>(log <i>n</i>(log log <i>n</i>)²) Amortized Expected Time.

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Computational complexity reduction for HEVC intra prediction with SVM.

Han-Yuan Hsu, Shang-En Huang, Yinyi Lin

Proceedings of the IEEE 6th Global Conference on Consumer Electronics, 2017

2016

Fully Dynamic Connectivity in O(log n(log log n)²) Amortized Expected Time.

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie

CoRR, 2016