On computing an optimal permutation of ranks for multiselection

DOI10.1016/j.camwa.2010.07.040zbMath1205.90290OpenAlexW2057018832MaRDI QIDQ623154

Muhammad 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

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

Cites Work

• Unnamed Item
• Refined complexity analysis for heap operations
• Optimal parallel multiselection on EREW PRAM
• Time bounds for selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
• A random algorithm for multiselection

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