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)

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

Computation of replicable functions on Risa/Asir. - Masayuki Noro; John McKay 001 (PASCO, 1997)

Efficient Implementation of Schoof's Algorithm. - Tetsuya Izu; Jun Kogure; Masayuki Noro; Kazuhiro Yokoyama (ASIACRYPT, 1998)

Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm. - Tetsuya Izu; Jun Kogure; Masayuki Noro; Kazuhiro Yokoyama (Public Key Cryptography, 1998)

A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals. - Masayuki Noro; Kazuhiro Yokoyama (J. Symb. Comput., 1999)

Yet another practical implementation of polynomial factorization over finite fields. - Masayuki Noro; Kazuhiro Yokoyama (ISSAC, 2002)

A Computer Algebra System: Risa/Asir. - Masayuki Noro (Algebra, Geometry, and Software Systems, 2003)

Implementation of prime decomposition of polynomial ideals over small finite fields. - Masayuki Noro; Kazuhiro Yokoyama (SIGSAM Bull., 2003)

Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction. - Yasuhito Kawano; Kinji Kimura; Hiroshi Sekigawa; Masayuki Noro; Kiyoshi Shirayanagi; Masahiro Kitagawa; Masanao Ozawa (Quantum Inf. Process., 2005)

An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields. - Masayuki Noro (ICMS, 2006)

Links to Projects. Mathematical Software, icms2006 - Developer's Meeting. - Masayuki Noro; Nobuki Takayama (ICMS, 2006)

Modular dynamic evaluation. - Masayuki Noro (ISSAC, 2006)

Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation. - Yosuke Kurata; Masayuki Noro (ISSAC, 2007)

Confluence of Swallowtail Singularities of the Hyperbolic Schwarz Map Defined by the Hypergeometric Differential Equation. - Masayuki Noro; Takeshi Sasaki; Kotaro Yamada; Masaaki Yoshida (Exp. Math., 2008)

Modular Algorithms for Computing a Generating Set of the Syzygy Module. - Masayuki Noro (CASC, 2009)

New Algorithms for Computing Primary Decomposition of Polynomial Ideals. - Masayuki Noro (ICMS, 2010)

Stratification associated with local b-functions. - Kenta Nishiyama; Masayuki Noro (J. Symb. Comput., 2010)

Holonomic gradient descent and its application to the Fisher-Bingham integral. - Hiromasa Nakayama; Kenta Nishiyama; Masayuki Noro; Katsuyoshi Ohara; Tomonari Sei; Nobuki Takayama; Akimichi Takemura (Adv. Appl. Math., 2011)

Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. - Taro Kawazoe; Masayuki Noro (J. Symb. Comput., 2011)

Verification of Gröbner Basis Candidates. - Masayuki Noro; Kazuhiro Yokoyama (ICMS, 2014)

System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions. - Masayuki Noro (ISSAC, 2016)

Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals. - Toru Aoyama; Masayuki Noro (ISSAC, 2018)

Usage of Modular Techniques for Efficient Computation of Ideal Operations. - Masayuki Noro; Kazuhiro Yokoyama (Math. Comput. Sci., 2018)