Randomized search trees
- 1 October 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 16 (4-5) , 464-497
- https://doi.org/10.1007/bf01940876
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Faster uniquely represented dictionariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Four results on randomized incremental constructionsComputational Geometry, 1993
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- A note on the height of binary search treesJournal of the ACM, 1986
- Biased Search TreesSIAM Journal on Computing, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- Addendum to “a storage scheme for height-balanced trees”Information Processing Letters, 1979
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972