scientific article; zbMATH DE number 849078

MaRDI QIDQ4867323zbMATH OpenFDO

Authors Guy Louchard

Publication date 28 February 1996

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The expected profile of digital search trees
• scientific article; zbMATH DE number 7051180
• The variance of the profile in digital search trees
• On the average profile of symmetric digital search trees
• Digital search trees with keys of variable length

Cited in

(14)

• A characterization of digital search trees from the successful search viewpoint
• Some results on tries with adaptive branching.
• scientific article; zbMATH DE number 3961005 (Why is no real title available?)
• scientific article; zbMATH DE number 1188119 (Why is no real title available?)
• Digital search trees with keys of variable length
• scientific article; zbMATH DE number 7051180 (Why is no real title available?)
• Some estimates for the distribution of the height of digital search trees
• Analysis of digital search trees incorporated with paging
• Digital search trees with m trees: level polynomials and insertion costs
• The Ubiquitous Digital Tree
• Distribution of inter-node distances in digital trees
• The expected profile of digital search trees
• On the average redundancy rate of the Lempel-Ziv code with the k-error protocol
• Distances in random digital search trees

This page was built for publication:

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