The round complexity of distributed sorting (Q2943403)

From MaRDI portal
Revision as of 17:55, 10 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 round complexity of distributed sorting
scientific article

    Statements

    title
    The round complexity of distributed sorting (English)
    0 references
    author
    Boaz Patt-Shamir
    0 references
    Marat Teplitsky
    0 references
    publication date
    11 September 2015
    0 references
    zbMATH Keywords
    communication complexity
    0 references
    congest model
    0 references
    distributed sorting
    0 references
    network algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P10
    0 references
    68M14
    0 references
    68Q25
    0 references
    68W15
    0 references
    zbMATH DE Number
    6481667
    0 references
    OpenAlex ID
    W2056695987
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2943403&oldid=36200490"
    Powered by MediaWiki