Pages that link to "Item:Q4146248"
From MaRDI portal
The following pages link to Optimal Sorting Algorithms for Parallel Computers (Q4146248):
Displayed 17 items.
- The complexity of deterministic PRAM simulation on distributed memory machines (Q679435) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- k-fold bitonic sort on a mesh-connected parallel computer (Q1065549) (← links)
- A VLSI algorithm for sorting variable-length character strings (Q1079374) (← links)
- On mapping processes to processors in distributed systems (Q1095652) (← links)
- Systolic processing for dynamic programming problems (Q1099090) (← links)
- A parallel merging algorithm (Q1157905) (← links)
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays (Q1176071) (← links)
- A note on the token distribution problem (Q1178250) (← links)
- Efficient algorithms for parallel sorting on mesh multicomputers (Q1193763) (← links)
- Parallel merging sorting using comparison matrices. I (Q1905191) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- The parallel odd-even merge algorithm (Q3802635) (← links)
- A time-space optimal parallel sorting on a hypercube (Q4229564) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)