Randomized search trees
type: Item
instance of: scholarly article
title: Randomized search trees
zbMATH Open document ID: 0857.68030
DOI: 10.1007/BF01940876
author: Yanyan Li
published in: Algorithmica
publication date: 1997-02-18T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 934122
zbMATH Keywords: search trees
describes a project that uses: LEDA
describes a project that uses: Hull
MaRDI profile type: Publication
cites work: Q4763412
cites work: Organization and maintenance of large ordered indexes
cites work: Biased Search Trees
cites work: Fast Multiple-Precision Evaluation of Elementary Functions
cites work: Four results on randomized incremental constructions
cites work: A note on the height of binary search trees
cites work: Q3140418
cites work: A guided tour of Chernoff bounds
cites work: Sorting jordan sequences in linear time using level-linked search trees
cites work: Priority Search Trees
cites work: Q3219751
cites work: Q3219753
cites work: Q3134498
cites work: Binary Search Trees of Bounded Balance
cites work: Self-adjusting binary search trees
cites work: A unifying look at data structures
full work available at URL: https://doi.org/10.1007/bf01940876
OpenAlex ID: W2099844038
description: scientific article; zbMATH DE number 934122