|
Search the dblp DataBase
Masayuki Noro:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
Efficient Implementation of Schoof's Algorithm. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 1998, pp:66-79 [Conf]
- Masayuki Noro
A Computer Algebra System: Risa/Asir. [Citation Graph (0, 0)][DBLP] Algebra, Geometry, and Software Systems, 2003, pp:147-162 [Conf]
- Masayuki Noro
An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP] ICMS, 2006, pp:99-109 [Conf]
- Masayuki Noro, Nobuki Takayama
Links to Projects. Mathematical Software, icms2006 - Developer's Meeting. [Citation Graph (0, 0)][DBLP] ICMS, 2006, pp:438-450 [Conf]
- Masayuki Noro, Taku Takeshima
Risa/Asir - a Computer Algebra System. [Citation Graph (0, 0)][DBLP] ISSAC, 1992, pp:387-396 [Conf]
- Masayuki Noro, Kazuhiro Yokoyama
Yet another practical implementation of polynomial factorization over finite fields. [Citation Graph (0, 0)][DBLP] ISSAC, 2002, pp:200-206 [Conf]
- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
On Determining the Solvability of Polynomials. [Citation Graph (0, 0)][DBLP] ISSAC, 1990, pp:127-134 [Conf]
- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). [Citation Graph (0, 0)][DBLP] ISSAC, 1990, pp:297- [Conf]
- Masayuki Noro
Modular dynamic evaluation. [Citation Graph (0, 0)][DBLP] ISSAC, 2006, pp:262-268 [Conf]
- Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm. [Citation Graph (0, 0)][DBLP] Public Key Cryptography, 1998, pp:253-257 [Conf]
- Masayuki Noro, Kazuhiro Yokoyama
Implementation of prime decomposition of polynomial ideals over small finite fields. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2004, v:38, n:4, pp:1227-1246 [Journal]
- Masayuki Noro, Kazuhiro Yokoyama
A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1999, v:28, n:1-2, pp:243-263 [Journal]
- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Computing Primitive Elements of Extension Fields. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:8, n:6, pp:553-580 [Journal]
- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1992, v:14, n:4, pp:399-417 [Journal]
- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1994, v:17, n:6, pp:545-563 [Journal]
- Yosuke Kurata, Masayuki Noro
Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation. [Citation Graph (0, 0)][DBLP] ISSAC, 2007, pp:243-250 [Conf]
Modular Algorithms for Computing a Generating Set of the Syzygy Module. [Citation Graph (, )][DBLP]
New Algorithms for Computing Primary Decomposition of Polynomial Ideals. [Citation Graph (, )][DBLP]
Holonomic Gradient Descent and its Application to Fisher-Bingham Integral [Citation Graph (, )][DBLP]
Search in 0.021secs, Finished in 0.023secs
|