Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

A new class of balanced search trees : half-balanced binary search tress

H. J. Olivié

RAIRO. Inform. théor., 16 1 (1982) 51-71

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1982160100511

This article has been cited by the following article(s):

CONSTRUCTING RED-BLACK TREE SHAPES

ANDREA MANTLER and HELEN CAMERON
International Journal of Foundations of Computer Science 13 (06) 837 (2002)
DOI: 10.1142/S0129054102001497
See this article

A note on the path length of red–black trees

Helen Cameron and Derick Wood
Information Processing Letters 42 (5) 287 (1992)
DOI: 10.1016/0020-0190(92)90038-W
See this article

Computing

Jan van Leeuwen and Peter Widmayer
Handbooks in Operations Research and Management Science, Computing 3 323 (1992)
DOI: 10.1016/S0927-0507(05)80204-X
See this article

Priority Search Trees

Edward M. McCreight
SIAM Journal on Computing 14 (2) 257 (1985)
DOI: 10.1137/0214021
See this article

Amortized Computational Complexity

Robert Endre Tarjan
SIAM Journal on Algebraic Discrete Methods 6 (2) 306 (1985)
DOI: 10.1137/0606031
See this article

Updating a balanced search tree in O(1) rotations

Robert Endre Tarjan
Information Processing Letters 16 (5) 253 (1983)
DOI: 10.1016/0020-0190(83)90099-6
See this article