A new class of balanced search trees : half-balanced binary search tress
RAIRO. Inform. théor., 16 1 (1982) 51-71
Published online: 2017-02-01
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:
This article has been cited by the following article(s):
Deletion Without Rebalancing in Binary Search Trees
Siddhartha Sen, Robert E. Tarjan and David Hong Kyun KimACM Transactions on Algorithms 12 (4) 1 (2016)
https://doi.org/10.1145/2903142
Deletion without rebalancing in multiway search trees
Siddhartha Sen and Robert E. TarjanACM Transactions on Database Systems 39 (1) 1 (2014)
https://doi.org/10.1145/2540068
Computer Science in Perspective
Eljas Soisalon-Soininen and Peter WidmayerLecture Notes in Computer Science, Computer Science in Perspective 2598 278 (2003)
https://doi.org/10.1007/3-540-36477-3_21
CONSTRUCTING RED-BLACK TREE SHAPES
ANDREA MANTLER and HELEN CAMERONInternational Journal of Foundations of Computer Science 13 (06) 837 (2002)
https://doi.org/10.1142/S0129054102001497
Insertion reachability, skinny skeletons and path length in red-black trees
Helen Cameron and Derick WoodInformation Sciences 77 (1-2) 141 (1994)
https://doi.org/10.1016/0020-0255(94)90052-3
Foundations of Software Technology and Theoretical Computer Science
V. K. Vaishnavi and D. KhannaLecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science 761 419 (1993)
https://doi.org/10.1007/3-540-57529-4_74
529 (1993)
https://doi.org/10.1109/ICCI.1993.315316
Computing
Jan van Leeuwen and Peter WidmayerHandbooks in Operations Research and Management Science, Computing 3 323 (1992)
https://doi.org/10.1016/S0927-0507(05)80204-X
A note on the path length of red–black trees
Helen Cameron and Derick WoodInformation Processing Letters 42 (5) 287 (1992)
https://doi.org/10.1016/0020-0190(92)90038-W
Advances in Computing and Information — ICCI '91
Helen Cameron and Derick WoodLecture Notes in Computer Science, Advances in Computing and Information — ICCI '91 497 117 (1991)
https://doi.org/10.1007/3-540-54029-6_160
New Results and New Trends in Computer Science
Thomas OttmannLecture Notes in Computer Science, New Results and New Trends in Computer Science 555 243 (1991)
https://doi.org/10.1007/BFb0038193
SWAT 90
Thomas Ottmann and Derick WoodLecture Notes in Computer Science, SWAT 90 447 122 (1990)
https://doi.org/10.1007/3-540-52846-6_83
Computational Graph Theory
Hartmut NoltemeierComputing Supplementum, Computational Graph Theory 7 125 (1990)
https://doi.org/10.1007/978-3-7091-9076-0_7
Binary search trees of almost optimal height
Arne Andersson, Christian Icking, Rolf Klein and Thomas OttmannActa Informatica 28 (2) 165 (1990)
https://doi.org/10.1007/BF01237235
Algorithms and Complexity
K. MEHLHORN and A. TSAKALIDISAlgorithms and Complexity 301 (1990)
https://doi.org/10.1016/B978-0-444-88071-0.50011-4
A dynamic fixed windowing problem
Rolf Klein, Otto Nurmi, Thomas Ottmann and Derick WoodAlgorithmica 4 (1-4) 535 (1989)
https://doi.org/10.1007/BF01553907
Planar Point Location Using Persistent Search Treesa
NEIL SARNAK and ROBERT E. TARJANAnnals of the New York Academy of Sciences 555 (1) 352 (1989)
https://doi.org/10.1111/j.1749-6632.1989.tb22472.x
Foundations of Data Organization and Algorithms
Rolf Klein and Derick WoodLecture Notes in Computer Science, Foundations of Data Organization and Algorithms 367 128 (1989)
https://doi.org/10.1007/3-540-51295-0_123
Maintaining multiple representations of dynamic data structures
Michiel H.M. Smid, Mark H. Overmars, Leen Torenvliet and Peter van Emde BoasInformation and Computation 83 (2) 206 (1989)
https://doi.org/10.1016/0890-5401(89)90058-8
Graph-Theoretic Concepts in Computer Science
Ch. Icking, R. Klein and Th. OttmannLecture Notes in Computer Science, Graph-Theoretic Concepts in Computer Science 314 84 (1988)
https://doi.org/10.1007/3-540-19422-3_7
Priority Search Trees
Edward M. McCreightSIAM Journal on Computing 14 (2) 257 (1985)
https://doi.org/10.1137/0214021
Amortized Computational Complexity
Robert Endre TarjanSIAM Journal on Algebraic Discrete Methods 6 (2) 306 (1985)
https://doi.org/10.1137/0606031
Updating a balanced search tree in O(1) rotations
Robert Endre TarjanInformation Processing Letters 16 (5) 253 (1983)
https://doi.org/10.1016/0020-0190(83)90099-6