메뉴 건너뛰기




Volumn , Issue , 2003, Pages 4-11

Self-stabilizing smoothing and counting

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; INTERCONNECTION NETWORKS; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

EID: 0037630646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 0000172617 scopus 로고
    • Counting networks with arbitrary fan-out
    • E. Aharonson and H. Attiya. Counting networks with arbitrary fan-out. Distributed Computing, 8: 163-169, 1995.
    • (1995) Distributed Computing , vol.8 , pp. 163-169
    • Aharonson, E.1    Attiya, H.2
  • 7
    • 84976834622 scopus 로고
    • Self stabilizing systems in spite of distributed control
    • E. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
    • (1974) Communications of the ACM , vol.17 , pp. 643-644
    • Dijkstra, E.1
  • 8
    • 0024750290 scopus 로고
    • The periodic balanced sorting network
    • October
    • M. Dowd, Y. Perl, L. Rudolph, and M. Saks. The periodic balanced sorting network. Journal of the ACM, 36(4):738-757, October 1989.
    • (1989) Journal of the ACM , vol.36 , Issue.4 , pp. 738-757
    • Dowd, M.1    Perl, Y.2    Rudolph, L.3    Saks, M.4
  • 9
    • 24544458695 scopus 로고    scopus 로고
    • Tolerating faults in counting networks
    • Technical report, California Institute of Technology. Electronic Technical Report ETR022
    • M. Riedel and J. Bruck. Tolerating faults in counting networks. Technical report, California Institute of Technology. Electronic Technical Report ETR022.
    • Riedel, M.1    Bruck, J.2


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