Effect of parallelism on the efficiency of binary tree search.

MaRDI QIDQ3166461zbMATH OpenFDO

Authors Sarmad Abbasi

Publication date 12 October 2012

Mathematics Subject Classification ID

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

Recommendations

• On Parallel Searching
• scientific article; zbMATH DE number 1043915
• A generalization of binary search
• Deterministic parallel backtrack search
• Parallel searching of multidimensional cubes

Cited in

(2)

• Complexity of question/answer games
• Question/Answer Games on Towers and Pyramids

This page was built for publication: Effect of parallelism on the efficiency of binary tree search.

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