메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 132-141

Path matching in compressed control flow traces

Author keywords

Chromium; Data compression

Indexed keywords

ALGORITHMS; CHROMIUM; COMPUTATIONAL COMPLEXITY;

EID: 33750176605     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999951     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 0030129729 scopus 로고    scopus 로고
    • Let Sleeping Files Lie: Pattern Matching in Z-compressed Files
    • A. Amir, G. Benson, and M. Farach, "Let Sleeping Files Lie: Pattern Matching in Z-compressed Files," Journal of Computer and System Sciences, Vol. 52, pages 299-307, 1996.
    • (1996) Journal of Computer and System Sciences , vol.52 , pp. 299-307
    • Amir, A.1    Benson, G.2    Farach, M.3
  • 4
    • 0002044093 scopus 로고    scopus 로고
    • Identifying Hierarchical Structure in Sequences: A Linear-time Algorithm
    • C. Nevill-Manning and I. Witten, "Identifying Hierarchical Structure in Sequences: A Linear-time Algorithm," Journal of Artificial Intelligence Research, Vol. 7, pages 67-82, 1997.
    • (1997) Journal of Artificial Intelligence Research , vol.7 , pp. 67-82
    • Nevill-Manning, C.1    Witten, I.2
  • 8
    • 84948425590 scopus 로고    scopus 로고
    • http://www.spec.org/osg/cpu95/.
  • 10
    • 85009167014 scopus 로고
    • Efficient Two-dimensional Compressed Matching
    • A. Amir and G. Benson, "Efficient Two-dimensional Compressed Matching," Data Compression Conference, pages 279-288, 1992.
    • (1992) Data Compression Conference , pp. 279-288
    • Amir, A.1    Benson, G.2


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