메뉴 건너뛰기




Volumn 5218 LNCS, Issue , 2008, Pages 47-62

Local terminations and distributed computability in anonymous networks

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS NETWORKS; DISTRIBUTED ALGORITHMS; DISTRIBUTED TASKS; POLYNOMIAL ALGORITHMS;

EID: 56449112765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87779-0_4     Document Type: Conference Paper
Times cited : (19)

References (23)
  • 1
    • 84944076702 scopus 로고
    • Local and global properties in networks of processors
    • Angluin, D.: Local and global properties in networks of processors. In: Proc. of STOC 1980, pp. 82-93 (1980)
    • (1980) Proc. of STOC 1980 , pp. 82-93
    • Angluin, D.1
  • 2
    • 0024088493 scopus 로고
    • Computing on an anonymous ring
    • Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. J. ACM 35(4), 845-875 (1988)
    • (1988) J. ACM , vol.35 , Issue.4 , pp. 845-875
    • Attiya, H.1    Snir, M.2    Warmuth, M.3
  • 4
    • 0002062408 scopus 로고    scopus 로고
    • Symmetry breaking in anonymous networks: Characterizations
    • IEEE Press, Los Alamitos
    • Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: characterizations. In: Proc. of ISTCS 1996, pp. 16-26. IEEE Press, Los Alamitos (1996)
    • (1996) Proc. of ISTCS , pp. 16-26
    • Boldi, P.1    Codenotti, B.2    Gemmell, P.3    Shammah, S.4    Simon, J.5    Vigna, S.6
  • 5
    • 0032633301 scopus 로고    scopus 로고
    • Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. of PODC 1999, pp. 181-188. ACM Press, New York (1999)
    • Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. of PODC 1999, pp. 181-188. ACM Press, New York (1999)
  • 6
    • 84957017428 scopus 로고    scopus 로고
    • Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, 2180, pp. 33-47. Springer, Heidelberg (2001)
    • Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33-47. Springer, Heidelberg (2001)
  • 7
    • 31244432784 scopus 로고    scopus 로고
    • Fibrations of graphs
    • Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Mathematics 243(1-3), 21-66 (2002)
    • (2002) Discrete Mathematics , vol.243 , Issue.1-3 , pp. 21-66
    • Boldi, P.1    Vigna, S.2
  • 8
    • 0036648927 scopus 로고    scopus 로고
    • Universal dynamic synchronous self-stabilization
    • Boldi, P., Vigna, S.: Universal dynamic synchronous self-stabilization. Distributed Computing 15(3), 137-153 (2002)
    • (2002) Distributed Computing , vol.15 , Issue.3 , pp. 137-153
    • Boldi, P.1    Vigna, S.2
  • 9
    • 36649007968 scopus 로고    scopus 로고
    • About the termination detection in the asynchronous message passing model
    • van Leeuwen, J, Italiano, G.F, van der Hoek, W, Meinel, C, Sack, H, Plášil, F, eds, SOFSEM 2007, Springer, Heidelberg
    • Chalopin, J., Godard, E., Métivier, Y., Tel, G.: About the termination detection in the asynchronous message passing model. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 200-211. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4362 , pp. 200-211
    • Chalopin, J.1    Godard, E.2    Métivier, Y.3    Tel, G.4
  • 11
    • 36649004939 scopus 로고    scopus 로고
    • An efficient message passing election algorithm based on Mazurkiewicz's algorithm
    • Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on Mazurkiewicz's algorithm. Fundamenta Informaticae 80(1-3), 221-246 (2007)
    • (2007) Fundamenta Informaticae , vol.80 , Issue.1-3 , pp. 221-246
    • Chalopin, J.1    Métivier, Y.2
  • 12
    • 2342551132 scopus 로고    scopus 로고
    • Leader election in rings with nonunique labels
    • Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundamenta Informaticae 59(4), 333-347 (2004)
    • (2004) Fundamenta Informaticae , vol.59 , Issue.4 , pp. 333-347
    • Dobrev, S.1    Pelc, A.2
  • 15
    • 56449113492 scopus 로고    scopus 로고
    • Termination detection of distributed tasks
    • Technical Report 1418-06, LaBRI
    • Godard, E., Métivier, Y., Tel, G.: Termination detection of distributed tasks. Technical Report 1418-06, LaBRI (2006)
    • (2006)
    • Godard, E.1    Métivier, Y.2    Tel, G.3
  • 16
    • 0023593920 scopus 로고
    • Algorithms for distributed termination detection
    • Mattern, F.: Algorithms for distributed termination detection. Distributed computing 2(3), 161-175 (1987)
    • (1987) Distributed computing , vol.2 , Issue.3 , pp. 161-175
    • Mattern, F.1
  • 18
    • 56449097032 scopus 로고    scopus 로고
    • Computing on a partially eponymous ring
    • Shvartsman, M.M.A.A, ed, OPODIS 2006, Springer, Heidelberg
    • Mavronicolas, M., Michael, L., Spirakis, P.: Computing on a partially eponymous ring. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 380-394. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.4305 , pp. 380-394
    • Mavronicolas, M.1    Michael, L.2    Spirakis, P.3
  • 19
    • 0013189328 scopus 로고    scopus 로고
    • About the local detection of termination of local computations in graphs
    • Carleton Scientific
    • Métivier, Y., Muscholl, A., Wacrenier, P.-A.: About the local detection of termination of local computations in graphs. In: Proc. of SIROCCO 1997, pp. 188-200. Carleton Scientific (1997)
    • (1997) Proc. of SIROCCO , pp. 188-200
    • Métivier, Y.1    Muscholl, A.2    Wacrenier, P.-A.3
  • 22
    • 0009966553 scopus 로고    scopus 로고
    • Computing functions on asynchronous anonymous networks
    • Yamashita, M., Kameda, T.: Computing functions on asynchronous anonymous networks. Math. Systems Theory 29(4), 331-356 (1996)
    • (1996) Math. Systems Theory , vol.29 , Issue.4 , pp. 331-356
    • Yamashita, M.1    Kameda, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.