PARALLEL BINARY SEARCH WITH DELAYED READ CONFLICTS

DOI10.1142/S0129053390000030zbMATH Open0726.68038OpenAlexW2087303180MaRDI QIDQ3348417FDOQ3348417

Authors: Selim G. Akl, Henk Meijer 

Publication date: 1990

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129053390000030

Recommendations

• Parallel multiple search
• On Parallel Searching
• On parallel selection and searching in partial orders: Sorted matrices
• Parallel algorithms for merging and sorting
• Optimal algorithms for generalized searching in sorted matrices

zbMATH Keywords

binary searchread conflicts

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Cited In (3)

• Parallel multiple search
• A Binary Search with a Parallel Recovery of the Bits
• Title not available (Why is that?)

This page was built for publication: PARALLEL BINARY SEARCH WITH DELAYED READ CONFLICTS

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