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)

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

Highly Cited

2010

Highly Cited

2010

- Nathan Grasso Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun
- PPOPP
- 2010

We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based onâ€¦Â (More)

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)

Is this relevant?

2008

2008

- Yi-Ying Zhang, WenCheng Yang, Kee-Bum Kim, Myong-Soon Park
- 2008 International Conference on Intelligentâ€¦
- 2008

Wireless sensor networks (WSNs) are highly vulnerable to attacks for the limitation of constrained resource and communicating viaâ€¦Â (More)

Is this relevant?

2004

2004

- Amr Elmasry
- IFIP TCS
- 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

- Tobias Nipkow, Cornelia Pusch
- Archive of Formal Proofs
- 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

- Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno
- Comput. Geom.
- 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)

Is this relevant?

1998

1998

- Muralidhar Medidi, Narsingh Deo
- J. Parallel Distrib. Comput.
- 1998

AVL (Adelâ€™son-Velâ€™skii and Landis) trees are efficient data structures for implementing dictionaries. We present a parallelâ€¦Â (More)

Is this relevant?

1994

1994

- Kim S. Larsen
- IPPS
- 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)

Is this relevant?

1980

1980

- Carla Schlatter Ellis
- IEEE Transactions on Computers
- 1980

This paper addresses the problem of concurrent access to dynamically balanced binary search trees. Specifically, two solutionsâ€¦Â (More)

Is this relevant?