Text sparsification via local maxima. (Q1401406): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Pierluigi Crescenzi / rank | |||
Property / author | |||
Property / author: Alberto del Lungo / rank | |||
Property / author | |||
Property / author: Linda Pagli / rank | |||
Property / author | |||
Property / author: Pierluigi Crescenzi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alberto del Lungo / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Linda Pagli / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4952706 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4952617 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4472452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maintaining dynamic sequences under equality tests in polylogarithmic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry breaking for suffix tree construction / rank | |||
Normal rank |
Latest revision as of 09:52, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Text sparsification via local maxima. |
scientific article |
Statements
Text sparsification via local maxima. (English)
0 references
17 August 2003
0 references
Computational complexity
0 references
NP-completeness
0 references
Pattern matching
0 references
String algorithms
0 references
Text indexing data structures
0 references