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)

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

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)