Shang-En Huang

my email

I am currently an assistant professor in the Department of Computer Science and Information Engineering (CSIE), National Taiwan University. Previously, I was a Postdoc at Boston College advised by Hsin-Hao Su. I had the honor of being advised by Seth Pettie when pursuing my PhD at University of Michigan. I am interested in any cool analysis techniques of an algorithm, as well as any cool stuff related to graphs. I also love competitive programming.

Research Interest [CV]: Dynamic Graph Data Structures and Algorithms. Asynchronous Distributed Algorithms. Distributed Graph Algorithms. Algorithms in Word RAM Model. Lower bound graphs for sparse distance preservers.

Shang-En Huang

Education

Assistant Professor, CSIE, National Taiwan University, Taipei, Taiwan2024 - present
Postdoc, Computer Science, Boston College, Chestnut Hill, MA, USA2022 - 2024
Ph.D., Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA2016 - 2022
M.S., Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA2014 - 2016
B.S., Mathematics and CSIE, National Taiwan University, Taipei, Taiwan2007 - 2012

Conference Papers

Deterministic Expander Routing: Faster and More Versatile [arXiv]
Yi-Jun Chang, Shang-En Huang, and Hsin-Hao Su
ACM Symposium on Principles of Distributed Computing (PODC), 2024
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds [arXiv]
Nairen Cao, Shang-En Huang, and Hsin-Hao Su
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts [arXiv]
Zhongtian He, Shang-En Huang, and Thatchaphol Saranurak
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Cactus Representation of Minimum Cuts: Derandomize and Speed up [arXiv]
Zhongtian He, Shang-En Huang, and Thatchaphol Saranurak
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
(1−ϵ)(1-\epsilon)-Approximate Maximum Weighted Matching in poly(1/ϵ,log⁡n)\text{poly}(1/\epsilon, \log n) Time in the Distributed and Parallel Settings [arXiv]
Shang-En Huang and Hsin-Hao Su
ACM Symposium on Principles of Distributed Computing (PODC), 2023
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence
Nairen Cao, Shang-En Huang, and Hsin-Hao Su
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection [arXiv]
Shang-En Huang, Seth Pettie, and Leqi Zhu
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
Vertex Sparsifiers for Hyperedge Connectivity [arXiv]
Han Jiang, Shang-En Huang, Thatchaphol Saranurak, and Tian Zhang
European Symposium on Algorithms (ESA), 2022
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience [arXiv]
Shang-En Huang, Seth Pettie, and Leqi Zhu
ACM SIGACT Symposium on Theory of Computing (STOC), 2022
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts [arXiv]
Shang-En Huang and Seth Pettie
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2018
Fully Dynamic Connectivity in O(log⁡n(log⁡log⁡n)2)O(\log n(\log\log n)^2) Amortized Expected Time [arXiv]
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017

Journal Papers

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Shang-En Huang, Seth Pettie, and Leqi Zhu
Journal of the ACM, Volume 71, Issue 2, 2024
Fully Dynamic Connectivity in O(log⁡n(log⁡log⁡n)2)O(\log n(\log\log n)^2) Amortized Expected Time [arXiv]
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup
TheoretiCS, Volume 2, 2023
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts [arXiv]
Shang-En Huang and Seth Pettie
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35(3), 2021
Thorup-Zwick emulators are universally optimal hopsets [arXiv]
Shang-En Huang and Seth Pettie
Information Processing Letters (IPL), February 2019

Teaching

Algorithm Design and Analysis 2024 Fall
Randomness and Computation (CSCI 2244) @ Boston College 2023 Fall
This site is built using Next.js Logo