1. S. Alstrup, J. Holm, Improved algorithms for finding level-ancestors in dynamic trees, in: Proceedings of the 27th International Conference on Automata, Language and Programming, LNCS, vol. 1853, 2000, pp. 73–84.
2. D.A. Bader, M. Yan, B.M.W. Moret, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. University of New Mexico Technical Report HPCERC2001-005 (August 2001): http://www.hpcerc.unm.edu/Research/tr/HPCERC2001-005.pdf.
3. J. Barbay, G. Navarro, Compressed representations of permutations, and applications, in: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, LIPIcs 3 Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 111–122, 2009.
4. M.A. Bender, M. Farach-Colton, The level ancestor problem simplified, in: Proceedings of LATIN, LNCS, vol. 2286, 2002, pp. 508–515.
5. Representing trees of higher degree;Benoit;Algorithmica,2005