### 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/),)) time^{4} 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.

Original language | English (US) |
---|---|

Title of host publication | Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings |

Editors | Zvi Galil, Esko Ukkonen |

Publisher | Springer Verlag |

Pages | 28-40 |

Number of pages | 13 |

ISBN (Print) | 3540600442, 9783540600442 |

DOIs | |

State | Published - Jan 1 1995 |

Externally published | Yes |

Event | 6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 - Espoo, Finland Duration: Jul 5 1995 → Jul 7 1995 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 937 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 |
---|---|

Country | Finland |

City | Espoo |

Period | 7/5/95 → 7/7/95 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings*(pp. 28-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 937). Springer Verlag. https://doi.org/10.1007/3-540-60044-2_32