Pages that link to "Item:Q913512"
From MaRDI portal
The following pages link to A complexity theory of efficient parallel algorithms (Q913512):
Displayed 17 items.
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Efficient sampling of random permutations (Q954966) (← links)
- Parallel merging with restriction (Q1009355) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Parallel algorithms for certain matrix computations (Q1390874) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- Parallel local search (Q1922627) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Division in logspace-uniform<i>NC</i><sup>1</sup> (Q2773023) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ † (Q4819986) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)