Constant-space string-matching in sublinear average time
type: Item
instance of: scholarly article
title: Constant-space string-matching in sublinear average time
zbMATH Open document ID: 0916.68113
DOI: 10.1016/S0304-3975(98)00259-X
author: Maxime Crochemore
author: Leszek Gąsieniec
author: Wojciech Rytter
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1306194
Wikidata QID: Q61677968
MaRDI profile type: Publication
cites work: Fast algorithms for two dimensional and multiple pattern matching
cites work: Saving comparisons in the Crochemore-Perrin string-matching algorithm
cites work: Speeding up two string-matching algorithms
cites work: Two-way string-matching
cites work: Q4858437
cites work: Q4849531
cites work: Q5798359
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
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: The Complexity of Pattern Matching for a Random String
full work available at URL: s0304-3975(98)00259-x
OpenAlex ID: W3035186240
description: scientific article; zbMATH DE number 1306194