More Efficient Parallel Totally Monotone Matrix Searching

DOI10.1006/JAGM.1996.0824MaRDI QIDQ4339010zbMATH OpenOpenAlexFDO

Authors Phillip G. Bradford, Rudolf Fleischer

Publication date 10 November 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0824

zbMATH Keywords

CREW PRAMEREW PRAMCRCW PRAM

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• A faster parallel algorithm for a matrix searching problem
• A faster parallel algorithm for a matrix searching problem
• Parallel searching in generalized Monge arrays
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• scientific article; zbMATH DE number 1003294
• On parallel selection and searching in partial orders: Sorted matrices
• Parallel searching on \(m\) rays
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• scientific article; zbMATH DE number 4009643
• Parallel searching of multidimensional cubes

Cited in

(11)

• A faster parallel algorithm for a matrix searching problem
• scientific article; zbMATH DE number 2102769 (Why is no real title available?)
• An efficient parallel algorithm for the row minima of a totally monotone matrix
• Parallel searching in generalized Monge arrays
• Packing two disks in a polygon
• Geometric applications of a matrix-searching algorithm
• Superlinear bounds for matrix searching problems
• scientific article; zbMATH DE number 1003294 (Why is no real title available?)
• A faster parallel algorithm for a matrix searching problem
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• scientific article; zbMATH DE number 512895 (Why is no real title available?)

This page was built for publication: More Efficient Parallel Totally Monotone Matrix Searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339010)