A priority queue in which initialization and queue operations takeO(loglogD) time (Q3673101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Analysis of Binomial Queue Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority queues with update and finding minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of an algorithm for priority queue administration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01786986 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977421134 / rank
 
Normal rank

Latest revision as of 08:59, 30 July 2024

scientific article
Language Label Description Also known as
English
A priority queue in which initialization and queue operations takeO(loglogD) time
scientific article

    Statements

    A priority queue in which initialization and queue operations takeO(loglogD) time (English)
    0 references
    0 references
    1982
    0 references
    time complexity
    0 references
    data structure
    0 references
    priority queue
    0 references
    binary tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references