| 2004 |
|---|
| 11 | EE | Kosaburo Hashiguchi,
Naoto Sakakibara,
Shuji Jimbo:
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
Theor. Comput. Sci. 312(2-3): 251-266 (2004) |
| 2003 |
|---|
| 10 | EE | Kosaburo Hashiguchi,
Yoshito Wada,
Shuji Jimbo:
Regular binoid expressions and regular binoid languages.
Theor. Comput. Sci. 1-3(304): 291-313 (2003) |
| 2002 |
|---|
| 9 | EE | Kosaburo Hashiguchi,
Kenichi Ishiguro,
Shuji Jimbo:
Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata.
IJAC 12(3): 445 (2002) |
| 8 | | Kosaburo Hashiguchi,
Takahiro Kunai,
Shuji Jimbo:
Finite Codes over Free Binoids.
Journal of Automata, Languages and Combinatorics 7(4): 505-518 (2002) |
| 2000 |
|---|
| 7 | | Kosaburo Hashiguchi,
Shin Ichihara,
Shuji Jimbo:
Formal Languages over Free Bionoids.
Journal of Automata, Languages and Combinatorics 5(3): 219-234 (2000) |
| 1996 |
|---|
| 6 | | Shuji Jimbo,
Akira Maruoka:
A Method of Constructing Selection Networks with O(log n) Depth.
SIAM J. Comput. 25(4): 709-739 (1996) |
| 1994 |
|---|
| 5 | | Shuji Jimbo,
Akira Maruoka:
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph.
Inf. Process. Lett. 50(5): 277-282 (1994) |
| 4 | | Shuji Jimbo,
Akira Maruoka:
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
Inf. Process. Lett. 51(1): 17-23 (1994) |
| 1992 |
|---|
| 3 | | Shuji Jimbo,
Akira Maruoka:
Selection Networks with 8n log2n Size and O(log n) Depth.
ISAAC 1992: 165-174 |
| 1987 |
|---|
| 2 | | Shuji Jimbo,
Akira Maruoka:
Expanders obtained from affine transformations.
Combinatorica 7(4): 343-355 (1987) |
| 1985 |
|---|
| 1 | | Shuji Jimbo,
Akira Maruoka:
Expanders Obtained from Affine Transformations (Preliminary Version)
STOC 1985: 88-97 |
