M. Archibald, Combinatorial Problems Related to Sequences with Repeated Entries, 2005.

W. Burge, An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys, Journal of the ACM, vol.23, issue.3, pp.451-454, 1976.
DOI : 10.1145/321958.321965

J. Clément, P. Flajolet, and B. Vallée, The analysis of hybrid trie structures, Proceedings of the Ninth Annual ACM?SIAM Symposium on Discrete Algorithms, pp.531-539, 1998.

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2006.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

R. Kemp, Binary search trees constructed from nondistinct keys with/without specified probabilities, Theoretical Computer Science, vol.156, issue.1-2, pp.39-70, 1996.
DOI : 10.1016/0304-3975(95)00302-9

R. Rivest, On self-organizing sequential search heuristics, Communications of the ACM, vol.19, issue.2, pp.63-67, 1976.
DOI : 10.1145/359997.360000