메뉴 건너뛰기




Volumn 32, Issue 1, 2004, Pages 410-411

Performance analysis of BSTs in system software

Author keywords

AVL tree; Binary search tree; BST; Red black tree; Splay tree; Threaded tree

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER OPERATING SYSTEMS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; REAL TIME SYSTEMS; TREES (MATHEMATICS); VIRTUAL STORAGE;

EID: 8344259973     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005742     Document Type: Conference Paper
Times cited : (26)

References (10)
  • 2
    • 0017490869 scopus 로고
    • A comparison of tree-balancing algorithms
    • J.-L. Baer and B. Schwab. A comparison of tree-balancing algorithms. Communications of the ACM, 20(5):322-330, 1977.
    • (1977) Communications of the ACM , vol.20 , Issue.5 , pp. 322-330
    • Baer, J.-L.1    Schwab, B.2
  • 4
    • 0004151466 scopus 로고
    • Microsoft Press
    • H. Custer, editor. Inside Windows NT, page 200. Microsoft Press, 1993.
    • (1993) Inside Windows NT , pp. 200
    • Custer, H.1
  • 9
    • 0022093855 scopus 로고
    • Self-adjusting binary search trees
    • July
    • D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.3 , pp. 652-686
    • Sleator, D.D.1    Tarjan, R.E.2
  • 10
    • 0019092794 scopus 로고
    • An empirical evaluation of algorithms for dynamically maintaining binary search trees
    • W. E. Wright. An empirical evaluation of algorithms for dynamically maintaining binary search trees. In Proceedings of the ACM 1980 annual conference, pages 505-515, 1980.
    • (1980) Proceedings of the ACM 1980 Annual Conference , pp. 505-515
    • Wright, W.E.1


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