Shuji Jimbo

Orcid: 0000-0002-8331-9556

According to our database1, Shuji Jimbo authored at least 14 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Band-restricted diagonally dominant matrices: Computational complexity and application.
J. Comput. Syst. Sci., 2019

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2004
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids.
Theor. Comput. Sci., 2004

2003
Regular binoid expressions and regular binoid languages.
Theor. Comput. Sci., 2003

2002
Finite Codes over Free Binoids.
J. Autom. Lang. Comb., 2002

Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata.
Int. J. Algebra Comput., 2002

2000
Formal Languages over Free Binoids.
J. Autom. Lang. Comb., 2000

1996
A Method of Constructing Selection Networks with O(log n) Depth.
SIAM J. Comput., 1996

Approximation of the size of the union.
Syst. Comput. Jpn., 1996

1994
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
Inf. Process. Lett., 1994

On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph.
Inf. Process. Lett., 1994

1992
Selection Networks with 8<i>n</i> log<sub>2</sub><i>n</i> Size and <i>O</i>(log <i>n</i>) Depth.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1987
Expanders obtained from affine transformations.
Comb., 1987

1985
Expanders Obtained from Affine Transformations (Preliminary Version)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985


  Loading...