Masayuki Noro

Publication Activity (10 Years)

Years Active: 1989-2018
Publications (10 Years): 3

Top Topics

Efficient Computation

Partial Differential Equations

Methods In Computer Vision

Aggregate Queries

Top Venues

Math. Comput. Sci.

Publications

Masayuki Noro, Kazuhiro Yokoyama
Usage of Modular Techniques for Efficient Computation of Ideal Operations. Math. Comput. Sci. 12 (1) (2018)
Toru Aoyama, Masayuki Noro
Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals. ISSAC (2018)
Masayuki Noro
System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions. ISSAC (2016)
Masayuki Noro, Kazuhiro Yokoyama
Verification of Gröbner Basis Candidates. ICMS (2014)
Taro Kawazoe, Masayuki Noro
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. J. Symb. Comput. 46 (10) (2011)
Hiromasa Nakayama, Kenta Nishiyama, Masayuki Noro, Katsuyoshi Ohara, Tomonari Sei, Nobuki Takayama, Akimichi Takemura
Holonomic gradient descent and its application to the Fisher-Bingham integral. Adv. Appl. Math. 47 (3) (2011)
Kenta Nishiyama, Masayuki Noro
Stratification associated with local b-functions. J. Symb. Comput. 45 (4) (2010)
Masayuki Noro
New Algorithms for Computing Primary Decomposition of Polynomial Ideals. ICMS (2010)
Tomonari Sei, Nobuki Takayama, Akimichi Takemura, Hiromasa Nakayama, Kenta Nishiyama, Masayuki Noro, Katsuyoshi Ohara
Holonomic Gradient Descent and its Application to Fisher-Bingham Integral CoRR (2010)
Masayuki Noro
Modular Algorithms for Computing a Generating Set of the Syzygy Module. CASC (2009)
Masayuki Noro, Takeshi Sasaki, Kotaro Yamada, Masaaki Yoshida
Confluence of Swallowtail Singularities of the Hyperbolic Schwarz Map Defined by the Hypergeometric Differential Equation. Exp. Math. 17 (2) (2008)
Yosuke Kurata, Masayuki Noro
Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation. ISSAC (2007)
Masayuki Noro, Nobuki Takayama
Links to Projects. Mathematical Software, icms2006 - Developer's Meeting. ICMS (2006)
Masayuki Noro
Modular dynamic evaluation. ISSAC (2006)
Masayuki Noro
An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields. ICMS (2006)
Masayuki Noro, Kazuhiro Yokoyama
Implementation of prime decomposition of polynomial ideals over small finite fields. J. Symb. Comput. 38 (4) (2004)
Masayuki Noro
A Computer Algebra System: Risa/Asir. Algebra, Geometry, and Software Systems (2003)
Masayuki Noro, Kazuhiro Yokoyama
Implementation of prime decomposition of polynomial ideals over small finite fields. SIGSAM Bull. 37 (3) (2003)
Masayuki Noro, Kazuhiro Yokoyama
Yet another practical implementation of polynomial factorization over finite fields. ISSAC (2002)
Masayuki Noro, Kazuhiro Yokoyama
A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals. J. Symb. Comput. 28 (1-2) (1999)
Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm. Public Key Cryptography (1998)
Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
Efficient Implementation of Schoof's Algorithm. ASIACRYPT (1998)
Masayuki Noro, John McKay
Computation of replicable functions on Risa/Asir. PASCO (1997)
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials. J. Symb. Comput. 17 (6) (1994)
Masayuki Noro, Taku Takeshima
Risa/Asir - a Computer Algebra System. ISSAC (1992)
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings. J. Symb. Comput. 14 (4) (1992)
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
On Determining the Solvability of Polynomials. ISSAC (1990)
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). ISSAC (1990)
Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Computing Primitive Elements of Extension Fields. J. Symb. Comput. 8 (6) (1989)