Author:
Cole Richard,Salowe Jeffrey,Steiger W. L.,Szemerédi Endre
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Ajtai, M., Komlós, J., and Szemerédi, E. "Sorting in cLogn Parallel Steps". Combinatorica 3 (1983), 1–19.
2. Bentley, J.L. and Ottmann, Th. "Algorithms for Reporting and Counting Geometric Intersections". IEEE Trans. on Computers C 28 (1979), 643–647.
3. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., and Tarjan, R.E. "Time Bounds for Selection". JCSS 7 (1973), 448–461.
4. Chazelle, B. "New Techniques for Computing Order Statistics in Euclidean Space". Proc. ACM Symposium on Comp. Geom. (1985), 125–134.
5. Cole, R. "Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms". JACM 31 (1984), 200–208.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Selecting the Kth largest-area convex polygon;Lecture Notes in Computer Science;1989
2. Parallel Merge Sort;SIAM Journal on Computing;1988-08