An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms

DOI10.1016/S0012-365X(97)00111-8zbMath0922.68040MaRDI QIDQ1381820

David T. Kao, Pilar de la Torre

Publication date: 2 June 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digital treeprefix model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the average height of trees in digital search and dynamic hashing
• A note on the average depth of trees
• On the analysis of algorithms for trees
• A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
• Digital Search Trees Revisited

This page was built for publication: An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms