Merging by the parallel binary search algorithm

DOI10.1080/00207168708803596MaRDI QIDQ3804204zbMATH OpenOpenAlexFDO

Authors Nadia Y. Yousif, D. J. Evans

Publication date 1987

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168708803596

zbMATH Keywords

binary searchbubble sortcomplexity analysisparallel algorithmsorted subsets

Mathematics Subject Classification ID

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

Cites work

• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• The parallel neighbour sort and 2-way merge algorithm
• The parallel odd-even merge algorithm

Cited in

(3)

• The parallel neighbour sort and 2-way merge algorithm
• scientific article; zbMATH DE number 6117286 (Why is no real title available?)
• On parallel integer merging

This page was built for publication: Merging by the parallel binary search algorithm

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