Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Efficient selection on a binary tree

From MaRDI portal
Publication:1108019
Jump to:navigation, search

DOI10.1016/0020-0190(86)90110-9zbMath0653.68055OpenAlexW1975361216MaRDI QIDQ1108019

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

selectionmedianparallel algorithmbinary tree of processors


Mathematics Subject Classification ID

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


Related Items (3)

Bit serial addition trees and their applications ⋮ An efficient selection algorithm on the pyramid ⋮ Optimal binary search trees




Cites Work

  • Unnamed Item
  • Time bounds for selection




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1108019&oldid=13145129"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 02:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki