Concurrent counting is harder than queuing (Q604464)

From MaRDI portal
Revision as of 22:03, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Concurrent counting is harder than queuing
scientific article

    Statements

    title
    Concurrent counting is harder than queuing (English)
    0 references
    author
    Costas Busch
    0 references
    Srikanta Tirthapura
    0 references
    publication date
    11 November 2010
    0 references
    zbMATH Keywords
    distributed algorithms
    0 references
    distributed data structures
    0 references
    distributed counting
    0 references
    distributed queuing
    0 references

    Identifiers

    zbMATH DE Number
    5815224
    0 references
    OpenAlex ID
    W1978890639
    0 references
    Wikidata QID
    Q60148586
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q604464&oldid=38409493"
    Powered by MediaWiki