Shuji Jimbo

15 papers A* 1B 2Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
Band-restricted diagonally dominant matrices: Computational complexity and application.
J. Comput. Syst. Sci.
Norikazu Takahashi, Daiki Hirata, Shuji Jimbo, Hiroaki Yamamoto
2019 B conf
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver.
WALCOM
Shuji Jimbo, Akira Maruoka
2004 J jnl
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
Theor. Comput. Sci.
Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo
2003 J jnl
Regular binoid expressions and regular binoid languages.
Theor. Comput. Sci.
Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo
2002 J jnl
Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata.
Int. J. Algebra Comput.
Kosaburo Hashiguchi, Kenichi Ishiguro, Shuji Jimbo
2002 J jnl
Finite Codes over Free Binoids.
J. Autom. Lang. Comb.
Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo
2001 — conf
Finite Codes over Free Binoids.
DCFS
Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo
2000 J jnl
Formal Languages over Free Binoids.
J. Autom. Lang. Comb.
Kosaburo Hashiguchi, Shin Ichihara, Shuji Jimbo
1996 J jnl
A Method of Constructing Selection Networks with O(log n) Depth.
SIAM J. Comput.
Shuji Jimbo, Akira Maruoka
1996 J jnl
Approximation of the size of the union.
Syst. Comput. Jpn.
Shuji Jimbo, Akira Maruoka
1994 J jnl
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph.
Inf. Process. Lett.
Shuji Jimbo, Akira Maruoka
1994 J jnl
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
Inf. Process. Lett.
Shuji Jimbo, Akira Maruoka
1992 B conf
Selection Networks with 8
ISAAC
Shuji Jimbo, Akira Maruoka
1987 J jnl
Expanders obtained from affine transformations.
Comb.
Shuji Jimbo, Akira Maruoka
1985 A* conf
Expanders Obtained from Affine Transformations (Preliminary Version)
STOC
Shuji Jimbo, Akira Maruoka