Efficient selection on a binary tree
type: Item
instance of: scholarly article
title: Efficient selection on a binary tree
zbMATH Open document ID: 0653.68055
DOI: 10.1016/0020-0190(86)90110-9
author: Jack Cooper
author: Selim G. Akl
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4066349
zbMATH Keywords: median
zbMATH Keywords: parallel algorithm
zbMATH Keywords: selection
zbMATH Keywords: binary tree of processors
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90110-9
OpenAlex ID: W1975361216
cites work: Time bounds for selection
cites work: Q4057549
Recommended article: Optimal binary search trees
Recommended article: Selection by rank in K-dimensional binary search trees
Recommended article: Efficient reorganization of binary search trees
Recommended article: Q4707800
Recommended article: An optimally efficient selection algorithm
Recommended article: DYNAMIC OPTIMAL BINARY SEARCH TREE
Recommended article: Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Recommended article: Q5443270
Recommended article: Optimal Search in Trees
description: scientific article; zbMATH DE number 4066349