Pages that link to "Item:Q3219774"
From MaRDI portal
The following pages link to Tight Bounds on the Complexity of Parallel Sorting (Q3219774):
Displaying 39 items.
- A note on adaptive parallel sorting (Q582114) (← links)
- Constructing sorting networks from k-sorters (Q582119) (← links)
- The complexity of deterministic PRAM simulation on distributed memory machines (Q679435) (← links)
- Improved upper bounds on Shellsort (Q1069307) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- An optimal speed-up parallel algorithm for triangulating simplicial point sets in space (Q1100900) (← links)
- Sorting in constant number of row and column phases on a mesh (Q1105380) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618) (← links)
- An efficient parallel algorithm for random sampling (Q1116335) (← links)
- Sorting in rounds (Q1117700) (← links)
- Real-time emulations of bounded-degree networks (Q1128816) (← links)
- A note on the token distribution problem (Q1178250) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- An efficient multiway merging algorithm (Q1286689) (← links)
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers (Q1317489) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Algorithms for parallel memory, I: Two-level memories (Q1333432) (← links)
- Parallel integer sorting using small operations (Q1346223) (← links)
- Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
- Sloping-and-shaking (Q1367257) (← links)
- Improved bounds for integer sorting in the EREW PRAM model (Q1392302) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- Periodic comparator networks (Q1575741) (← links)
- A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
- Peculiarities of the parallel sorting algorithm with rank formation (Q2132074) (← links)
- Space and time complexities of balanced sorting on processor arrays (Q2639641) (← links)
- A randomized sorting algorithm on the BSP model (Q2931927) (← links)
- Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems (Q4210138) (← links)
- Area efficient layouts of the Batcher sorting networks (Q4537608) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ (Q4820143) (← links)
- SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS (Q4820152) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- Towards a better understanding of pure packet routing (Q5060094) (← links)
- Oblivious parallel tight compaction (Q6059370) (← links)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes (Q6102292) (← links)
- More Efficient Parallel Integer Sorting (Q6114876) (← links)
- Recursively divisible problems (Q6487438) (← links)
