Efficient selection on a binary tree

DOI10.1016/0020-0190(86)90110-9zbMATH Open0653.68055OpenAlexW1975361216MaRDI QIDQ1108019FDOQ1108019

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

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

zbMATH Keywords

medianparallel algorithmselectionbinary tree of processors

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Time bounds for selection

Cited In (5)

• Bit serial addition trees and their applications
• A refinement of replacement selection
• Optimal binary search trees
• Title not available (Why is that?)
• An efficient selection algorithm on the pyramid

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)