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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90075-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090021115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic and complexity analysis of interpolation search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation search—a log log <i>N</i> search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding the complexity of interpolation search / 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: Design and implementation of an efficient priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trie data structures which support very fast search operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time / rank
 
Normal rank

Latest revision as of 17:38, 13 June 2024

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