Time-space optimal parallel merging and sorting

DOI10.1109/12.88483MaRDI QIDQ5375398zbMATH OpenOpenAlexFDO

Authors Xiaojun Guan, Michael A. Langston

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.88483

Mathematics Subject Classification ID

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

Cited in

(7)

• Stable unmerging in linear time and constant space
• Stable set and multiset operations in optimal time and space
• Efficient splitting and merging algorithms for order decomposable problems.
• Space-efficient parallel merging
• A time-space optimal parallel sorting on a hypercube
• scientific article; zbMATH DE number 4114045 (Why is no real title available?)
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention

This page was built for publication: Time-space optimal parallel merging and sorting

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