Multiway trees of maximum and minimum probability under the random permutation model

DOI10.1017/S096354830000211XMaRDI QIDQ2785369zbMATH OpenFDO

Authors Robert P. Dobrow, James Allen Fill

Publication date 20 February 1997

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354830000211X

zbMATH Keywords

search treesmultiway trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 398952
• Probability bounds given by multitrees
• On random trees obtained from permutation graphs
• scientific article; zbMATH DE number 852055
• Permutation trees and variation statistics
• Multitrees in random graphs
• A binary tree decomposition space of permutation statistics
• Random Trees

Cites work

• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 852055 (Why is no real title available?)
• Analysis of the space of search trees under the random insertion algorithm
• Note on the heights of random recursive trees and random m‐ary search trees
• On the height of random m‐ary search trees
• Organization and maintenance of large ordered indexes

Cited in

(5)

• Transfer theorems and asymptotic distributional results for m‐ary search trees
• Permutation trees and variation statistics
• On the variety of shapes in digital trees
• QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
• On the variety of shapes on the fringe of a random recursive tree

This page was built for publication: Multiway trees of maximum and minimum probability under the random permutation model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785369)