On maximal suffixes and constant-space linear-time versions of KMP algorithm.
type: Item
instance of: scholarly article
title: On maximal suffixes and constant-space linear-time versions of KMP algorithm.
zbMATH Open document ID: 1051.68051
DOI: 10.1016/S0304-3975(02)00590-X
author: Wojciech Rytter
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1915596
zbMATH Keywords: String-matching
zbMATH Keywords: Linear time
zbMATH Keywords: Constant space
zbMATH Keywords: Maximal suffix
MaRDI profile type: Publication
cites work: String-matching on ordered alphabets
cites work: Two-way string-matching
cites work: Q4849531
cites work: Squares, cubes, and time-space efficient string searching
cites work: Factorizing words over an ordered alphabet
cites work: Time-space-optimal string matching
cites work: The zooming method: A recursive approach to time-space efficient string-matching
cites work: Fast Pattern Matching in Strings
cites work: Q3659988
description: scientific article; zbMATH DE number 1915596