Author:
Brodal Gerth Støting,Pinotti M.Cristina
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Sorting in clog n parallel steps;Ajtai;Combinatorica,1983
2. Sorting algorithms with minimum memory;Alekseyev;Kibernetika,1969
3. S.W. Bent, J.W. John, Finding the median requires 2n comparisons, Proc. 17th Ann. ACM Symp. on Theory of Computing (STOC), 1985, pp. 213–216.
4. Time bounds for selection;Blum;J. Comput. System Sci.,1973
5. P.F. Dietz, Heap construction in the parallel comparison tree model, Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science, vol. 621, Springer, Berlin, 1992, pp. 140–150.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献