Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in linear time? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Dictionary Matching with No Slowdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Packed String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Searching in Packed Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filtering Search: A New Approach to Query-Answering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up two string-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string B-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Storing a Sparse Table with <i>0</i> (1) Worst Case Access Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / 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: Indexing text using the Ziv--Lempel trie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Pattern Matching for a Random String / rank
 
Normal rank

Revision as of 16:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
scientific article

    Statements

    Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (English)
    0 references
    0 references
    13 September 2012
    0 references
    independent set
    0 references
    fixed-parameter tractability
    0 references
    hereditary class of graphs
    0 references
    modular decomposition
    0 references

    Identifiers