Digital access to comparison-based tree data structures and algorithms

DOI10.1006/JAGM.2001.1160MaRDI QIDQ2746435zbMATH OpenOpenAlexFDO

Authors Salvador Roura

Publication date 10 October 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/96883

zbMATH Keywords

tree data structures

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Digital Search Trees Revisited
• Digital search trees with keys of variable length
• The Ubiquitous Digital Tree
• Optimal search trees using two-way key comparisons
• New trie data structures which support very fast search operations

Cited in

(5)

• Surpassing the information theoretic bound with fusion trees
• Multikey quickselect
• The Ubiquitous Digital Tree
• Automata, Languages and Programming
• New method in information processing for maintaining an efficient dynamic ordered set

This page was built for publication: Digital access to comparison-based tree data structures and algorithms

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