Pages that link to "Item:Q1125804"
From MaRDI portal
The following pages link to The complexity of parallel multisearch on coarse-grained machines (Q1125804):
Displaying 9 items.
- \(d\)-dimensional range search on multicomputers (Q1125801) (← links)
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model (Q1274330) (← links)
- Coarse-grained parallel geometric search (Q1291017) (← links)
- Multisearch techniques: Parallel data structures on mesh-connected computers (Q1328103) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Black-box Complexity of Parallel Search with Distributed Populations (Q2981878) (← links)
- The deterministic complexity of parallel multisearch (Q5054831) (← links)
- Анализ сложности алгоритма параллельного поиска “золотой” коллизии (Q5152407) (← links)
- Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model (Q6102288) (← links)