A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
From MaRDI portal
Publication:4705339
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<189::AID-RSA1>3.0.CO;2-R" /><189::AID-RSA1>3.0.CO;2-R 10.1002/(SICI)1098-2418(199810/12)13:3/4<189::AID-RSA1>3.0.CO;2-RzbMath0959.68513OpenAlexW1990017905MaRDI QIDQ4705339
Prodinger, Helmut, Alois Panholzer
Publication date: 19 December 1999
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<189::aid-rsa1>3.0.co;2-r
Related Items (10)
Spanning tree size in random binary search trees. ⋮ On quickselect, partial sorting and multiple Quickselect ⋮ Attribute grammars and automatic complexity analysis ⋮ Analysis of multiple quickselect variants. ⋮ Distributional analysis of swaps in quick select ⋮ Limit laws for the Randić index of random binary tree models ⋮ Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization ⋮ Random unfriendly seating arrangement in a dining table ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ Binary search tree recursions with harmonic toll functions
This page was built for publication: A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
