1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2024
A New 0(klog n) Algorithm for Josephus Problem
Hikaru Manabe, Ryohei Miyadera, Yuji Sasaki +2
We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n)…
math.CO2017★ 1 cited
Ryuo Nim: A Variant of the classical game of Wythoff Nim
Ryohei Miyadera, Yuki Tokuni, Yushi Nakaya +3
The authors introduce the impartial game of the generalized Ryūō Nim, a variant of the classical game of Wythoff Nim. In the latter game, two players take turns in moving a single…