2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2023
Finding a Small Vertex Cut on Distributed Networks
Yonggang Jiang, Sagnik Mukhopadhyay
We present an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model. Given a positive integer , our algorithm can, with high probability…
cs.DC2021
Robust and Optimal Contention Resolution without Collision Detection
Yonggang Jiang, Chaodong Zheng
We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If i…
cs.DC2021★ 2 cited
Tight Trade-off in Contention Resolution without Collision Detection
Haimin Chen, Yonggang Jiang, Chaodong Zheng
In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to sen…