메뉴 건너뛰기




Volumn 709 LNCS, Issue , 1993, Pages 84-94

A general lower bound on the I/O-complexity of comparison-based algorithms

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

EID: 85029508828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57155-8_238     Document Type: Conference Paper
Times cited : (15)

References (12)
  • 1
    • 85029487505 scopus 로고    scopus 로고
    • The I/O Complexity of Sorting and Related Problems. Proceedings of 14th ICALP (1987)
    • Springer Verlag
    • Aggarwal, A., Vitter, J.S.: The I/O Complexity of Sorting and Related Problems. Proceedings of 14th ICALP (1987), Lecture Notes in Computer Science 267, Springer Verlag, 467–478
    • Lecture Notes in Computer Science , vol.267 , pp. 467-478
    • Aggarwal, A.1    Vitter, J.S.2
  • 2
    • 0024082546 scopus 로고
    • The Input/Output Complexity of Sorting and Related Problems
    • The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, Vol 31 (9) (1988) 1116–1127.
    • (1988) Communications of the ACM , vol.31 , Issue.9 , pp. 1116-1127
  • 3
    • 0020879158 scopus 로고
    • Lower bounds for algebraic computation trees
    • Ben-Or, M.: Lower bounds for algebraic computation trees. Proceedings of 15th STOC (1983), 80–86.
    • (1983) Proceedings of 15Th STOC , pp. 80-86
    • Ben-Or, M.1
  • 6
    • 85029479089 scopus 로고
    • Sorting and Searching, Addison-Wesley
    • Knuth, D.E.: The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley (1973) (p. 205–206).
    • (1973) The Art of Computer Programming , vol.3 , pp. 205-206
    • Knuth, D.E.1
  • 7
    • 0020202558 scopus 로고
    • Finding Repeated Elements
    • North-Holland Publishing
    • Misra, J., Gries, D.: Finding Repeated Elements. Science of Computer Programming 2 (1982), 143–152, North-Holland Publishing.
    • (1982) Science of Computer Programming , vol.2 , pp. 143-152
    • Misra, J.1    Gries, D.2
  • 8
    • 1542710191 scopus 로고
    • Sorting Multisets and Vectors In-Place. Proceedings of 2nd WADS
    • Springer Verlag
    • Munro, J.I., Raman, V.: Sorting Multisets and Vectors In-Place. Proceedings of 2nd WADS, Lecture Notes in Computer Science 519, Springer Verlag (1991), 473–479.
    • (1991) Lecture Notes in Computer Science , vol.519 , pp. 473-479
    • Munro, J.I.1    Raman, V.2
  • 9
    • 27144461951 scopus 로고
    • Sorting and Searching in Multisets
    • Munro, I., Spira, P.M.: Sorting and Searching in Multisets. SIAM Journal of Computing, 5 (1) (1976) 1–8.
    • (1976) SIAM Journal of Computing , vol.5 , Issue.1 , pp. 1-8
    • Munro, I.1    Spira, P.M.2
  • 11
    • 84958084953 scopus 로고
    • Efficient Memory Access in Large-Scale Computation (Invited paper)
    • Vitter, J.S: Efficient Memory Access in Large-Scale Computation (invited paper). Proceedings of 8th STACS (1991), 26–41.
    • (1991) Proceedings of 8Th STACS , pp. 26-41
    • Vitter, J.S.1


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