A faster parallel algorithm for a matrix searching problem

DOI10.1007/3-540-52846-6_89MaRDI QIDQ5056103zbMATH OpenOpenAlexFDO

Authors Mikhail J. Atallah

Publication date 9 December 2022

Published in SWAT 90 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52846-6_89

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• A faster parallel algorithm for a matrix searching problem
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
• More Efficient Parallel Totally Monotone Matrix Searching
• scientific article; zbMATH DE number 1003294
• An efficient parallel algorithm for the row minima of a totally monotone matrix

Cites work

• Efficient Parallel Algorithms for String Editing and Related Problems
• Finding the maximum, merging, and sorting in a parallel computation model
• scientific article; zbMATH DE number 432842 (Why is no real title available?)
• Parallel searching in generalized Monge arrays
• Parallelism in Comparison Problems
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(7)

• A faster parallel algorithm for a matrix searching problem
• scientific article; zbMATH DE number 5670033 (Why is no real title available?)
• scientific article; zbMATH DE number 512895 (Why is no real title available?)
• More Efficient Parallel Totally Monotone Matrix Searching
• scientific article; zbMATH DE number 2102769 (Why is no real title available?)
• scientific article; zbMATH DE number 6796233 (Why is no real title available?)
• An efficient parallel algorithm for shortest paths in planar layered digraphs

This page was built for publication: A faster parallel algorithm for a matrix searching problem

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