An efficient algorithm for concurrent priority queue heaps (Q1350117)

From MaRDI portal
Revision as of 14:59, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An efficient algorithm for concurrent priority queue heaps
scientific article

    Statements

    title
    An efficient algorithm for concurrent priority queue heaps (English)
    0 references
    author
    Galen C. Hunt
    0 references
    Maged M. Michael
    0 references
    Michael L. Scott
    0 references
    publication date
    27 February 1997
    0 references
    Mathematics Subject Classification ID
    68P05
    0 references
    68W10
    0 references
    68Q10
    0 references
    zbMATH DE Number
    983898
    0 references
    zbMATH Keywords
    Concurrency
    0 references
    Data structures
    0 references
    Priority queue
    0 references
    Heap
    0 references
    Bit-reversal
    0 references
    Synchronization
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1350117&oldid=13484890"
    Powered by MediaWiki