A redisplay algorithm

Proceedings of the ACM SIGPLAN SIGOA Symposium on Text Manipulation

Volumn , Issue , 1981, Pages 123-129

  Gosling, James ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC TECHNIQUES; LONGEST COMMON SUBSEQUENCES; NEAR-OPTIMAL; VIDEO TERMINALS;

EID: 85060729796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800209.806463     Document Type: Conference Paper

References (10)

1. Kevin Q. Brown. Dynamic Programming in Computer Science. CMU, February, 1979.
2. Craig Everhart. --. Personal communication
3. James Gosling. Fred: a screen editor for Unix. CMU CSD, 1979. Unpublished manual.
4. B. S. Greenberg. The Multics Emacs Redisplay Algorithm. Honeywell Inc., 1979.
5. D. S. Hirschberg. "A linear space algorithm for computing maximal common subsequences." CACM 18 (1975), 341-343.
6. J. W. Hunt and T. G. Szymansky. "A Fast Algorithm for Computing Longest Common Subsequences." CACM 20 (1977), 350-353.
7. W.J. Masek and M. S. Paterson. A Faster Algorithm for Computing String Edit Distances. Tech. Rept. 105, MIT, May, 1978.
8. Richard M. Stallman. EMACS manual for TWENEX users. MIT AI Lab, 1980.
9. H.M. Wagner and M. J. Fischer. "The string-to-string correction problem." JACM 21, 1(January 1974),168-173.
10. C. K. Wong and A. K. Chandra. "Bounds for the String Editing Problem." JACM 23 (1976), 13-16.