Selection by distributive partitioning

DOI10.1016/0020-0190(80)90023-XzbMath0444.68051OpenAlexW2061064486MaRDI QIDQ1144936

D. C. S. Allison, M. T. Noga

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90023-x

zbMATH Keywords

selectiondistributive partitioning

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Usort: An efficient hybrid of distributive partitioning sorting ⋮ GPU accelerated greedy algorithms for compressed sensing

Uses Software

• Find
• Algorithm 489

Cites Work

• Finding the median
• Sorting by distributive partitioning
• Time bounds for selection
• Expected time bounds for selection

This page was built for publication: Selection by distributive partitioning