Efficient sorting during repetitive statistical computations: Algorithms and an application
From MaRDI portal
Publication:804105
Recommendations
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 3776820 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- A Robust Alternative Based on Ranks to Least Squares in Analyzing Linear Models
- A new upper bound for Shellsort
- Algorithms and complexity for least median of squares regression
- Estimates of the Regression Coefficient Based on Kendall's Tau
- Estimating Regression Coefficients by Minimizing the Dispersion of the Residuals
- Implementing Quicksort programs
- Numerical Methods for Robust Regression: Linear Models
- Rank based robust analysis of linear models. I: Exposition and review. With comments and a rejoinder by the author
- The Resistant Line and Related Regression Methods
Cited in
(1)
This page was built for publication: Efficient sorting during repetitive statistical computations: Algorithms and an application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804105)