An optimal synchronizer for the hypercube
暂无分享,去创建一个
[1] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.
[2] Danny Dolev,et al. A new look at fault tolerant network routing , 1984, STOC '84.
[3] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[4] Baruch Awerbuch,et al. Communication-time trade-offs in network synchronization , 1985, PODC '85.
[5] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[6] Baruch Awerbuch. Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization , 1985, Networks.
[7] Bernd Becker,et al. How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).