Pages that link to "Item:Q911268"
From MaRDI portal
The following pages link to A simple randomized parallel algorithm for list-ranking (Q911268):
Displaying 14 items.
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
- Deterministic parallel list ranking (Q808699) (← links)
- A new family of randomized algorithms for list accessing (Q826088) (← links)
- Tight bounds on parallel list marking (Q1268796) (← links)
- One-by-one cleaning for practical parallel list ranking (Q1348937) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Faster optimal parallel prefix sums and list ranking (Q1825647) (← links)
- Deterministic coin tossing with applications to optimal parallel list ranking (Q3753489) (← links)
- (Q3798228) (← links)
- (Q4953331) (← links)
- Efficient list ranking on the reconfigurable mesh, with applications (Q6487452) (← links)
- Randomized parallel list ranking for distributed memory multiprocesors (Q6560349) (← links)