An efficient parallel algorithm for random sampling (Q1116335)

From MaRDI portal
Revision as of 14:16, 19 June 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
An efficient parallel algorithm for random sampling
scientific article

    Statements

    title
    An efficient parallel algorithm for random sampling (English)
    0 references
    author
    S. H. Smith
    0 references
    publication date
    1989
    0 references
    review text
    A parallel algorithm for drawing an unbiased random sample of size M from a population of N elements where \(M\leq N\) is proposed. The algorithm runs in O(log M) time on a concurrent read, exclusive write (CREW) PRAM with M processors.
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    60C05
    0 references
    68R99
    0 references
    zbMATH DE Number
    4088927
    0 references
    zbMATH Keywords
    random sampling
    0 references
    parallel algorithm
    0 references
    CREW
    0 references
    PRAM
    0 references
    OpenAlex ID
    W2127463195
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1116335&oldid=34798494"
    Powered by MediaWiki