1 citations · 1 across the 2 of their papers we have counts for
5 papers
Core-Halo Decomposition: Decentralizing Large-Scale Fixed-Point Problems
Haixiang, Yang Xu, Jiefu Zhang +4
We study solving large-scale fixed-point equation \(x^\star=\bar F(x^\star)\) with decomposition. Standard strict decomposition assigns each agent a disjoint block and evaluates up…
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
Xudong Wu, Guangxu Yang, Penghui Yao
We investigates a model of hybrid classical-quantum communication complexity, in which two parties first exchange classical messages and subsequently communicate using quantum mess…
Almost Optimal Algorithms for Token Collision in Anonymous Networks
Sirui Bai, Xinyu Fu, Xudong Wu +2
In distributed systems, situations often arise where some nodes each holds a collection of tokens, and all nodes collectively need to determine whether all tokens are distinct. For…
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
ChengSheng Wang, Xudong Wu, Penghui Yao
Computing the distance parameters of a network, including the diameter, radius, eccentricities and the all-pairs shortest paths (APSP) is a central problem in distributed computing…
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Xudong Wu, Penghui Yao
This paper studies the round complexity of computing the weighted diameter and radius of a graph in the quantum CONGEST model. We present a quantum algorithm that -approx…