Author:
Hamada Yukihiro,Mei Aohan,Nishitani Yasuaki,Igarashi Yoshihide
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. B. Aiello and F. T. Leighton, “Coding theory, hypercube embedding, and fault tolerance”, The 3rd Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 125–136, 1991.
2. N. Alon, A. Barak and U. Mauber, “On disseminating information reliably without broadcasting”, The 7th International Conference on Distributed Computing Systems, pp. 74–81, 1987.
3. T. Altman, Y. Igarashi and K. Obokata, “Hyper-ring connection machines”, IEEE Region 10's 9th Annual International Conference, Vol. 1, pp. 290–294, 1994.
4. S. N. Bhatt and J-Y. Cai, “Take a walk, grow a tree”, The 29th Annual Symp. on Foundations of Computer Science, pp. 469–478, 1988.
5. S. N. Bhatt, F. R. K. Chung, J-W. Hong, F. T. Leighton and A. L. Rosenberg, “Optimal simulation by butterfly networks”, The 20th Annual ACM Symp. on Theory of Computing, pp. 192–204, 1988.