Pages that link to "Item:Q1923863"
From MaRDI portal
The following pages link to Efficient PRAM simulation on a distributed memory machine (Q1923863):
Displayed 11 items.
- Balls into bins with related random choices (Q433413) (← links)
- Thinning protocols for routing \(h\)-relations over shared media (Q666178) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- Practical load balancing for content requests in peer-to-peer networks (Q2375306) (← links)
- Randomized allocation processes (Q2746211) (← links)
- Two-way chaining for non-uniform distributions (Q5852152) (← links)