Weighted Binary Trees for Concurrent Searching

DOI10.1006/JAGM.1996.0004MaRDI QIDQ4864435zbMATH OpenOpenAlexFDO

Authors Michael L. Fredman, David Cohen

Publication date 27 June 1996

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

Full work available at URL https://doi.org/10.1006/jagm.1996.0004

zbMATH Keywords

\(k\)-costsplay treesweighted path length

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Connected searching of weighted trees
• Connected searching of weighted trees
• A new weight balanced binary search tree
• scientific article; zbMATH DE number 934534
• Approximation strategies for generalized binary search in weighted trees
• Approximate search strategies for weighted trees
• Parallel construction of binary trees with near optimal weighted path length
• Weighted dynamic finger in binary search trees
• scientific article; zbMATH DE number 2087827

Cited in

(5)

• Optimal binary search trees with costs depending on the access paths.
• Parallel construction of binary trees with near optimal weighted path length
• Weighted Leaf AVL-Trees
• Weighted dynamic finger in binary search trees
• Optimal binary search trees

This page was built for publication: Weighted Binary Trees for Concurrent Searching

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