메뉴 건너뛰기




Volumn 5878 LNCS, Issue , 2009, Pages 1155-1165

I/O-efficient contour tree simplification

Author keywords

[No Author keywords available]

Indexed keywords

CONTOUR TREES; DISK BLOCK; MAIN MEMORY; SCALAR FIELDS;

EID: 75649084198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_116     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 2
    • 0024082546 scopus 로고
    • The Input/Output complexity of sorting and related problems
    • Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Communications of the ACM 31(9), 1116-1127 (1988)
    • (1988) Communications of the ACM , vol.31 , Issue.9 , pp. 1116-1127
    • Aggarwal, A.1    Vitter, J.S.2
  • 3
    • 0942288264 scopus 로고    scopus 로고
    • Optimal external memory interval management
    • Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM Journal on Computing 32(6), 1488-1508 (2003)
    • (2003) SIAM Journal on Computing , vol.32 , Issue.6 , pp. 1488-1508
    • Arge, L.1    Vitter, J.S.2
  • 8
    • 75649119541 scopus 로고    scopus 로고
    • Chiang, Y.-J, Goodrich, M.T, Grove, E.F, Tamassia, R, Vengroff, D.E, Vitter
    • Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter,
  • 9
    • 84994666437 scopus 로고    scopus 로고
    • J.S.: External-memory graph algorithms. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 139-149 (1995)
    • J.S.: External-memory graph algorithms. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 139-149 (1995)
  • 11
    • 0001321490 scopus 로고    scopus 로고
    • External memory algorithms and data structures: Dealing with MASSIVE data
    • Vitter, J.S.: External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys 33(2), 209-271 (2001)
    • (2001) ACM Computing Surveys , vol.33 , Issue.2 , pp. 209-271
    • Vitter, J.S.1


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