메뉴 건너뛰기




Volumn , Issue , 1984, Pages 117-121

Analyzing and compressing assembly codet

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

EID: 85050110145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502874.502886     Document Type: Conference Paper
Times cited : (5)

References (9)
  • 1
    • 84976797077 scopus 로고
    • Threaded code
    • June
    • J. R. Bell, Threaded Code, Comm. ACM 16, 6 (June 1973), 370-372.
    • (1973) Comm. ACM , vol.16 , Issue.6 , pp. 370-372
    • Bell, J.R.1
  • 4
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • April
    • E. M. McCreight, A Space-Economical Suffix Tree Construction Algorithm, J. ACM 23, 2 (April 1976), 262-272.
    • (1976) J. ACM , vol.23 , Issue.2 , pp. 262-272
    • McCreight, E.M.1
  • 5
    • 0347494019 scopus 로고
    • Linear algorithm for data compression via string matching
    • January
    • M. Rodeh, V. R. Pratt and S. Even, Linear Algorithm for Data Compression via String Matching, J, ACM 28, 1 (January 1981), 16-24.
    • (1981) J. ACM , vol.28 , Issue.1 , pp. 16-24
    • Rodeh, M.1    Pratt, V.R.2    Even, S.3
  • 8
    • 0017947781 scopus 로고
    • Implications of structured programming for Machine architecture
    • March
    • A. S. Tanenbaum, Implications of Structured Programming for Machine Architecture, Comm. ACM 21, 3 (March 1978), 237-246.
    • (1978) Comm. ACM , vol.21 , Issue.3 , pp. 237-246
    • Tanenbaum, A.S.1


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