no code implementations • 12 Mar 2021 • Kuan-Yun Lai, Ya-Chun Liang, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao
In this paper, we remove all the holes of unknown CR's; namely we prove that the CR is $\frac{2k}{k + \lfloor k/3 \rfloor}$ for all $k\geq 2$.
Data Structures and Algorithms
