Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
The expected depth of each key in the set of binary search trees formed from all sequences composed from a multiset {p1 · 1, p2 · 2, p3 · 3, ···, pn · n} is obtained, and hence the expected weight of such trees. The expected number of left-to-right local minima and the expected number of cycles in sequences composed from a multiset are then deduced from these results. © 1976, ACM. All rights reserved.
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
Arnold.L. Rosenberg
Journal of the ACM
Hong Guan, Saif Masood, et al.
SoCC 2023
Ryan Johnson, Ippokratis Pandis
CIDR 2013