Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization. - Hajime Sawamura; Taku Takeshima (SLP, 1985)

Computing Primitive Elements of Extension Fields. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1989)

On Determining the Solvability of Polynomials. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (ISSAC, 1990)

On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (ISSAC, 1990)

Risa/Asir - a Computer Algebra System. - Masayuki Noro; Taku Takeshima (ISSAC, 1992)

Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1992)

On Hensel Construction of Eigenvalues and Eigenvectors of Matrices with Polynomial Entries. - Kazuhiro Yokoyama; Taku Takeshima (ISSAC, 1993)

Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials. - Kazuhiro Yokoyama; Masayuki Noro; Taku Takeshima (J. Symb. Comput., 1994)