d-dimensional range search on multicomputers

DOI10.1007/PL00008260zbMATH Open0943.68186OpenAlexW2153781052MaRDI QIDQ1125801FDOQ1125801

Authors: S. H. Smith 

Publication date: 3 January 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008260

Recommendations

• Range search in parallel using distributed data structures
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• Multisearch techniques: Parallel data structures on mesh-connected computers

zbMATH Keywords

range tree

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (9)

• The deterministic complexity of parallel multisearch
• Computational Science – ICCS 2005
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• Multisearch techniques: Parallel data structures on mesh-connected computers
• An architecture independent study of parallel segment trees
• Parallel range, segment and rectangle queries with augmented maps
• On k-d Range Search with Patricia Tries
• Range search in parallel using distributed data structures
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors

This page was built for publication: \(d\)-dimensional range search on multicomputers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125801)