Updating approximately complete trees
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Skip trees, an alternative data structure to skip lists in a concurrent approach”
Updating approximately complete trees
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Search trees and bubble memories
Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Arbitrary weight changes in dynamic trees
Kurt Mehlhorn (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: