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

Merging with parallel processors

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

DOI10.1145/361020.361216zbMath0311.68031OpenAlexW2019964994MaRDI QIDQ4069775

Fanica Gavril

Publication date: 1975

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361020.361216



Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items (5)

A parallel sorting scheme whose basic operation sortsN elements ⋮ On the optimality of tape merge of two lists with similar size ⋮ A parallel merging algorithm ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ A parallel search algorithm for directed acyclic graphs




This page was built for publication: Merging with parallel processors

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