Constant-space string-matching in sublinear average time (Q1292492): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for two dimensional and multiple pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving comparisons in the Crochemore-Perrin string-matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up two string-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space-optimal string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zooming method: A recursive approach to time-space efficient string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Pattern Matching for a Random String / rank
 
Normal rank

Revision as of 20:41, 28 May 2024

scientific article
Language Label Description Also known as
English
Constant-space string-matching in sublinear average time
scientific article

    Statements