Binary search tree recursions with harmonic toll functions

DOI10.1016/S0377-0427(01)00469-1zbMath1005.68116OpenAlexW2066969204MaRDI QIDQ1612306

Alois Panholzer, Prodinger, Helmut

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00469-1

zbMATH Keywords

binary search trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (2)

On quickselect, partial sorting and multiple Quickselect ⋮ On binary search tree recursions with monomials as toll functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Sorting algorithms for broadcast communications: mathematical analysis.
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• Comparisons in Hoare's Find Algorithm
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT

This page was built for publication: Binary search tree recursions with harmonic toll functions