On the analysis of algorithms for trees

DOI10.1016/0304-3975(77)90034-2MaRDI QIDQ1238995zbMATH OpenOpenAlexFDO

Authors Jean Francon

Publication date 1977

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(77)90034-2

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• A problem of arrangements
• Correspondences between plane trees and binary sequences
• scientific article; zbMATH DE number 3536107 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• More Combinatorial Properties of Certain Trees

Cited in

(4)

• An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
• Algorithms for sequential generation of combinatorial structures
• Exact and asymptotic distributions in digital and binary search trees
• Profiles of random trees: correlation and width of random recursive trees and binary search trees

This page was built for publication: On the analysis of algorithms for trees

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