Efficient selection on a binary tree

DOI10.1016/0020-0190(86)90110-9MaRDI QIDQ1108019zbMATH OpenOpenAlexFDO

Authors Jack Cooper, Selim G. Akl

Publication date 1986

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(86)90110-9

zbMATH Keywords

medianparallel algorithmselectionbinary tree of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Optimal binary search trees
• Optimal binary search trees
• Selection by rank in K-dimensional binary search trees
• Efficient reorganization of binary search trees
• scientific article; zbMATH DE number 1926670
• An optimally efficient selection algorithm
• DYNAMIC OPTIMAL BINARY SEARCH TREE
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• scientific article; zbMATH DE number 5237331
• Optimal Search in Trees

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Time bounds for selection

Cited in

(5)

• Optimal binary search trees
• scientific article; zbMATH DE number 4026821 (Why is no real title available?)
• An efficient selection algorithm on the pyramid
• Bit serial addition trees and their applications
• A refinement of replacement selection

This page was built for publication: Efficient selection on a binary tree

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