Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Weight-balanced tree

In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2019
2019
We consider the distributed integer-weight-balancing problem in networks of nodes that are interconnected via directed edges… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
2015
2015
  • Lukas Krejci
  • IEEE 8th International Conference on Intelligent…
  • 2015
  • Corpus ID: 17247280
The paper presents a new approach of AMM network data concentrator autonomous behavior programming. The proposed method utilizes… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
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
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
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
  • table 1
Is this relevant?
2013
2013
We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In many Early Jurassic ammonites including Badouxia columbiae (Frebold 1967), the siphuncle is offset from the midline of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
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
Is this relevant?
1977
1977
  • Y. Horibe
  • Inf. Control.
  • 1977
  • Corpus ID: 40357702
An improved upper bound is obtained on the averaged path length of an alphabetical binary tree (or equivalently on the averaged… Expand
Is this relevant?