Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333)

From MaRDI portal
Revision as of 10:23, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Log-logarithmic worst-case range queries are possible in space theta(N)
scientific article

    Statements

    Log-logarithmic worst-case range queries are possible in space theta(N) (English)
    0 references
    0 references
    1983
    0 references
    data structure
    0 references
    random access machine
    0 references
    priority queues
    0 references
    stratified trees
    0 references
    Van Emde Boas trees
    0 references
    sparse tables
    0 references
    special search algorithm of Fredmann, Komolos and Szemeredi
    0 references

    Identifiers