New Parallel-Sorting Schemes

DOI10.1109/TC.1978.1675167zbMath0379.68025MaRDI QIDQ4158470

Franco P. Preparata

Publication date: 1978

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (25)

A VLSI algorithm for sorting variable-length character strings ⋮ Routing, merging, and sorting on parallel models of computation ⋮ An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs ⋮ The constrained minimum spanning tree problem ⋮ Parallel parsing of programming languages ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ Optimal parallel algorithms for computing convex hulls and for sorting ⋮ Parametric search made practical ⋮ Parallel computations on graphs ⋮ Conservative algorithms for parallel and sequential integer sorting ⋮ The design and analysis of a new hybrid sorting algorithm ⋮ A constant-time parallel algorithm for computing convex hulls ⋮ Parallel breadth-first search algorithms for trees and graphs ⋮ Unnamed Item ⋮ Resource bounds for parallel computation of threshold and symmetric functions ⋮ A general class of resource tradeoffs ⋮ Linear sorting with O(log n) processors ⋮ Finding Least-Distances Lines ⋮ Parallel strong orientation of an undirected graph ⋮ A new parallel sorting algorithm based upon min-mid-max operations ⋮ A parallel search algorithm for directed acyclic graphs ⋮ A parallel-design distributed-implementation (PDDI) general-purpose computer ⋮ OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS ⋮ Space-efficient parallel merging

This page was built for publication: New Parallel-Sorting Schemes