The following pages link to Fast parallel sorting algorithms (Q4162670):
Displaying 17 items.
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- A parallel selection algorithm (Q798002) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- A VLSI algorithm for sorting variable-length character strings (Q1079374) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Parallel iterated bucket sort (Q1263965) (← links)
- A parallel algorithm for generating combinations (Q1825043) (← 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)
- Parallelization alternatives and their performance for the convex hull problem (Q2504444) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- Parallel algorithms for a depth first search and a breadth first search (Q3802639) (← links)
