Merging by the parallel binary search algorithm
- 1 January 1987
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 22 (3) , 239-248
- https://doi.org/10.1080/00207168708803596
Abstract
The parallel binary search algorithm is discussed and its complexity analysis presented.Keywords
This publication has 3 references indexed in Scilit:
- The parallel neighbour sort and 2-way merge algorithmParallel Computing, 1986
- The parallel odd-even merge algorithmInternational Journal of Computer Mathematics, 1986
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered SetsSIAM Journal on Computing, 1972