The Complexity of Systolic Dissemination of Information in Interconnection Networks
暂无分享,去创建一个
[1] Roger Labahn,et al. Periodic gossiping on trees , 1994, Discret. Appl. Math..
[2] Oscar H. Ibarra,et al. Characterizations and Computational Complexity of Systolic Trellis Automata , 1984, Theor. Comput. Sci..
[3] Dana S. Richards,et al. An Introduction to Perpetual Gossiping , 1993, ISAAC.
[4] H. T. Kung. Let's Design Algorithms for VLSI Systems , 1979 .
[5] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[6] Arto Salomaa,et al. Systolic trellis automatat , 1984 .
[7] Juraj Hromkovic,et al. Optimal Algorithms for Disemination of Information in Generalized Communication Modes , 1992, PARLE.
[8] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .
[9] Juraj Hromkovic,et al. Note on Optimal Gossiping in Some Weak-Connected Graphs , 1994, Theor. Comput. Sci..
[10] S. Louis Hakimi,et al. Parallel Algorithms for Gossiping by Mail , 1990, Inf. Process. Lett..
[11] Derick Wood,et al. Systolic Tree Acceptors , 1984, RAIRO Theor. Informatics Appl..
[12] Dana S. Richards,et al. Network Communication in Edge-Colored Graphs: Gossiping , 1993, IEEE Trans. Parallel Distributed Syst..
[13] Oscar H. Ibarra,et al. Sequential Machine Characterizations of Trellis and Cellular Automata and Applications , 1985, SIAM J. Comput..
[14] Oscar H. Ibarra,et al. Fast Parallel Language Recognition by Cellular Automata , 1985, Theor. Comput. Sci..