메뉴 건너뛰기




Volumn 22, Issue 4, 1998, Pages 483-489

Average-case analysis of the merging algorithm of Hwang and Lin

Author keywords

Average case analysis; Merging

Indexed keywords


EID: 19544370212     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009235     Document Type: Article
Times cited : (5)

References (7)
  • 1
    • 84915635948 scopus 로고
    • Improving the bound on optimal merging
    • C. Christen (1978), Improving the bound on optimal merging, Proceedings of the 19th FOCS, pp. 259-266.
    • (1978) Proceedings of the 19th FOCS , pp. 259-266
    • Christen, C.1
  • 2
    • 19544385851 scopus 로고
    • Probabilistic methods in graph theory
    • V. Chvatal (1984), Probabilistic methods in graph theory, Ann. Oper. Res., 1:171-182.
    • (1984) Ann. Oper. Res. , vol.1 , pp. 171-182
    • Chvatal, V.1
  • 4
    • 0015194787 scopus 로고
    • Optimal merging of 2 elements with n elements
    • F. K. Hwang and S. Lin (1971), Optimal merging of 2 elements with n elements, Acta Inform., 1:145-158.
    • (1971) Acta Inform. , vol.1 , pp. 145-158
    • Hwang, F.K.1    Lin, S.2
  • 5
    • 0008521852 scopus 로고
    • A simple algorithm for merging two disjoint linearly ordered lists
    • F. K. Hwang and S. Lin (1972), A simple algorithm for merging two disjoint linearly ordered lists, SIAM J. Comput., 1:31-39.
    • (1972) SIAM J. Comput. , vol.1 , pp. 31-39
    • Hwang, F.K.1    Lin, S.2
  • 7
    • 0018491211 scopus 로고
    • Significant improvements to the Hwang-Ling merging algorithm
    • G. K. Manacher (1979), Significant improvements to the Hwang-Ling merging algorithm, J. Assoc. Comput. Mach., 26(3):434-440.
    • (1979) J. Assoc. Comput. Mach. , vol.26 , Issue.3 , pp. 434-440
    • Manacher, G.K.1


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