D.J. Evans, R.C Dunbar: The parallel quicksort algorithm part i–run time analysis. In: International Journal of Computer Mathematics. Band12, Nr.1, Januar 1982, ISSN0020-7160, S.19–55, doi:10.1080/00207168208803323.
Weixiong Zhang, Nageswara S. V. Rao: Optimal parallel quicksort on EREW PRAM. In: BIT. Band31, Nr.1, März 1991, ISSN0006-3835, S.69–74, doi:10.1007/bf01952784.
Luc Devroye: A note on the height of binary search trees. In: Journal of the ACM. Band33, Nr.3, 1. Mai 1986, ISSN0004-5411, S.489–498, doi:10.1145/5925.5930.
Richard Cole, Uzi Vishkin: Approximate and exact parallel scheduling with applications to list, tree and graph problems. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE, 1986, ISBN 0-8186-0740-8, doi:10.1109/sfcs.1986.10.
worldcat.org
Vishkin, U.: Synchronous parallel computation - a survey. Courant Institute of Mathematical Sciences, New York University, April 1983, OCLC1085604497.
Putze, Felix.: MCSTL: the multi-core standard template library. ACM, 2007, OCLC854741854.
zdb-katalog.de
D.J. Evans, R.C Dunbar: The parallel quicksort algorithm part i–run time analysis. In: International Journal of Computer Mathematics. Band12, Nr.1, Januar 1982, ISSN0020-7160, S.19–55, doi:10.1080/00207168208803323.
Weixiong Zhang, Nageswara S. V. Rao: Optimal parallel quicksort on EREW PRAM. In: BIT. Band31, Nr.1, März 1991, ISSN0006-3835, S.69–74, doi:10.1007/bf01952784.
Luc Devroye: A note on the height of binary search trees. In: Journal of the ACM. Band33, Nr.3, 1. Mai 1986, ISSN0004-5411, S.489–498, doi:10.1145/5925.5930.