An efficient algorithm for row minima computations on basic reconfigurable meshes

A matrix A of size m/spl times/n containing items from a totally ordered universe is termed monotone if, for every i, j, 1/spl les/i2. In case m=n/sup /spl epsiv// for some constant /spl epsiv/, (0