Author:
SADO Kazuhiro,IGARASHI Yoshihide
Reference17 articles.
1. Ajtai, M., Komlos, J., and Szemeredi, E., “An O(N log N) sorting network”, Proc. 15th Annual ACM Symp. on Theory of Computing, pp. 1–9, May 1983.
2. Parallel sorting algorithms;Akl,1985
3. Batcher, K. E., “Sorting networks and their applications”, Proc. AFIPS Spring Joint Computer Conf., 32, pp. 307–314, 1968.
4. Bilardi, G., and Preparata, F., “A minimum area VLSI architecture for O(log N) time sorting”, Proc. 16th Annual ACM Symp. on Theory of Computing, pp. 64–70, May 1984.
5. “A taxonomy of parallel sorting”;Bitton;ACM Computing Survey,1984