On the Average Size of the Intersection of Binary Trees

DOI10.1137/0221002MaRDI QIDQ3990096zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/110571

zbMATH Keywords

average complexitybinary search treesgenerating functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Average-case analysis on simple families of trees using a balanced probability model
• On the concentration of the height of binary search trees
• Random binary trees: from the average case analysis to the asymptotics of distributions
• An analytic approach to the height of binary search trees

Cited in

(4)

• Multiprocessor simulation strategies with optimal speed-up
• Psi-series method for equality of random trees and quadratic convolution recurrences
• Average-case analysis of pattern-matching in trees under the BST probability model
• Average-case analysis on simple families of trees using a balanced probability model

This page was built for publication: On the Average Size of the Intersection of Binary Trees

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