AVL tree

Known as: AVL-tree, Adelson-Velskii Landis tree, Avl trees 
In computer science, an AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2018
051019652018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
2010
2010
Classification is considered to be one of the important building blocks in data mining problem. The major issues concerning data… (More)
  • table 2
  • table 1
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2008
2008
Wireless sensor networks (WSNs) are highly vulnerable to attacks for the limitation of constrained resource and communicating via… (More)
  • figure 1
Is this relevant?
2004
2004
A new adaptive sorting algorithm is introduced. The new implementation relies on using the traditional AVL trees, and has the… (More)
Is this relevant?
2004
2004
Two formalizations of AVL trees with room for extensions. The first formalization is monolithic and shorter, the second one in… (More)
Is this relevant?
1998
1998
We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1998
1998
AVL (Adel’son-Vel’skii and Landis) trees are efficient data structures for implementing dictionaries. We present a parallel… (More)
  • figure 1
  • figure 2
Is this relevant?
1994
1994
The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request… (More)
Is this relevant?
1990
1990
In this paper we improve previous bounds on expected measures of AVL trees by using fringe analysis. A new way of handling larger… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1980
1980
This paper addresses the problem of concurrent access to dynamically balanced binary search trees. Specifically, two solutions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?