James A. Storer
References
- 1 Alto, A.V., HOPCROFT, J.E, AND ULLMAN, J D. The Design and Analysts of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
- 2 BOYER, R.S. A fast string searching algorithm Commun. ACM 20, 10 (Oct. 1977), 762-772. Google Scholar
- 3 COOK, S.A The complexity of theorem proving procedures. Proe. 3rd Ann. ACM Syrup. on Theory of Computing, Shaker Heights, Ohio, 1971, pp. 151-158. Google Scholar
- 4 GALLANT, J., MAmR, D., AI~D STOREg, J.A. On finding minimal length superstrings. ~ Comput. Syst. Set 20 (1980), 50--58Google Scholar
- 5 GAgE't, M.R., Jom~soN, D.S., m~D STOCKM~YER, L. Some snnptified NP-complete problems. Theor. Comput. Sci. 1 (1976), 237--267.Google Scholar
- 6 HxGAiemr~, W.D., Lrtco}~l~, D.J., LoNe, H.S., AND Weeim, J.C. Encoding verbal mformaUon as unique numbers. IBM Syst. J. 11 (1972), 278-315.Google Scholar
- 7 HxaN, B. A new techmque for compression and storage of data. Commur~ A CM 17, 8 (Aug. 1974), 434-436 Google Scholar
- 8 Hurr~u, D.A. A method for the construction of minimum-redundancy codes, Proc. IRE 40 (1952), 1098-1101.Google Scholar
- 9 KARP, R.M. Reducibility among combinatorial problems. In Complexity of Computer Computatwns, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-103.Google Scholar
- 10 KNUTH, D.E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd ed. Addison- Wesley, Reading, Mass., 1973. Google Scholar
- 11 KNurtt, D.E., Mox~xs, J H., AND PRATT, V.R. Fast pattern matching in stnngs. SIAM ~ Comput. 6, 2 (1977), 323-349.Google Scholar
- 12 LeMPI~L, A, A~D Zlv, J. On the complexity of finite sequences. IEEE Trans Inf. Theory IT 22, 1 (1976), 75-81.Google Scholar
- 13 L~sr,, M.E. Compressed text storage. Unpublished Tcch. Memo., Bell Laboratories, Murray Hill, N.J., 1970Google Scholar
- 14 McCARTHY, J.P. Automatic file compression. In International Computing Symposium, North-Holland, Amsterdam, 1973, pp 511-516.Google Scholar
- 15 McCREtGHT, E M. A space-economical suffix tree construction algorithm. ~ ACM 23, 2 (Apr. 1976), 262-272. Google Scholar
- 16 MAmR, D The complextty of some problems on subsequences and supersequences. Conf on Theoreucal Computer Science, University of Waterloo, Waterloo, Ont., Can., 1977, pp. 120-129Google Scholar
- 17 MAIl/R, D., AND STORI3K, J.A. A note on the complexity of the superstring problem. Proc 1978 Conf. on Information Sciences and Systems, Baltimore, Md., 1978, pp. 52-60.Google Scholar
- 18 MAJST~R, M E. Efficmnt on-line construction and correction ofpomion trees. Tech. Rep. TR79-393, Dep. of Computer Science, Corner Univ., Ithaca, N.Y., 1979.Google Scholar
- 19 MARRON, B.A, AND DE MXlN~, P.A.D. Automatic data compression. Commun. ACM 10, 11 (Nov. 1967), 711-715 Google Scholar
- 20 MAYNE, A., AND JAMES, E.B. Information compression by factorising common strings. Comput. ~ 18, 2 (1975), 157-160Google Scholar
- 21 MORRIS, R., A~ THOMPSON, K. Webster's second on the head of a pin. Unpubfishegt Tcch. Memo., Bell Laboratories, Murray Hill, N.J,, 1974.Google Scholar
- 22 PRAYr, V.R.Improvements and applications for the Weiner repetition finder. Lecture notes, 3rd revision, 1975.Google Scholar
- 23 RODI~H, M, PRATT, V R., ANt) Ev~, S A linear-time algorithm for finding repetitions and its apphcation to data compression, Tech Rep. No, 72, Dep of Computer Sci., Technioon, Israel, 1976.Google Scholar
- 24 RODEH, M., PRATT, V.R., AND EVEN, S. Linear algorithm for data compression via string matching. ~ ACM 28, 1 (Jan 1981), 16-24. Google Scholar
- 25 RuB~,F Experiments in text fde compression. Commun. ACM 19, 11 (Nov. 1976), 61%623. Google Scholar
- 26 RUTH, S S, Am~ KREUTZER, P.J. Data compression for large business files. Datamation l& 9 (1972), 62-66Google Scholar
- 27 SEEP'f, J B., AND Zrv, j.A umversal data compression algorithm" Description and preliminary results. Unpublished Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1977.Google Scholar
- 28 St~_~'~, J.B., A~D ZIv, J.Further results on universal data compression. Unpublished Tech. Memo., Bell Laboratories, Murray Hill, N.J., 1978.Google Scholar
- 29 SEIFERAS, J.Subword trees Lecture notes, 1977Google Scholar
- 30 STORER, J.A NP-completeness results concerning data compression. Teeh. Rep. 234, Dep. of Electrical Engmeedrtg and Computer Science, Princeton Umv., Prme0ton, N.J., 1977.Google Scholar
- 31 STOREK, J.A. PLCC--A compiler-compiler for PLI and PLC users. Tech. Rep. 236, Dep. of Electrical Engineering and Computer Science, Princeton Univ., Princoton, N.J., 1977.Google Scholar
- 32 STORER, J.A. Data compression: Methods and complexity issues. Ph.D. Dissertation, Dep. of Electrical Engineering and Computer Setenee, Princeton Univ, Princeton, N.J., 1978. Google Scholar
- 33 STORER~ J.A., AND SZYMANSKI, T.G. The macro model for data compression. Proc. lOth Ann. ACM Symp. on Theory of Computing, San Dtego, Calif., I978 (extended abstract). Google Scholar
- 34 VIqVALINGAM, M.Indexing with coded deltas--A data compaction technique. Soflw. Pratt. Exper 6 (1976), 397-403.Google Scholar
- 35 WAGNER, R A. Common phrases and mintmum-spaee text storage. Commun. A CM 16, 3 (Mar. 1973), 148-152 Google Scholar
- 36 W~INEg, P Linear pattern matchmg algorithms. Proc. I4th Annual IEEE Syrup, on Switching and Automata Theory, Ames, Iowa, 1973, pp. 1-I 1.Google Scholar
- 37 Zrv,J.Coding theorems for lndwidual sequences IEEE Trans. Inf. Theory IT 24, 4 (1978) 405-4t2.Google Scholar
- 38 Zrv,J, ASP LEMPEL, A. A universal algorithm for sequential data compression. IEEE Trans Inf. Theory IT 23, 3 (1977), 33%343.Google Scholar
- 39 Ziv, J, AND LEm, rL, A.compression of indiwdual sequences vta variable-rate coding. IEEE Trans. Inf. Theory IT 24, 5 (1978), 530-536.Google Scholar
Index Terms
Data compression via textual substitution
Comments