Optimal two-dimensional compressed matching (Q4632428): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4763432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alphabet Independent Approach to Two-Dimensional Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Two-Dimensional Compressed Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of a Data Structure for Representing Sorted Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel pattern matching in strings / rank
 
Normal rank

Latest revision as of 01:53, 19 July 2024

scientific article; zbMATH DE number 7048676
Language Label Description Also known as
English
Optimal two-dimensional compressed matching
scientific article; zbMATH DE number 7048676

    Statements

    Optimal two-dimensional compressed matching (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2019
    0 references
    basis vector
    0 references
    pattern matching
    0 references
    candidate list
    0 references
    text character
    0 references
    rectangular array
    0 references

    Identifiers