On Self-stabilizing Search Trees

DOI10.1007/11864219_6MaRDI QIDQ3524295zbMATH OpenOpenAlexFDO

Authors Doina Bein, Ajoy K. Datta, Lawrence L. Larmore

Publication date 9 September 2008

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

Full work available at URL https://doi.org/10.1007/11864219_6

zbMATH Keywords

distributed algorithmmin-max heapsearch treeself-stabilization

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Snap-Stabilizing Optimal Binary Search Tree
• Self-stabilizing Space Optimal Synchronization Algorithms on Trees
• scientific article; zbMATH DE number 2006661
• Self-adjusting binary search trees
• Self-stabilizing labeling and ranking in ordered trees

Cited in

(8)

• Self-stabilizing depth-first search
• Self-stabilizing Space Optimal Synchronization Algorithms on Trees
• Self-stabilizing labeling and ranking in ordered trees
• scientific article; zbMATH DE number 2006661 (Why is no real title available?)
• scientific article; zbMATH DE number 2036577 (Why is no real title available?)
• scientific article; zbMATH DE number 2061546 (Why is no real title available?)
• scientific article; zbMATH DE number 7561459 (Why is no real title available?)
• Snap-Stabilizing Optimal Binary Search Tree

This page was built for publication: On Self-stabilizing Search Trees

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