Expanders Obtained from Affine Transformations (Preliminary Version) - Shuji Jimbo; Akira Maruoka (STOC, 1985)

Expanders obtained from affine transformations. - Shuji Jimbo; Akira Maruoka (Comb., 1987)

Selection Networks with 8n log2n Size and O(log n) Depth. - Shuji Jimbo; Akira Maruoka (ISAAC, 1992)

On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. - Shuji Jimbo; Akira Maruoka (Inf. Process. Lett., 1994)

On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. - Shuji Jimbo; Akira Maruoka (Inf. Process. Lett., 1994)

Approximation of the size of the union. - Shuji Jimbo; Akira Maruoka (Syst. Comput. Jpn., 1996)

A Method of Constructing Selection Networks with O(log n) Depth. - Shuji Jimbo; Akira Maruoka (SIAM J. Comput., 1996)

Formal Languages over Free Binoids. - Kosaburo Hashiguchi; Shin Ichihara; Shuji Jimbo (J. Autom. Lang. Comb., 2000)

Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata. - Kosaburo Hashiguchi; Kenichi Ishiguro; Shuji Jimbo (Int. J. Algebra Comput., 2002)

Finite Codes over Free Binoids. - Kosaburo Hashiguchi; Takahiro Kunai; Shuji Jimbo (J. Autom. Lang. Comb., 2002)

Regular binoid expressions and regular binoid languages. - Kosaburo Hashiguchi; Yoshito Wada; Shuji Jimbo (Theor. Comput. Sci., 2003)

Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. - Kosaburo Hashiguchi; Naoto Sakakibara; Shuji Jimbo (Theor. Comput. Sci., 2004)

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver. - Shuji Jimbo; Akira Maruoka (WALCOM, 2019)

Band-restricted diagonally dominant matrices: Computational complexity and application. - Norikazu Takahashi; Daiki Hirata; Shuji Jimbo; Hiroaki Yamamoto (J. Comput. Syst. Sci., 2019)