default search action
Shang-En Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. J. ACM 71(2): 12:1-12:37 (2024) - [c12]Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. PODC 2024: 194-204 - [c11]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. SODA 2024: 1465-1502 - [c10]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. SODA 2024: 1503-1541 - [c9]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. SODA 2024: 4124-4154 - [i11]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representation of Minimum Cuts: Derandomize and Speed up. CoRR abs/2401.10856 (2024) - [i10]Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su:
Deterministic Expander Routing: Faster and More Versatile. CoRR abs/2405.03908 (2024) - 2023
- [j3]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. TheoretiCS 2 (2023) - [c8]Shang-En Huang, Hsin-Hao Su:
(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings. PODC 2023: 44-54 - [c7]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. SODA 2023: 4335-4353 - [c6]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. SPAA 2023: 249-259 - [i9]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. CoRR abs/2307.06723 (2023) - [i8]Zhongtian He, Shang-En Huang, Thatchaphol Saranurak:
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts. CoRR abs/2311.10706 (2023) - 2022
- [c5]Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. ESA 2022: 70:1-70:13 - [c4]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine agreement in polynomial time with near-optimal resilience. STOC 2022: 502-514 - [i7]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement in Polynomial Time with Near-Optimal Resilience. CoRR abs/2202.13452 (2022) - [i6]Shang-En Huang, Seth Pettie, Leqi Zhu:
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. CoRR abs/2206.15335 (2022) - [i5]Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. CoRR abs/2207.04115 (2022) - [i4]Shang-En Huang, Hsin-Hao Su:
(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings. CoRR abs/2212.14425 (2022) - 2021
- [j2]Shang-En Huang, Seth Pettie:
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts. SIAM J. Discret. Math. 35(3): 2129-2144 (2021)
2010 – 2019
- 2019
- [j1]Shang-En Huang, Seth Pettie:
Thorup-Zwick emulators are universally optimal hopsets. Inf. Process. Lett. 142: 9-13 (2019) - 2018
- [c3]Shang-En Huang, Seth Pettie:
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts. SWAT 2018: 26:1-26:12 - [i3]Shang-En Huang, Seth Pettie:
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts. CoRR abs/1802.06271 (2018) - 2017
- [c2]Han-Yuan Hsu, Shang-En Huang, Yinyi Lin:
Computational complexity reduction for HEVC intra prediction with SVM. GCCE 2017: 1-2 - [c1]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie:
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. SODA 2017: 510-520 - [i2]Shang-En Huang, Seth Pettie:
Thorup-Zwick Emulators are Universally Optimal Hopsets. CoRR abs/1705.00327 (2017) - 2016
- [i1]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie:
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. CoRR abs/1609.05867 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint