Unifying binary-search trees and permutations

Bogdan S. Chlebus, Imrich Vrto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings
EditorsLothar Budach
PublisherSpringer Verlag
Pages190-199
Number of pages10
ISBN (Print)9783540544586
DOIs
StatePublished - Jan 1 1991
Externally publishedYes
Event8th International Conference on Fundamentals of Computation Theory, FCT 1991 - Gosen, Germany
Duration: Sep 9 1991Sep 13 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume529 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Fundamentals of Computation Theory, FCT 1991
CountryGermany
CityGosen
Period9/9/919/13/91

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Unifying binary-search trees and permutations'. Together they form a unique fingerprint.

  • Cite this

    Chlebus, B. S., & Vrto, I. (1991). Unifying binary-search trees and permutations. In L. Budach (Ed.), Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings (pp. 190-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 529 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54458-5_63