Speeding up two string-matching algorithms (Q1336956): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60163036, #quickstatements; #temporary_batch_1705915684099
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Artur Czumaj / rank
Normal rank
 
Property / author
 
Property / author: Stefan Jarominek / rank
Normal rank
 
Property / author
 
Property / author: Thierry Lecroq / rank
Normal rank
 
Property / author
 
Property / author: Wojciech Plandowski / rank
Normal rank
 
Property / author
 
Property / author: Artur Czumaj / rank
 
Normal rank
Property / author
 
Property / author: Stefan Jarominek / rank
 
Normal rank
Property / author
 
Property / author: Thierry Lecroq / rank
 
Normal rank
Property / author
 
Property / author: Wojciech Plandowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385510 / 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: Average running time of the Boyer-Moore-Horspool algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / 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: A New Proof of the Linearity of the Boyer-Moore 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: A variation on the Boyer-Moore algorithm / 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: The Complexity of Pattern Matching for a Random String / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 23 May 2024

scientific article
Language Label Description Also known as
English
Speeding up two string-matching algorithms
scientific article

    Statements

    Speeding up two string-matching algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references