Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A faster parallel algorithm for a matrix searching problem

From MaRDI portal
Publication:1206437
Jump to:navigation, search

DOI10.1007/BF01188710zbMath0766.68047OpenAlexW2016442119MaRDI QIDQ1206437

Mikhail J. Atallah

Publication date: 1 April 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01188710


zbMATH Keywords

CRCW-PRAMmonotone matricesmatrix searching problemtube minima


Mathematics Subject Classification ID

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





Cites Work

  • Unnamed Item
  • Efficient Parallel Algorithms for String Editing and Related Problems
  • Finding the maximum, merging, and sorting in a parallel computation model
  • Parallelism in Comparison Problems
  • The Parallel Evaluation of General Arithmetic Expressions




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1206437&oldid=13275853"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki