A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm (Q3891777)

From MaRDI portal
Revision as of 23:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
scientific article

    Statements

    title
    A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm (English)
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    Boyer-Moore string searching
    0 references
    pattern matching
    0 references
    algorithmic analysis
    0 references
    author
    Leonidas J. Guibas
    0 references
    Andrew M. Odlyzko
    0 references

    Identifiers

    DOI
    10.1137/0209051
    0 references
    zbMATH DE Number
    3698397
    0 references
    OpenAlex ID
    W2054762052
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3891777&oldid=32483858"
    Powered by MediaWiki