Linear-time string-matching using only a fixed number of local storage locations (Q1149761): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q756422
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Joel I. Seiferas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time solutions of the origin-crossing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving Space in Fast String-Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Real-Time Simulations of Multihead Tape Units / rank
 
Normal rank

Latest revision as of 11:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Linear-time string-matching using only a fixed number of local storage locations
scientific article

    Statements

    Linear-time string-matching using only a fixed number of local storage locations (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random-access machine
    0 references
    writing multihead finite automaton
    0 references