Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W32 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6585467 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
string matching | |||
Property / zbMATH Keywords: string matching / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
analysis of algorithms | |||
Property / zbMATH Keywords: analysis of algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Boyer–Moore–Galil String Searching Strategies Revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast string searching 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: Q4849531 / 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: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Correct Preprocessing Algorithm for Boyer–Moore String-Searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4859180 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:08, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight bounds on the complexity of the Apostolico-Giancarlo algorithm |
scientific article |
Statements
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (English)
0 references
26 May 2016
0 references
string matching
0 references
analysis of algorithms
0 references
computational complexity
0 references