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

DOI10.1016/0196-6774(83)90025-1MaRDI QIDQ3670552zbMATH OpenOpenAlexFDO

Authors Errol L. Lloyd

Publication date 1983

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(83)90025-1

zbMATH Keywords

permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• General solution to the spectator-first Tantalizer problem
• Functional iteration and the Josephus problem
• The feline Josephus problem
• Survival probabilities of counting-out games on a line
• An application of Fourier transforms on finite abelian groups to an enumeration arising from the Josephus problem

This page was built for publication: An O(n log m) algorithm for the Josephus Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670552)