Equivalence of Structural Knowledges in Distributed Algorithms
暂无分享,去创建一个
[1] Sebastiano Vigna,et al. Computing anonymously with arbitrary knowledge , 1999, PODC '99.
[2] Valmir Carneiro Barbosa,et al. An introduction to distributed algorithms , 1996 .
[3] Boleslaw K. Szymanski,et al. Terminating iterative solution of simultaneous equations in distributed message passing systems , 1985, PODC '85.
[4] Yves Métivier,et al. A Characterization of Families of Graphs in Which Election Is Possible , 2002, FoSSaCS.
[5] Hubert Comon,et al. Tree automata techniques and applications , 1997 .
[6] Anca Muscholl,et al. About the local detection of termination of local computations in graphs , 1997, SIROCCO.
[7] Naoshi Sakamoto,et al. Comparison of initial conditions for distributed algorithms on anonymous networks , 1999, PODC '99.
[8] Antoni W. Mazurkiewicz. Distributed Enumeration , 1997, Inf. Process. Lett..
[9] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[10] Yves Métivier,et al. Termination detection and universal graph reconstruction , 2000, SIROCCO.
[11] Masafumi Yamashita,et al. Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..