Masayuki Noro

According to our database1, Masayuki Noro authored at least 28 papers between 1989 and 2018.

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

2018
Usage of Modular Techniques for Efficient Computation of Ideal Operations.
Math. Comput. Sci., 2018

Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2016
System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2014
Verification of Gröbner Basis Candidates.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2011
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components.
J. Symb. Comput., 2011

Holonomic gradient descent and its application to the Fisher-Bingham integral.
Adv. Appl. Math., 2011

2010
Stratification associated with local b-functions.
J. Symb. Comput., 2010

New Algorithms for Computing Primary Decomposition of Polynomial Ideals.
Proceedings of the Mathematical Software, 2010

2009
Modular Algorithms for Computing a Generating Set of the Syzygy Module.
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008
Confluence of Swallowtail Singularities of the Hyperbolic Schwarz Map Defined by the Hypergeometric Differential Equation.
Exp. Math., 2008

2007
Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006
Modular dynamic evaluation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Links to Projects. Mathematical Software, icms2006 - Developer's Meeting.
Proceedings of the Mathematical Software, 2006

An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields.
Proceedings of the Mathematical Software, 2006

2005
Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction.
Quantum Inf. Process., 2005

2003
Implementation of prime decomposition of polynomial ideals over small finite fields.
SIGSAM Bull., 2003

A Computer Algebra System: Risa/Asir.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002
Yet another practical implementation of polynomial factorization over finite fields.
Proceedings of the Symbolic and Algebraic Computation, 2002

1999
A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals.
J. Symb. Comput., 1999

1998
Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm.
Proceedings of the Public Key Cryptography, 1998

Efficient Implementation of Schoof's Algorithm.
Proceedings of the Advances in Cryptology, 1998

1997
Computation of replicable functions on Risa/Asir.
Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, 1997

1994
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials.
J. Symb. Comput., 1994

1992
Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings.
J. Symb. Comput., 1992

Risa/Asir - a Computer Algebra System.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

1990
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract).
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

On Determining the Solvability of Polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1989
Computing Primitive Elements of Extension Fields.
J. Symb. Comput., 1989


  Loading...