Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/12180
Title: | An O(√n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors | Authors: | Dehne F. Stojmenovic I. |
Issue Date: | 24-Jun-1988 | Journal: | Information Processing Letters | Abstract: | Dehne (1986) presented an optimal O(√n) time parallel algorithm for solving the ECDF searching problem for a set of n points in two- and three-dimensional space on a mesh-of-processors of size n. However, it remained an open problem whether such an optimal solution exists for the d-dimensional ECDF searching problem for d≥4. In this paper we solve this problem by presenting an optimal O(√n) time parallel solution to the d-dimensional ECDF searching problem for arbitrary dimension d = O(1) on a mesh-of-processors of size n. The algorithm has several interesting implications. Among others, the following problems can now be solved on a mesh-of-processors in (asymptotically optimal) time O(√n) for arbitrary dimension d = O(1): the d-dimensional maximal element determination problem, the d-dimensional hypercube containment counting problem, and the d-dimensional hypercube intersection counting problem. The latter two problems can be mapped to the 2d-dimensional ECDF searching problem but require an efficient solution to this problem for at least d≥4. © 1988. | URI: | https://open.uns.ac.rs/handle/123456789/12180 | ISSN: | 00200190 | DOI: | 10.1016/0020-0190(88)90165-2 |
Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
SCOPUSTM
Citations
3
checked on Aug 12, 2023
Page view(s)
28
Last Week
0
0
Last month
0
0
checked on Mar 15, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.