A fast algorithm for melding splay trees

DOI10.1007/3-540-51542-9_37MaRDI QIDQ4028907zbMATH OpenFDO

Authors Graeme Port, Alistair Moffat

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_37

zbMATH Keywords

ordered setssplay tree melding

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Self-adjusting binary search trees
• Sequential access in splay trees takes linear time
• scientific article; zbMATH DE number 65701
• Experimental and Efficient Algorithms
• Data structures for mergeable trees

Cited in

(3)

• A tree-based mergesort
• Randomized splay trees: Theoretical and experimental results.
• Data structures for mergeable trees

This page was built for publication: A fast algorithm for melding splay trees

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