Further analysis of the remedian algorithm

DOI10.1016/j.tcs.2013.05.039zbMath1294.68068OpenAlexW1964316154MaRDI QIDQ391134

Micha Hofri, Domenico Cantone

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.039

zbMATH Keywords

probabilistic analysisasymptotic boundsapproximate algorithmsmedian selection problemremedian algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Approximation algorithms (68W25)

Uses Software

• QuickHeapsort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic distributions of the remedians
• QuickHeapsort, an efficient mix of classical sorting algorithms
• The Remedian: A Robust Averaging Method for Large Data Sets
• Average case selection
• Expected time bounds for selection
• Optimal selection and sorting via dynamic programming

This page was built for publication: Further analysis of the remedian algorithm