The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823)

From MaRDI portal
Revision as of 21:14, 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
The algorithm for identical object searching with bounded worst-case complexity and linear memory
scientific article

    Statements

    The algorithm for identical object searching with bounded worst-case complexity and linear memory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    key search
    0 references
    time complexity of algorithms
    0 references
    memory size
    0 references
    0 references