Further analysis of the remedian algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3899488
- A Modified Remes Algorithm
- scientific article; zbMATH DE number 646755
- Modifications of the First Remez Algorithm
- Further analysis of minimum residual iterations
- Further study on a dual algorithm
- ElimLin algorithm revisited
- On the efficiency of algorithms of analysis
- scientific article; zbMATH DE number 2111762
Cites work
- scientific article; zbMATH DE number 1629859 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Average case selection
- Expected time bounds for selection
- Introduction to algorithms.
- Optimal selection and sorting via dynamic programming
- QuickHeapsort, an efficient mix of classical sorting algorithms
- The Remedian: A Robust Averaging Method for Large Data Sets
- The asymptotic distributions of the remedians
Cited in
(6)- The asymptotic distributions of the remedians
- Asymptotic properties of the remedian
- scientific article; zbMATH DE number 1629859 (Why is no real title available?)
- scientific article; zbMATH DE number 3899488 (Why is no real title available?)
- Modifications of the First Remez Algorithm
- The Remedian: A Robust Averaging Method for Large Data Sets
This page was built for publication: Further analysis of the remedian algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391134)