Pages that link to "Item:Q1125801"
From MaRDI portal
The following pages link to \(d\)-dimensional range search on multicomputers (Q1125801):
Displaying 10 items.
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Distributed searching of multi-dimensional data: A performance evaluation study (Q1130324) (← links)
- Range search in parallel using distributed data structures (Q1200138) (← links)
- Coarse-grained parallel geometric search (Q1291017) (← links)
- Multisearch techniques: Parallel data structures on mesh-connected computers (Q1328103) (← links)
- An architecture independent study of parallel segment trees (Q2465994) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- On <i>k</i>-d Range Search with Patricia Tries (Q3532568) (← links)
- The deterministic complexity of parallel multisearch (Q5054831) (← links)
- Computational Science – ICCS 2005 (Q5709498) (← links)