On computing an optimal permutation of ranks for multiselection

DOI10.1016/J.CAMWA.2010.07.040MaRDI QIDQ623154zbMATH OpenOpenAlexFDO

Authors M. H. Alsuwaiyel

Publication date 13 February 2011

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2010.07.040

zbMATH Keywords

algorithmsdynamic programmingselectionmultiselection

Mathematics Subject Classification ID

Dynamic programming (90C39) Searching and sorting (68P10)

Recommendations

• Automata, Languages and Programming
• An optimal parallel algorithm for the multiselection problem
• A random algorithm for multiselection
• Optimal parallel multiselection on EREW PRAM
• Optimal selection and sorting via dynamic programming

Cites work

• scientific article; zbMATH DE number 1444292 (Why is no real title available?)
• A Unified Lower Bound for Selection and Set Partitioning Problems
• A random algorithm for multiselection
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
• Optimal parallel multiselection on EREW PRAM
• Refined complexity analysis for heap operations
• Time bounds for selection

Cited in

(7)

• A random algorithm for multiselection
• scientific article; zbMATH DE number 6691960 (Why is no real title available?)
• Comments on ``Performance analysis for ordered selection combining schemes in Nakagami-m environments
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
• Automata, Languages and Programming
• A rank-based approach to the sequential selection and assignment problem
• Optimal permutation estimation in crowdsourcing problems

This page was built for publication: On computing an optimal permutation of ranks for multiselection

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