Author:
Hromkovič J.,Loryś K.,Kanarek P.,Klasing R.,Unger W.,Wagener H.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. M. Ajtai, J. Komlós, E. Szemerédi, An O(n log n) sorting network. Proc. 15th ACM Symposium on Theory of Computing, pp. 1–9, 1983.
2. V. Beneš, “Permutation groups, complexes, and rearrangeable multistage Connecting networks”, Bell System Technical Journal, vol. 43, pp. 1619–1640, 1964.
3. V. Beneš, “Mathematical Theory of Connecting Networks and Telephone Traffic”, Academic Press, New York, NY, 1965.
4. R. Cypher, C.G. Plaxton: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. Journal of Computer and System Sciences, No. 47, 1993, pp. 501–548.
5. M. Cutler, Y. Shiloach: Permutation layout. Networks, vol. 8 (1978) 253–278.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献