Chained Declustering using Multiple Conventional Filesystems. - Koichi Konishi; Kentaro Kikuchi; Hideki Kawai; Kunihiko Kojima; Ken'ichi Ohmachi; Susumu Akamine; Toshikazu Fukushima (CLUSTER, 2000)

Sequent Calculi for Visser's Propositional Logics. - Katsumasa Ishii; Ryo Kashima; Kentaro Kikuchi (Notre Dame J. Formal Log., 2001)

Dual-Context Sequent Calculus and Strict Implication. - Kentaro Kikuchi (Math. Log. Q., 2002)

A Cut-Free Gentzen Formulation of Basic Propositional Calculus. - Kentaro Kikuchi; Katsumi Sasaki (J. Log. Lang. Inf., 2003)

A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus. - Kentaro Kikuchi (FLOPS, 2004)

On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. - Kentaro Kikuchi (LPAR, 2006)

Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus. - Kentaro Kikuchi (CiE, 2007)

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi. - Kentaro Kikuchi (RTA, 2007)

Tree-Sequent Methods for Subintuitionistic Predicate Logics. - Ryo Ishigaki; Kentaro Kikuchi (TABLEAUX, 2007)

A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic. - Ryo Ishigaki; Kentaro Kikuchi (Log. J. IGPL, 2007)

Strong Normalisation of Cut-Elimination That Simulates beta-Reduction. - Kentaro Kikuchi; Stéphane Lengrand (FoSSaCS, 2008)

Call-by-name reduction and cut-elimination in classical logic. - Kentaro Kikuchi (Ann. Pure Appl. Log., 2008)

Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus. - Kentaro Kikuchi (CSL, 2013)

A Translation of Intersection and Union Types for the λμ-Calculus. - Kentaro Kikuchi; Takafumi Sakurai (APLAS, 2014)

Uniform Proofs of Normalisation and Approximation for Intersection Types. - Kentaro Kikuchi (ITRS, 2014)

Correctness of Context-Moving Transformations for Term Rewriting Systems. - Koichi Sato; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (LOPSTR, 2015)

Confluence of Orthogonal Nominal Rewriting Systems Revisited. - Takaki Suzuki; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (RTA, 2015)

Nominal Confluence Tool. - Takahito Aoto 001; Kentaro Kikuchi (IJCAR, 2016)

Critical Pair Analysis in Nominal Rewriting. - Takaki Suzuki; Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (SCSS, 2016)

Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems. - Kentaro Kikuchi; Takahito Aoto 001; Yoshihito Toyama (FroCoS, 2017)

Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation. - Kentaro Kikuchi; Takahito Aoto 001; Isao Sasano (PPDP, 2019)

Confluence and Commutation for Nominal Rewriting Systems with Atom-Variables. - Kentaro Kikuchi; Takahito Aoto 001 (LOPSTR, 2020)

Polymorphic computation systems: Theory and practice of confluence with call-by-value. - Makoto Hamana; Tatsuya Abe 001; Kentaro Kikuchi (Sci. Comput. Program., 2020)

Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. - Kentaro Kikuchi; Takahito Aoto 001 (FSTTCS, 2021)

A Proof Method for Local Sufficient Completeness of Term Rewriting Systems. - Tomoki Shiraishi; Kentaro Kikuchi; Takahito Aoto 001 (ICTAC, 2021)

Money flow network among firms' accounts in a regional bank of Japan. - Yoshi Fujiwara; Hiroyasu Inoue; Takayuki Yamaguchi; Hideaki Aoyama; Takuma Tanaka; Kentaro Kikuchi (EPJ Data Sci., 2021)

Ground Confluence and Strong Commutation Modulo Alpha-Equivalence in Nominal Rewriting. - Kentaro Kikuchi (ICTAC, 2022)

Characterizations of Partial Well-Behaved Lenses. - Keishi Hashiba; Keisuke Nakano 001; Kazuyuki Asada; Kentaro Kikuchi (PEPM, 2025)