@inproceedings{8010cd7208ac46c28bab3a511e4b07dd,
title = "Unifying binary-search trees and permutations",
abstract = "A new method to evaluate the number of cycles in random permutations and the height of random binary search trees is developed. The approach is based on certain number sequences that can be interpreted both by referring to permutations and trees. New bounds on the behavior of number of cycles in random permutations are obtained.",
author = "Chlebus, {Bogdan S.} and Imrich Vrto",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 8th International Conference on Fundamentals of Computation Theory, FCT 1991 ; Conference date: 09-09-1991 Through 13-09-1991",
year = "1991",
doi = "10.1007/3-540-54458-5_63",
language = "English (US)",
isbn = "9783540544586",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "190--199",
editor = "Lothar Budach",
booktitle = "Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings",
}