In computer science and mathematics, the Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out gameâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2013

2013

- Lei Wang, Xiaodong Wang
- 2013

The classic Josephus problem can be described as follows: There are n objects, consecutively numbered from 1 through n, arrangedâ€¦Â (More)

Is this relevant?

2010

2010

- Frank Ruskey, Aaron Williams
- Theory of Computing Systems
- 2010

In the classic Josephus problem, elements 1,2,â€¦,n are placed in order around a circle and a skip value k is chosen. The problemâ€¦Â (More)

Is this relevant?

2009

2009

- Toshiyuki Yamauchi, Takahumi Inoue, Soh Tatsumi
- 2009

We are going to study the Josephus Problem and its variants under various moduli in this article. Let n be a natural number. Weâ€¦Â (More)

Is this relevant?

2009

2009

- Mirel Cosulschi, Mihai Gabroveanu, Nicolae Constantinescu, Titus Flavius Josephus
- 2009

Choosing the right data structure has been proved many times to have a major role toward design of an optimal algorithm. In thisâ€¦Â (More)

Is this relevant?

2009

2009

We study some length-preserving operations on strings that only permute the symbol positions in strings. These operations includeâ€¦Â (More)

Is this relevant?

2007

2007

A new method for representing positive integers and real numbers in a rational base is considered. It amounts to computing theâ€¦Â (More)

Is this relevant?

2006

2006

- Peter B. Henderson
- SIGCSE Bulletin
- 2006

You may have used the Josephus Problem as a programming assignment in one of your courses. I have been using this problem forâ€¦Â (More)

Is this relevant?

1997

1997

- Lorenz Halbeisen
- 1997

Lorenz Halbeisen, ETH Z urich Norbert Hungerb uhler, University of Freiburg (Germany) Abstract We give explicit non-recursiveâ€¦Â (More)

Is this relevant?

1978