1. Time bounds for selection;Blum;Journal of Computer and System Sciences,1973
2. Introduction to algorithms, third edition;Cormen,2009
3. Time-efficient algorithms for two highly robust estimators of scale;Croux,1992
4. Maintaining stream statistics over sliding windows: (extended abstract);Datar,2002
5. Donoho, D. L., & Huber, P. J. (1983). The notion of breakdown point. In P. J. Bickel, K. Doksum and J. L. Hodges, Jr., (Eds.) A festschrift for Erich Lehmann (pp. 157–184). Wadsworth, Belmont, CA.