Author:
Brodal Gerth Stølting,Pinotti M. Cristina
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Miklós Ajtai, János Komlós, and Endre Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3:1–19, 1983.
2. Vladimir Evgen'evich Alekseev. Sorting algorithms with minimum memory. Kibernetika, 5(5):99–103, 1969.
3. Samuel W. Bent and John W. John. Finding the median requires 2n comparisons. In Proc. 17th Ann. ACM Symp. on Theory of Computing (STOC), pages 213–216, 1985.
4. Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert Endre Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1973.
5. Paul F. Dietz. Heap construction in the parallel comparison tree model. In Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT), volume 621 of Lecture Notes in Computer Science, pages 140–150. Springer Verlag, Berlin, 1992.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献