Binary search trees constructed from nondistinct keys with/without specified probabilities
type: Item
instance of: scholarly article
title: Binary search trees constructed from nondistinct keys with/without specified probabilities
zbMATH Open document ID: 0871.68135
DOI: 10.1016/0304-3975(95)00302-9
author: Rainer Kemp
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 984517
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00302-9
OpenAlex ID: W2047162640
cites work: Randomized binary search technique
cites work: An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
cites work: Q4769056
cites work: Singularity Analysis of Generating Functions
cites work: Q3765796
cites work: Q4057549
cites work: Yet another application of a binomial recurrence. Order statistics
description: scientific article; zbMATH DE number 984517