8 search results - page 1 / 2 » AVL Trees with Relaxed Balance |
IPPS
1994
IEEE
13 years 9 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
IJISEC
2002
13 years 4 months ago
2002
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...