Shang-En Huang

From MaRDI portal
(Redirected from Person:1628676)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Vertex sparsifiers for hyperedge connectivity2025-06-19Paper
Deterministic expander routing: faster and more versatile2025-06-13Paper
Byzantine agreement with optimal resilience via statistical fraud detection
Journal of the ACM
2025-02-06Paper
Cactus representations in polylogarithmic max-flow via maximal isolating mincuts2024-11-28Paper
Cactus representation of minimum cuts: derandomize and speed up2024-11-28Paper
Breaking 3-factor approximation for correlation clustering in polylogarithmic rounds2024-11-28Paper
Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
TheoretiCS
2024-07-03Paper
(1- <i>ϵ</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>ϵ</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Byzantine agreement in polynomial time with near-optimal resilience
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection2022-06-30Paper
Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts
SIAM Journal on Discrete Mathematics
2021-10-18Paper
scientific article; zbMATH DE number 7238981 (Why is no real title available?)
(available as arXiv preprint)
2020-08-25Paper
Thorup-Zwick emulators are universally optimal hopsets
Information Processing Letters
2018-12-05Paper
Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper


Research outcomes over time


This page was built for person: Shang-En Huang