1. D. P. Agrawal. Graph theoretical analysis and design of multistate interconnection networks. IEEE Trans. Computers, C-32(7):637–648, 1983.
2. P. J. Bernhard and D. J. Rosenkrantz. The complexity of routing through an omega network. In Proc. Twenty-Fifth Annual Allerton Conf. on Communication, Control and Computing, 1987. Also Appears as a Technical Report: Comput. Sci. Dept., SUNY Albany, Albany, N.Y., TR 87-12, 1987.
3. P. J. Bernhard and D. J. Rosenkrantz. Algebraic structure of mask-representable address sets and message patterns. Technical Report, Comput. Sci. Dept., Clemson University, Clemson, SC, 1990.
4. P. J. Bernhard, H. B. Hunt III, and D. J.Rosenkrantz. Compaction of message patterns into space-efficient representations for multiprocessor interconnection networks. In Proc. of 1989 Int. Conf. on Parallel Processing, volume I, pages 111–115. Pennsylvania State Univ., University Park, 1989.
5. J. S. Deogun and Z. Fang. A heuristic algorithm for conflict resolution problem in multistage interconnection networks. In Proc. of 1988 Int. Conf. on Parallel Processing, pages 475–478. Pennsylvania State Univ., University Park, 1988.