Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Josephus problem

Known as: Josephan count, Josephus permutation 
In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Image encryption is an efficient visual technology to protect private images. This paper develops an image encryption algorithm… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2018
2018
In this paper, we will study a generalized version of Josephus where a serial execution occurs at each iteration and give a non… Expand
Is this relevant?
2012
2012
Inscripcion: "N.S. DE LA MISERICORDIA VENERADA EN EL CLAUSTRO DE LA MERCED de Valencia de quien fue muy devota la Efigiada Ven… Expand
Is this relevant?
2011
2011
AbstractIn the classic Josephus problem, elements 1,2,…,n are placed in order around a circle and a skip value k is chosen. The… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2009
2009
Choosing the right data structure has been proved many times to have a major role toward design of an optimal algorithm. In this… Expand
  • figure 1
  • table 4
  • table 3
  • table 5
  • table 7
Is this relevant?
1997
1997
We give explicit non-recursive formulas to compute the Josephus-numbers j(n; 2; i) and j(n; 3; i) and explicit upper and lower… Expand
  • figure 1
  • table 1
Is this relevant?
1991
1991
The problem of Josephus is the following. We are given two positive integers n, q. There are n places arranged around a circle… Expand
  • figure 1
Is this relevant?