Semantic Scholar uses AI to extract papers important to this topic.
This article proposes the first distributed algorithm that solves the weight-balancing problem using only finite rate and simplex… Expand Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees… Expand We consider a distributed constrained optimization problem over graphs, where cost function of each agent is private. Moreover… Expand A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum… Expand We present a new overlay, called the Deterministic Decentralized tree ($$D^2$$D2-tree). The $$D^2$$D2-tree compares favorably to… Expand We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via… Expand A weight-balanced tree (WBT) is a binary search tree, whose balance is based on the sizes of the subtrees in each node. Although… Expand This paper presents the performance of the Weight-Balanced Testing (WBT) algorithm with multiple testers. The WBT algorithm aims… Expand We prove that during any update in a weight-balanced tree, or BB[α] tree, a top-down restructuring pass is sufficient to… Expand An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or equivalently on the averaged… Expand