Author:
Krizanc Danny,Rajasekaran Sanguthevar
Reference86 articles.
1. A. Aggarwal and C. G. Plaxton, Optimal Parallel Sorting in Multi-Level Storage, Proc. Fifth Annual ACM Symposium on Discrete Algorithms, 1994, pp. 659–668.
2. A. Aggarwal and J. S. Vitter, The Input/Output Complexity of Sorting and Related Problems, Communications of the ACM 31 (9), 1988, pp. 1116–1127.
3. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974.
4. M. Ajtai, J. Komlós and E. Szemerédi, An O (n log n) Sorting Network, Proc. 15th ACM Symposium on Theory of Computing, 1983, pp. 1–9.
5. M. Ajtai, J. Komlós, W. Steiger, and E. Szemerédi, Optimal Parallel Selection Has Complexity O (log log n), Journal of Computer and System Science, 38, 1989, pp. 125–133.