An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
type: Item
instance of: scholarly article
title: An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms
zbMATH Open document ID: 0922.68040
DOI: 10.1016/S0012-365X(97)00111-8
author: Pilar de la Torre
author: David T. Kao
published in: Discrete Mathematics
publication date: 1998-06-02T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1135935
zbMATH Keywords: digital tree
zbMATH Keywords: prefix model
MaRDI profile type: Publication
cites work: A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
cites work: A note on the average depth of trees
cites work: Q3674050
cites work: Q3675510
cites work: Digital Search Trees Revisited
cites work: On the analysis of algorithms for trees
cites work: Q4057549
cites work: On the average height of trees in digital search and dynamic hashing
Recommended article: A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
Recommended article: Q4250221
Recommended article: The algebra of binary search trees
Recommended article: Toward a formal derivation of the expected behavior of prefix B-trees
Recommended article: A unifying framework for trie design heuristics
Recommended article: Q3675510
Recommended article: PTrie: data structure for compressing and storing sets via prefix sharing
Recommended article: An analysis of fixed-point queries on binary trees
Recommended article: Q4712662
description: scientific article; zbMATH DE number 1135935