On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q29028269 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Let sleeping files lie: Pattern matching in Z-compressed files. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Two-Dimensional Compressed Matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4849531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4347161 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3935355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Finite Sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4856179 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851616 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A universal algorithm for sequential data compression / rank | |||
Normal rank |
Latest revision as of 16:25, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of pattern matching for highly compressed two-dimensional texts. |
scientific article |
Statements
On the complexity of pattern matching for highly compressed two-dimensional texts. (English)
0 references
14 May 2003
0 references