Slow optimally balanced search strategies vs. cached fast uniformly balanced search strategies
- 7 May 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 34 (5) , 251-254
- https://doi.org/10.1016/0020-0190(90)90130-p
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Skip lists: A probabilistic alternative to balanced treesPublished by Springer Nature ,1989
- Self-adjusting binary search treesJournal of the ACM, 1985