Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Perfectly overlapped merging and sorting on a two-way linear array

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

DOI10.1016/S0020-0190(96)00157-3zbMATH Open0900.68177OpenAlexW1981007126MaRDI QIDQ673341FDOQ673341


Authors: Yen-Chun Lin Edit this on Wikidata


Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00157-3




Recommendations

  • On parallel integer merging
  • Space-efficient parallel merging
  • Optimal merging and sorting on the EREW PRAM
  • Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention


zbMATH Keywords

Parallel algorithmsSortingMerging


Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)


Cites Work

  • Title not available (Why is that?)
  • Optimal parallel algorithms for computing convex hulls and for sorting
  • Title not available (Why is that?)
  • Merging sorted runs using large main memory
  • Space and time complexities of balanced sorting on processor arrays
  • Title not available (Why is that?)


Cited In (1)

  • Merging sorted runs using large main memory





This page was built for publication: Perfectly overlapped merging and sorting on a two-way linear array

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:673341&oldid=12576788"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:21. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki