Unbounded and bounded parallelism in BMF. Case-study: rank sorting

MaRDI QIDQ5309484zbMATH OpenFDO

Authors Virginia Niculescu

Publication date 9 October 2007

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• The bulk-synchronous parallel random access machine
• scientific article; zbMATH DE number 1066848
• Direct bulk-synchronous parallel algorithms
• scientific article; zbMATH DE number 960172
• scientific article; zbMATH DE number 2009834

This page was built for publication: Unbounded and bounded parallelism in BMF. Case-study: rank sorting

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