activity
20172025
most citedPrevious Player's Positions of Impartial Three-Dimensional Chocolate-Bar Games

1 citations · 1 across the 15 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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)…