An efficient algorithm for row minima computations on basicreconfigurable meshes |
| |
Authors: | Nakano K Olariu S |
| |
Affiliation: | Dept. of Electr. Eng. & Comput. Sci., Nagoya Inst. of Technol.; |
| |
Abstract: | A matrix A of size m×n containing items from a totally ordered universe is termed monotone if, for every i, j, 1⩽i2. In case m=nϵ for some constant ϵ, (0<ϵ⩽1), our algorithm runs in O(log log n) time |
| |
Keywords: | |
|
|