Karl-Dietrich Neubert: The Flashsort Algorithm. In: Dr. Dobb's Journal. Februar 1998, S.123 (ddj.com [abgerufen am 6. November 2007]).
doi.org
John H. Reif und Leslie G. Valiant: A logarithmic time sort for linear size networks. In: Proceedings of the fifteenth annual ACM symposium on Theory of computing. 1983, S.10–16, doi:10.1145/800061.808727.
John H. Reif und Leslie G. Valiant: A logarithmic time sort for linear size networks. In: Journal of the ACM. Band34, Nr.1, 1987, S.60–76, doi:10.1145/7531.7532.
Li Xiao, Xiaodong Zhang, Stefan A. Kubricht: Cache-Effective Quicksort. In: Improving Memory Performance of Sorting Algorithms. Department of Computer Science, College of William and Mary, Williamsburg, VA 23187-8795, archiviert vom Original am 2. November 2007; abgerufen am 6. November 2007.
web.archive.org
Li Xiao, Xiaodong Zhang, Stefan A. Kubricht: Cache-Effective Quicksort. In: Improving Memory Performance of Sorting Algorithms. Department of Computer Science, College of William and Mary, Williamsburg, VA 23187-8795, archiviert vom Original am 2. November 2007; abgerufen am 6. November 2007.