Author:
Hardavellas Nikos,Karakos Damianos,Mavronicolas Marios
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. E. Aharonson and H. Attiya, “Counting Networks with Arbitrary Fan-Out,” in Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 104–113, January 1992.
2. M. Ajtai, J. Komlos and E. Szemeredi, “Halvers and Expanders,” in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 686–692, October 1992.
3. J. Aspnes, M. Herlihy and N. Shavit, “Counting Networks and Multi-Processor Coordination,” in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348–358, May 1991. Expanded version: “Counting Networks,” Technical Memo MIT/LCS/TM-451, Laboratory of Computer Science, MIT, June 1991.
4. K. E. Batcher, “Sorting Networks and their Applications,” in Proceedings of AFIPS Joint Computer Conference, 32, pp. 338–334, 1968.
5. R. Becker, D. Nassimi and Y. Perl, “The New Class of g-Chain Periodic Sorters,” in Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1993.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献