J. [. Aho, J. D. Hopcroft, and . Ullman, The Design and Analysis of Computer Algorithms, 1974.

B. Bollobás and I. Simon, Probabilistic Analysis of Disjoint Set Union Algorithms, SIAM Journal on Computing, vol.22, issue.5, pp.1053-1074, 1993.
DOI : 10.1137/0222064

R. [. Chassaing and . Marchand, Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms. manuscript, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00001664

P. [. Fill, N. Flajolet, and . Kapur, Singularity analysis, Hadamard products, and tree recurrences, Journal of Computational and Applied Mathematics, vol.174, issue.2, pp.271-313, 2005.
DOI : 10.1016/j.cam.2004.04.014

J. A. Fill, N. Kapur, and A. Panholzer, Destruction of Very Simple Trees, Algorithmica, vol.46, issue.3-4, pp.345-366, 2006.
DOI : 10.1007/s00453-006-0100-1

P. [. Flajolet, A. Poblete, and . Viola, On the Analysis of Linear Probing Hashing, Algorithmica, vol.22, issue.4, pp.490-515, 1998.
DOI : 10.1007/PL00009236
URL : https://hal.archives-ouvertes.fr/inria-00073424

[. Hwang and R. Neininger, Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions, SIAM Journal on Computing, vol.31, issue.6, pp.1687-1722, 2002.
DOI : 10.1137/S009753970138390X

A. [. Knuth and . Schönhage, The expected linearity of a simple equivalence algorithm, Theoretical Computer Science, vol.6, issue.3, pp.281-315, 1978.
DOI : 10.1016/0304-3975(78)90009-9

]. A. Pan04 and . Panholzer, Destruction of recursive trees, In Mathematics and Computer Science. III, Trends in Mathematics, pp.267-280, 2004.

]. A. Yao76 and . Yao, On the average behavior of set merging algorithms (extended abstract, Conference Record of the Eight Annual ACM Symposium on Theory of Computing, pp.192-195, 1976.