@inproceedings{75ee1a35d8f84fa89ba8336f8fd63a33,

title = "Efficient string matching on coded texts",

abstract = "The so called {"}four Russians technique{"} is often used to speed up algorithms by encoding several data items in a single memory cell. Given a sequence of n symbols over a constant size alphabet, one can encode the sequence into O(n/A) memory cells in O(log A) time using n~ log A processors. This paper presents an efficient CRCW-PRAM string-matching algorithm for coded texts that takes O(loglog(m/),)) time4 making only O(n/A) operations, an improvement by a factor of A --- O(log n) on the number of operations used in previous algorithms. Using this stringmatching algorithm one can test if a string is square-free and find all palindromes in a string in O(log log n) time using n~ log log n processors.",

author = "Dany Breslauer and Leszek G{\c a}sieniec",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.; 6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 ; Conference date: 05-07-1995 Through 07-07-1995",

year = "1995",

doi = "10.1007/3-540-60044-2_32",

language = "English (US)",

isbn = "3540600442",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "28--40",

editor = "Zvi Galil and Esko Ukkonen",

booktitle = "Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings",

}