Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. M.J. Atallah, S.R. Kosaraju: An efficient parallel algorithm for the row minima of a totally monotone matrix, J. of Algorithms 13 (1992), 394–413
2. P.G.Bradford, R.Fleischer, M.Smid: A polylog-time and O(n√log n)-work parallel algorithm for finding the row minima in totally monotone matrices, 1995, submitted
3. P.Damaschke: Line segmentation of digital curves in parallel, 12th Symposium on Theoretical Aspects of Computer Science STACS'95, Munich 1995, LNCS 900, Springer 1995, 539–549
4. P.Damaschke: An optimal parallel algorithm for digital curve segmentation using Hough polygons and monotone function search, 3rd European Symposium on Algorithms ESA '95, Corfu (Greece) 1995
5. F. Gao, L.J. Guibas, D.G. Kirkpatrick, W.T. Laaser, J. Saxe: Finding extrema with unary predicates, Algorithmica 9 (1993), 591–600