## A Polylog-Time and O ( n √ lg n )-Work Parallel Algorithm for Finding the Row Minima in Totally Monotone Matrices ∗

- Phillip G. Bradford, Rudolf Fleischer, Michiel Smid March
- 2013

Highly Influenced

@article{Atallah1991AnEP, title={An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix}, author={Mikhail J. Atallah and S. Rao Kosaraju}, journal={J. Algorithms}, year={1991}, volume={13}, pages={394-413} }

- Published 1991 in SODA
DOI:10.1016/0196-6774(92)90046-F

We give a parallel algorithm for the problem of computing the row minima of a totally monotone two-dimensionrd matrix. Whereas the previous best CREW-PRAM algorithm for this problem ran in O(log n log log n) time with O(n/ log log n) processors, our algorithm runs in O(log W) time with O(n) processors in the (weaker) EREW-PRAM model. Thus we simultaneously improve the time complexity without any deterioration in the time x processors product, even using a weaker model of parallel computation.

21 Extracted Citations

0 Extracted References

Similar Papers