An analysis of the Karp-Rabin string matching algorithm (Q911281): 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: A fast string searching algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient randomized pattern-matching algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Worst-Case Behavior of String-Searching Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3311639 / rank | |||
Normal rank |
Latest revision as of 15:06, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An analysis of the Karp-Rabin string matching algorithm |
scientific article |
Statements
An analysis of the Karp-Rabin string matching algorithm (English)
0 references
1990
0 references
signatures
0 references
average case analysis
0 references
probabilistic algorithm
0 references
string searching
0 references