The following pages link to New Parallel-Sorting Schemes (Q4158470):
Displaying 25 items.
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Parametric search made practical (Q598230) (← links)
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- A VLSI algorithm for sorting variable-length character strings (Q1079374) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- Parallel parsing of programming languages (Q1094886) (← links)
- The design and analysis of a new hybrid sorting algorithm (Q1146524) (← links)
- A constant-time parallel algorithm for computing convex hulls (Q1162818) (← links)
- A general class of resource tradeoffs (Q1837531) (← links)
- Linear sorting with O(log n) processors (Q1838307) (← links)
- A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- Parallel breadth-first search algorithms for trees and graphs (Q3318124) (← links)
- Finding Least-Distances Lines (Q3665109) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
- The constrained minimum spanning tree problem (Q5054807) (← links)
- (Q5089305) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
