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

Fingerprint

Binary Search Tree
Permutation
Random Permutation
Cycle
Evaluate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Unifying binary-search trees and permutations. / Chlebus, Bogdan S.; Vrto, Imrich.

Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings. ed. / Lothar Budach. Springer Verlag, 1991. p. 190-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 529 LNCS).

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

Chlebus, BS & Vrto, I 1991, Unifying binary-search trees and permutations. in L Budach (ed.), Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 529 LNCS, Springer Verlag, pp. 190-199, 8th International Conference on Fundamentals of Computation Theory, FCT 1991, Gosen, Germany, 9/9/91. https://doi.org/10.1007/3-540-54458-5_63
Chlebus BS, Vrto I. Unifying binary-search trees and permutations. In Budach L, editor, Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings. Springer Verlag. 1991. p. 190-199. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-54458-5_63
Chlebus, Bogdan S. ; Vrto, Imrich. / Unifying binary-search trees and permutations. Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings. editor / Lothar Budach. Springer Verlag, 1991. pp. 190-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
year = "1991",
month = "1",
day = "1",
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",

}

TY - GEN

T1 - Unifying binary-search trees and permutations

AU - Chlebus, Bogdan S.

AU - Vrto, Imrich

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85032875074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032875074&partnerID=8YFLogxK

U2 - 10.1007/3-540-54458-5_63

DO - 10.1007/3-540-54458-5_63

M3 - Conference contribution

AN - SCOPUS:85032875074

SN - 9783540544586

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 190

EP - 199

BT - Fundamentals of Computation Theory - 8th International Conference, FCT 1991, Proceedings

A2 - Budach, Lothar

PB - Springer Verlag

ER -