A faster parallel algorithm for a matrix searching problem

DOI10.1007/3-540-52846-6_89zbMATH Open1502.68355OpenAlexW1547233734MaRDI QIDQ5056103FDOQ5056103

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

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
• An efficient parallel algorithm for the row minima of a totally monotone matrix

Mathematics Subject Classification ID

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

Cites Work

• Parallelism in Comparison Problems
• Finding the maximum, merging, and sorting in a parallel computation model
• Efficient Parallel Algorithms for String Editing and Related Problems
• Parallel searching in generalized Monge arrays
• The Parallel Evaluation of General Arithmetic Expressions
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient parallel algorithm for shortest paths in planar layered digraphs
• Title not available (Why is that?)
• More Efficient Parallel Totally Monotone Matrix Searching
• A faster parallel algorithm for a matrix searching problem
• Title not available (Why is that?)

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)