Fault tolerance and storage reduction in binary search trees

DOI10.1016/S0019-9958(84)80035-2MaRDI QIDQ3719842zbMATH OpenFDO

Authors J. Ian Munro, Patricio V. Poblete

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(84)80035-2

zbMATH Keywords

searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• An easily-diagnosable fault-tolerant binary tree architecture
• scientific article; zbMATH DE number 1760005
• Dynamic Fault Tolerance in Fat Trees
• Sparse fault-tolerant BFS trees
• Analysis and design of a fault-tolerant tree architecture
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• scientific article; zbMATH DE number 913359

Cited in

(3)

• Unsafe operations in B-trees
• The analysis of heuristics for search trees
• Optimal binary search trees

This page was built for publication: Fault tolerance and storage reduction in binary search trees

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