Pages that link to "Item:Q3949979"
From MaRDI portal
The following pages link to Parallel permutation and sorting algorithms and a new generalized connection network (Q3949979):
Displayed 19 items.
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- On some connections between permutations and coding (Q1068049) (← links)
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201) (← links)
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers (Q1317489) (← links)
- Divide-and-conquer algorithms on the hypercube (Q1365934) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- A randomized sorting algorithm on the BSP model (Q2931927) (← links)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- A Parallel Algorithm for Cost-Optimal Generation of Permutations of<i>r</i>out of<i>n</i>Items (Q3792260) (← links)
- Efficient enumeration of cyclic permutations in situ (Q3826556) (← links)
- TIME-OPTIMAL GEOMETRIC ALGORITHMS IN HYPERCUBIC NETWORKS (Q4820046) (← links)
- Direct bulk-synchronous parallel algorithms (Q5056124) (← links)