Fast equality test for straight-line compressed strings

Information Processing Letters

Volumn 112, Issue 8-9, 2012, Pages 341-345

  Schmidt Schauß, Manfred ^a   Schnitger, Georg ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Grammar based compression; Randomized algorithms; Straight line programs

Indexed keywords

GRAMMAR-BASED COMPRESSION; RANDOMIZED ALGORITHMS; RANDOMIZED TESTS; RUNNING TIME ANALYSIS; STRAIGHT LINE PROGRAM;

COMPUTER APPLICATIONS;

DATA PROCESSING;

EID: 84856593292     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2012.01.008     Document Type: Article

References (15)

1. E. Bach, and J. Shallit Algorithmic Number Theory, vol. 1: Efficient Algorithms 1996 MIT Press Cambridge, MA
2. P. Berman, M. Karpinski, L.L. Larmore, W. Plandowski, and W. Rytter On the complexity of pattern matching for highly compressed two-dimensional texts J. Comput. Syst. Sci. 65 2 2002 332 350 (Pubitemid 41161963)
3. G. Busatto, M. Lohrey, and S. Maneth Efficient memory representation of XML documents Proc. of DBPL 2005 LNCS vol. 3774 2005 199 216 (Pubitemid 43943738)
4. G. Busatto, M. Lohrey, and S. Maneth Efficient memory representation of XML document trees Inform. Syst. 33 4-5 2008 456 474
5. P. Dusart, Autour de la fonction qui compte le nombre de nombres premiers, Ph.D. thesis, Université de Limoges, No. 17-1998, 1998.
6. A. Gascón, G. Godoy, and M. Schmidt-Schauß Context matching for compressed terms LICS 2008 2008 IEEE Computer Society 93 102
7. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter Randomized efficient algorithms for compressed strings: The finger-print approach (extended abstract) 7th CPM 96 LNCS vol. 1075 1996 Springer 39 49 (Pubitemid 126073707)
8. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Trans. Inform. Theory 23 3 1977 337 343
9. M. Karpinski, W. Rytter, and A. Shinohara Pattern-matching for strings with short description CPM?95 LNCS vol. 937 1995 Springer-Verlag 205 214
10. Y. Lifshits Processing compressed texts: A tractability border 18th CPM 2007 LNCS vol. 4580 2007 Springer
11. W. Plandowski Testing equivalence of morphisms on context-free languages ESA 1994 Springer 460 470
12. W. Plandowski, The complexity of the morphism equivalence problem for context-free languages, Ph.D. thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, 1995.
13. W. Plandowski, and W. Rytter Complexity of language recognition problems for compressed words Jewels Are Forever 1999 Springer 262 272
14. J.B. Rosser, and L. Schoenfeld Approximate formulas for some functions of prime numbers Illinois J. Math. 6 1962 64 94
15. M. Schmidt-Schauß, G. Schnitger, Fast equality test for straight-line compressed strings, Frank report 45, Institut für Informatik, Goethe-Universität Frankfurt am Main, April 2011.