An O(n log m) algorithm for the Josephus Problem (Q3670552)

From MaRDI portal
Revision as of 21:30, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An O(n log m) algorithm for the Josephus Problem
scientific article

    Statements

    title
    An O(n log m) algorithm for the Josephus Problem (English)
    0 references
    author
    Errol L. Lloyd
    0 references
    publication date
    1983
    0 references
    zbMATH DE Number
    3825158
    0 references
    zbMATH Keywords
    permutation
    0 references
    OpenAlex ID
    W2014866140
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3670552&oldid=31769771"
    Powered by MediaWiki