The weak-heap data structure: variants and applications (Q1932363)

From MaRDI portal
Revision as of 02:17, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The weak-heap data structure: variants and applications
scientific article

    Statements

    title
    The weak-heap data structure: variants and applications (English)
    0 references
    author
    Stefan Edelkamp
    0 references
    Amr Elmasry
    0 references
    Jyrki Katajainen
    0 references
    publication date
    18 January 2013
    0 references
    zbMATH Keywords
    data structures
    0 references
    priority queues
    0 references
    weak heaps
    0 references
    adaptive sorting
    0 references
    shortest paths
    0 references
    comparison complexity
    0 references
    describes a project that uses
    heapsort
    0 references
    LEDA
    0 references
    Quicksort
    0 references

    Identifiers

    zbMATH DE Number
    6126826
    0 references
    OpenAlex ID
    W1968564979
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1932363&oldid=35317979"
    Powered by MediaWiki