Pages that link to "Item:Q5054831"
From MaRDI portal
The following pages link to The deterministic complexity of parallel multisearch (Q5054831):
Displaying 5 items.
- The complexity of parallel multisearch on coarse-grained machines (Q1125804) (← links)
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (Q1274330) (← links)
- Black-box Complexity of Parallel Search with Distributed Populations (Q2981878) (← links)
- Анализ сложности алгоритма параллельного поиска “золотой” коллизии (Q5152407) (← links)
- Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model (Q6102288) (← links)