Binary search trees constructed from nondistinct keys with/without specified probabilities

DOI10.1016/0304-3975(95)00302-9zbMath0871.68135OpenAlexW2047162640MaRDI QIDQ1351780

Rainer Kemp

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00302-9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

The scientific works of Rainer Kemp (1949--2004) ⋮ Phase changes in randomm-ary search trees and generalized quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Yet another application of a binomial recurrence. Order statistics
• Singularity Analysis of Generating Functions
• An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
• Randomized binary search technique

This page was built for publication: Binary search trees constructed from nondistinct keys with/without specified probabilities