Unifying binary-search trees and permutations
- ,
- Imrich Vrto
- University of California at Riverside,
- University of Warsaw,
- Slovak Academy of Sciences
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Research
Related Event
Title
8th International Conference on Fundamentals of Computation Theory, FCT 1991
Event type
ConferenceDate
09/09/1991 - 09/13/1991Location
GosenGermany
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.
Publication Information
Output type
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Research
Original language
English (US)Pages from-to (Number of pages)
Pages 190-199 (10 pages)Publication milestones
- Published - 1991
Publication status
Published - 1991
Publisher
Springer VerlagPublication series
- Publication series name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
Volume: 529 LNCS
ISBN (Print)
9783540544586Publication IDs
- Scopus: 85032875074
Host publication title
Fundamentals of Computation Theory - 8th International Conference, FCT 1991, ProceedingsHost publication editors
- Lothar Budach
Publication metrics
Metrics
Fractional count
1
Fractional count
0.50
Fractional count
1
Fractional count
0.50
Fractional count
1
Fractional count
1
Funding Details
This research has been supported by the Alexander yon Humboldt Fellowship of the second author, and was partly written when he was visiting Max-Planck Institute
FundersFunding numbers
Alexander Berlin
-Max-Planck-Gesellschaft
-