EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*

DOI10.1080/01495730108935276zbMath0981.68182OpenAlexW2038097058MaRDI QIDQ2755583

Amitava Datta

Publication date: 11 November 2001

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495730108935276

zbMATH Keywords

range tree data structure

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Diameter partitioning
• Parallel computational geometry of rectangles
• Finding tailored partitions
• Parallel Merge Sort
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• On the rectangularp-center problem

This page was built for publication: EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*