Results 101 to 110 of about 253 (128)

A note on the generalized Josephus problem

A note on the generalized Josephus problem
openaire  

A Further Note on the Generalized Josephus Problem

A Further Note on the Generalized Josephus Problem
openaire  

Some of the next articles are maybe not open access.

Related searches:

An image encryption scheme based on double chaotic cyclic shift and Josephus problem

Journal of Information Security and Applications, 2021
Abstract In recent years, image encryption has become a very popular and effective method to protect digital images. Among many image encryption methods, the image encryption algorithm based on chaotic map has extensive application and profound theoretical basis.
Xue-Feng Duan
exaly   +2 more sources

The Josephus Flavius' problem

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 many years in CS1 or CS2, primarily to illustrate applications of various data structures and algorithmic problem solving. The resulting "brute force" solution works, but is not elegant.
Peter B Henderson, Hendersonpeter B
exaly   +2 more sources

A novel satellite image encryption algorithm based on hyperchaotic systems and Josephus problem

Advances in Space Research, 2021
Abstract With the rapid growth of the number of Earth observation satellite (EOS) supporting critical applications, it is required to improve the security techniques to protect the sensitive data and images during the transmission between the satellites and the ground stations. This paper introduces a new satellite image encryption algorithm based on
M Naim, A Ali Pacha
exaly   +2 more sources

Node set optimization problem for complete Josephus cubes

Journal of Combinatorial Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Micheal Arockiaraj, Jessie Abraham, Arul Jeya Shalini   +2 more
exaly   +2 more sources

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

Journal of Algorithms, 1983
Abstract The Josephus Problem can be described as follows: There are n objects arranged in a circle. Beginning with the first object, we move around the circle and remove every m th object. As each object is removed, the circle closes in. Eventually, all n objects will have been removed from the circle.
Errol L Lloyd
exaly   +3 more sources

The Josephus Problem: Once More Around

Mathematics Magazine, 2002
(2002). The Josephus Problem: Once More Around. Mathematics Magazine: Vol. 75, No. 1, pp. 12-17.
exaly   +4 more sources

Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem

Theoretical Computer Science
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia-Wei Lee
exaly   +3 more sources

Josephus problem as a multidisciplinary exercise source

Inproforum
Tomáš G. Roskovec, Petr Chládek, Jan Fiala   +2 more
exaly   +2 more sources