Digital search trees with keys of variable length

DOI10.1051/ITA/1996300605071MaRDI QIDQ4341036zbMATH OpenOpenAlexFDO

Authors Markus E. Nebel

Publication date 16 June 1997

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92549

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

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

Recommendations

• Digital Search Trees Revisited
• scientific article; zbMATH DE number 849078
• The expected profile of digital search trees
• The variance of the profile in digital search trees
• scientific article; zbMATH DE number 7051180

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• Digital Search Trees Revisited
• Further results on digital search trees
• Mellin transforms and asymptotics. The mergesort recurrence

Cited in

(4)

• Digital access to comparison-based tree data structures and algorithms
• Digital Search Trees Revisited
• scientific article; zbMATH DE number 3961005 (Why is no real title available?)
• Toward a formal derivation of the expected behavior of prefix B-trees

This page was built for publication: Digital search trees with keys of variable length

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