메뉴 건너뛰기




Volumn 18, Issue 3, 1997, Pages 405-416

The Bit Complexity of Distributed Sorting

Author keywords

Bit complexity; Distributed sorting; Distributed system

Indexed keywords


EID: 0006263987     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009163     Document Type: Article
Times cited : (8)

References (8)
  • 3
    • 84992367528 scopus 로고
    • A new characterization of tree medians with applications to distributed algorithms
    • O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed algorithms, Networks 24(1) (1994) 23-29; also: Proceedings of the 18th International Workshop on Graph-Theoretic Concept in Computer Science (WG '92), Frankfurt, June 1992. LNCS 657, Springer-Verlag, Berlin, pp. 135-144.
    • (1994) Networks , vol.24 , Issue.1 , pp. 23-29
    • Gerstel, O.1    Zaks, S.2
  • 7
    • 0021293041 scopus 로고
    • The complexity of sorting in distributed systems
    • M. C. Loui, The complexity of sorting in distributed systems, Information and Control, 60(1-3) (1984), 70-85.
    • (1984) Information and Control , vol.60 , Issue.1-3 , pp. 70-85
    • Loui, M.C.1
  • 8
    • 0022044523 scopus 로고
    • Optimal distributed algorithms for sorting and ranking
    • S. Zaks, Optimal distributed algorithms for sorting and ranking, IEEE Transactions on Computers, 34(4) (1985), 376-379.
    • (1985) IEEE Transactions on Computers , vol.34 , Issue.4 , pp. 376-379
    • Zaks, S.1


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