More efficient bottom-up multi-pattern matching in trees (Q685356): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q685355 / rank
Normal rank
 
Property / author
 
Property / author: Robert Endre Tarjan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OPTRAN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster tree pattern matching / 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: Pattern Matching in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving and applying program transformations expressed with second-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3696523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 22 May 2024

scientific article
Language Label Description Also known as
English
More efficient bottom-up multi-pattern matching in trees
scientific article

    Statements

    More efficient bottom-up multi-pattern matching in trees (English)
    0 references
    0 references
    0 references
    0 references
    17 October 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    bottom-up algorithm
    0 references
    pattern preprocessing
    0 references
    simple patterns
    0 references