More Efficient Parallel Totally Monotone Matrix Searching
From MaRDI portal
Publication:4339010
DOI10.1006/JAGM.1996.0824zbMATH Open0874.68139OpenAlexW2074081483MaRDI QIDQ4339010FDOQ4339010
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
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
- 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)
- Packing two disks in a polygon
- A faster parallel algorithm for a matrix searching problem
- Title not available (Why is that?)
- Geometric applications of a matrix-searching algorithm
- An Almost Linear Time Algorithm for Generalized Matrix Searching
- Parallel searching in generalized Monge arrays
- Title not available (Why is that?)
- An efficient parallel algorithm for the row minima of a totally monotone matrix
- A faster parallel algorithm for a matrix searching problem
- Title not available (Why is that?)
- Superlinear bounds for matrix searching problems
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)
