Inset games and strategies. Séminaire Lotharingien de Combinatoire. 2021. 85B. Article #73
Perfect binary codes capable of correcting equal multiple deletions. 2021 IEEE International Symposium on Information Theory (ISIT). 2021. 2661-2665
A family of perfectness of the Levenshtein codes $ L_a(n;2n) $,. 2020 International Symposium on Information Theory and Its Applications (ISITA). 2020. 131-135
Order structure of shapes of predominant integral weights and cylindric Young diagrams,. Séminaire Lotharingien de Combinatoire. 2020. 84B. Article #75
NAKADA KENTO. GENERALIZATION OF YOUNG DIAGRAMS AND HOOK FORMULA (Algebraic Combinatorics related to Young diagram and statistical physics). 数理解析研究所講究録. 2014. 1913. 1913. 106-111
仲田 研登, Okamura Shuji. A probabilistic algorithm which generates standard tableaux of a generalized Young diagram (等質空間と非可換調和解析--RIMS研究集会報告集). 数理解析研究所講究録. 2010. 1722. 1722. 31-37
仲田 研登. q-hook formula of Gansner type for a generalized young diagram (Algebraic combinatorics and related groups and algebras). 数理解析研究所講究録. 2010. 1687. 1687. 63-70
仲田 研登. An algorithm which generates standard tableaux for a shifted Young diagram with uniform probability (表現論と組合せ論--RIMS研究集会報告集). 数理解析研究所講究録. 2010. 1689. 1689. 26-32