Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2021

2021

This article proposes the first distributed algorithm that solves the weight-balancing problem using only finite rate and simplex… Expand

2020

2020

Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees… Expand

2019

2019

We consider a distributed constrained optimization problem over graphs, where cost function of each agent is private. Moreover… Expand

Highly Cited

2014

Highly Cited

2014

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

2014

2014

We present a new overlay, called the Deterministic Decentralized tree ($$D^2$$D2-tree). The $$D^2$$D2-tree compares favorably to… Expand

2013

2013

We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via… Expand

2011

2011

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

2004

2004

This paper presents the performance of the Weight-Balanced Testing (WBT) algorithm with multiple testers. The WBT algorithm aims… Expand

1993

1993

We prove that during any update in a weight-balanced tree, or BB[α] tree, a top-down restructuring pass is sufficient to… Expand

1977

1977

An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or equivalently on the averaged… Expand