메뉴 건너뛰기




Volumn 1167, Issue , 1996, Pages 49-66

An empirical study of delta algorithms

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING;

EID: 84856623112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023080     Document Type: Conference Paper
Times cited : (21)

References (14)
  • 2
    • 0003838454 scopus 로고
    • An algorithm for differential file comparison
    • Technical Report Computing Science Technical Report , Bell Laboratories, June
    • James W. Hunt and M.D. Mclllroy. An algorithm for differential file comparison. Technical Report Computing Science Technical Report 41, Bell Laboratories, June 1976.
    • (1976) Technical Report Computing Science Technical Report , vol.41
    • Hunt, J.W.1    McLllroy, M.D.2
  • 3
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the ACM, 20(5):350-353, May 1977.
    • (1977) Communications of the ACM , vol.20 , Issue.5 , pp. 350-353
    • Hunt, J.W.1    Szymanski, T.G.2
  • 4
    • 0024064121 scopus 로고
    • Application of splay trees to data compression
    • Douglas W. Jones. Application of splay trees to data compression. Communications of the ACM, 31(8):996-1007, August 1988.
    • (1988) Communications of the ACM , vol.31 , Issue.8 , pp. 996-1007
    • Jones, D.W.1
  • 5
    • 84949649465 scopus 로고    scopus 로고
    • David G. Korn and Kiem-Phong Vo. Vdelta: Efficient data differencing and compression. In preparation, 1995.
    • Korn, D.G.1    Vdelta, K.-P.2
  • 6
    • 0016942292 scopus 로고
    • A space economical suffix tree construction algorithm
    • E. M. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 32:262-272, 1976.
    • (1976) Journal of the ACM , vol.32 , pp. 262-272
    • McCreight, E.M.1
  • 8
    • 0020205756 scopus 로고
    • A longest common subsequence algorithm for similar text strings
    • Narao Nakatsu, Yahiko Kambayashi, and Shuzo Yajima. A longest common subsequence algorithm for similar text strings. Acta Informatica, 18:171-179, 1982.
    • (1982) Acta Informatica , vol.18 , pp. 171-179
    • Nakatsu, N.1    Kambayashi, Y.2    Yajima, S.3
  • 9
    • 0344005424 scopus 로고
    • Delta technique and string-to-string correction
    • AF'CET, Springer Verlag
    • Wolfgang Obst. Delta technique and string-to-string correction. In Proc. of the First European Software Engineering Conference, pages 69-73. AF'CET, Springer Verlag, September 1987.
    • (1987) Proc. Of the First European Software Engineering Conference , pp. 69-73
    • Obst, W.1
  • 11
    • 84976728067 scopus 로고
    • The string-to-string correction problem with block moves
    • Walter F. Tichy. The string-to-string correction problem with block moves. ACM Transactions on Computer Systems, 2(4):309-321, November 1984.
    • (1984) ACM Transactions on Computer Systems , vol.2 , Issue.4 , pp. 309-321
    • Tichy, W.F.1
  • 12
    • 0022100234 scopus 로고
    • RCS — a system for version control
    • Walter F. Tichy. RCS — a system for version control. Software—Practice and Experience, 15(7):637-654, July 1985.
    • (1985) Software—Practice and Experience , vol.15 , Issue.7 , pp. 637-654
    • Tichy, W.F.1
  • 13
    • 84949672759 scopus 로고
    • A prefix matching algorithm suitable for data compression.
    • Kiem-Phong Vo. A prefix matching algorithm suitable for data compression. In preparation, 1995.
    • (1995) In Preparation
    • Vo, K.-P.1
  • 14
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding.
    • J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. on Information Theory, IT-24(5):5306, September 1978.
    • (1978) IEEE Trans. On Information Theory , vol.24 , Issue.5 , pp. 5306
    • Ziv, J.1    Lempel, A.2


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