On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors

DOI10.1016/0020-0190(88)90165-2zbMath0658.68050OpenAlexW2035232924MaRDI QIDQ1111382

Frank Dehne, Ivan Stojmenović

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90165-2

zbMATH Keywords

parallel algorithmcomputational geometryECDF searchingmesh-of-processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (1)

Parallel general prefix computations with geometric, algebraic, and other applications

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Maintenance of configurations in the plane
• On the equivalence of some rectangle problems
• Sorting on a mesh-connected parallel computer
• Mesh computer algorithms for computational geometry

This page was built for publication: On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors