On the analysis of algorithms for trees

DOI10.1016/0304-3975(77)90034-2zbMath0357.68033OpenAlexW2031489448MaRDI QIDQ1238995

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)

Related Items

An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms, 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, Algorithms for sequential generation of combinatorial structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A problem of arrangements
• More Combinatorial Properties of Certain Trees
• Correspondences between plane trees and binary sequences