Some Bounded Degree Communication Networks and Optimal Leader Election

[1]  Dhiraj K. Pradhan.  On a Class of Fault-Tolerant Multiprocessor Network Architectures , 1982, ICDCS.

[2]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[3]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[4]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[5]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[6]  Marvin H. Solomon,et al.  Dense Trivalent Graphs for Processor Interconnection , 1982, IEEE Transactions on Computers.

[7]  F. Thomson Leighton,et al.  ARRAYS AND TREES , 1992 .

[8]  Dhiraj K. Pradhan,et al.  Fault-Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties) , 1989, Reliability Of Computer And Communication Networks.

[9]  Dhiraj K. Pradhan,et al.  The Hyper-deBruijn Networks: Scalable Versatile Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Arunabha Sen,et al.  On Fault-Tolerant Distributor Communication Architecture , 1986, IEEE Transactions on Computers.

[11]  Sajal K. Das,et al.  Dynamic embeddings of trees and quasi-grids into hyper-de Bruijn networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[12]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[13]  Pradip K. Srimani,et al.  A New Family of Cayley Graph Interconnection Networks of Constant Degree Four , 1996, IEEE Trans. Parallel Distributed Syst..

[14]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[15]  Shahram Latifi,et al.  The Star Connected Cycles: A Fixed-Degree Network For Parallel Processing , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[16]  Isaac D. Scherson,et al.  Orthogonal Graphs for the Construction of a Class of Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[17]  C. Loui Michael,et al.  Election in a complete network with a sense of direction , 1986 .

[18]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[19]  Nicola Santoro.  Sense of direction, topological awareness and communication complexity , 1984, SIGA.

[20]  Gerard Tel.  Linear Election in Hypercubes , 1995, Parallel Process. Lett..

[21]  Denis A. Nicole,et al.  Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network , 1993, IEEE Trans. Parallel Distributed Syst..

[22]  Dharma P. Agrawal,et al.  dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout , 1993, IEEE Trans. Parallel Distributed Syst..

[23]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[24]  Hans L. Bodlaender,et al.  New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors , 1991, Theor. Comput. Sci..

[25]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[26]  K. Wendy Tang,et al.  Representations and routing for Cayley graphs [computer networks] , 1991, IEEE Trans. Commun..

[27]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[28]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[29]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[30]  Selim G. Akl,et al.  Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..