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
Discussion
View source
View history
Purge
English
Log in

The parallel neighbour sort and 2-way merge algorithm

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

DOI10.1016/0167-8191(86)90009-8zbMath0582.68034OpenAlexW2028807364MaRDI QIDQ1068553

Nadia Y. Yousif, David J. Evans

Publication date: 1986

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(86)90009-8


zbMATH Keywords

sortingparallel algorithmsmergingparallel MIMD computer


Mathematics Subject Classification ID

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


Related Items (1)

Merging by the parallel binary search algorithm







This page was built for publication: The parallel neighbour sort and 2-way merge algorithm

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