On the Average Size of the Intersection of Binary Trees

DOI10.1137/0221002zbMath0743.68070OpenAlexW2019579058MaRDI QIDQ3990096

No author found.

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

generating functionsaverage complexitybinary search trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Multiprocessor simulation strategies with optimal speed-up ⋮ 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 ⋮ Psi-series method for equality of random trees and quadratic convolution recurrences

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