P.C. Yue, C.K. Wong
Journal of the ACM
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.
P.C. Yue, C.K. Wong
Journal of the ACM
Yuta Tsuboi, Yuya Unno, et al.
AAAI 2011
Joseph Y. Halpern
aaai 1996
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR