Deletions in random binary search trees: a story of errors
type: Item
instance of: scholarly article
title: Deletions in random binary search trees: a story of errors
zbMATH Open document ID: 1278.68081
author: Wolfgang Panny
published in: Journal of Statistical Planning and Inference
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 5710821
zbMATH Keywords: random binary search tree
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: deletions
MaRDI profile type: Publication
full work available at URL: j.jspi.2010.01.028
OpenAlex ID: W1970716997
cites work: On the efficiency of a new method of dictionary construction
cites work: A trivial algorithm whose analysis is not: a continuation
cites work: Analysis of the standard deletion algorithms in exact fit domain binary search trees
cites work: Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
cites work: A trivial algorithm whose analysis isn't
cites work: Q4057549
cites work: Deletions That Preserve Randomness
cites work: Q4369384
cites work: Q4349924
cites work: Distribution of distances in random binary search trees.
cites work: Randomized binary search trees
cites work: The height of a random binary search tree
cites work: Randomized search trees
cites work: A unifying look at data structures
cites work: Trees, Forests and Rearranging
DOI: 10.1016/J.JSPI.2010.01.028
description: scientific article; zbMATH DE number 5710821