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

A parallel merging algorithm

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

DOI10.1016/0020-0190(81)90119-8zbMath0472.68025OpenAlexW2027911908MaRDI QIDQ1157905

R. H. Barlow, J. Shanehchi, David J. Evans

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90119-8



Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (2)

A parallel sorting scheme whose basic operation sortsN elements ⋮ A new parallel sorting algorithm based upon min-mid-max operations




Cites Work

  • Unnamed Item
  • Merging with parallel processors
  • Interference in multiprocessor computer systems with interleaved memory
  • Optimal Sorting Algorithms for Parallel Computers




This page was built for publication: A parallel merging algorithm

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