New Parallel-Sorting Schemes

DOI10.1109/TC.1978.1675167MaRDI QIDQ4158470zbMATH OpenFDO

Authors F. 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)

Cited in

(25)

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

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

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