An O(√n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- 24 June 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (2) , 67-70
- https://doi.org/10.1016/0020-0190(88)90165-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computerInformation Processing Letters, 1986
- On the equivalence of some rectangle problemsInformation Processing Letters, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977