1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2022★ 1 cited
-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings
Shang-En Huang, Hsin-Hao Su
The maximum weighted matching (MWM) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the p…
cs.DC2022
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Shang-En Huang, Seth Pettie, Leqi Zhu
Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that…