default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasayuki Noro
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j12]Masayuki Noro, Kazuhiro Yokoyama:
Usage of Modular Techniques for Efficient Computation of Ideal Operations. Math. Comput. Sci. 12(1): 1-32 (2018)- [c17]Toru Aoyama, Masayuki Noro:
Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals. ISSAC 2018: 31-38 - 2016
- [c16]Masayuki Noro:
System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions. ISSAC 2016: 381-388 - 2014
- [c15]Masayuki Noro, Kazuhiro Yokoyama:
Verification of Gröbner Basis Candidates. ICMS 2014: 419-424 - 2011
- [j11]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): 639-658 (2011) - [j10]Taro Kawazoe, Masayuki Noro:
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. J. Symb. Comput. 46(10): 1158-1172 (2011) - 2010
- [j9]Kenta Nishiyama, Masayuki Noro:
Stratification associated with local b-functions. J. Symb. Comput. 45(4): 462-480 (2010) - [c14]Masayuki Noro:
New Algorithms for Computing Primary Decomposition of Polynomial Ideals. ICMS 2010: 233-244 - [i1]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 abs/1005.5273 (2010)
2000 – 2009
- 2009
- [c13]Masayuki Noro:
Modular Algorithms for Computing a Generating Set of the Syzygy Module. CASC 2009: 259-268 - 2008
- [j8]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): 191-204 (2008) - 2007
- [c12]Yosuke Kurata, Masayuki Noro:
Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation. ISSAC 2007: 243-250 - 2006
- [c11]Masayuki Noro:
An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields. ICMS 2006: 99-109 - [c10]Masayuki Noro, Nobuki Takayama:
Links to Projects. Mathematical Software, icms2006 - Developer's Meeting. ICMS 2006: 438-450 - [c9]Masayuki Noro:
Modular dynamic evaluation. ISSAC 2006: 262-268 - 2005
- [j7]Yasuhito Kawano, Kinji Kimura, Hiroshi Sekigawa, Masayuki Noro, Kiyoshi Shirayanagi, Masahiro Kitagawa, Masanao Ozawa:
Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction. Quantum Inf. Process. 4(2): 65-85 (2005) - 2004
- [j6]Masayuki Noro, Kazuhiro Yokoyama:
Implementation of prime decomposition of polynomial ideals over small finite fields. J. Symb. Comput. 38(4): 1227-1246 (2004) - 2003
- [j5]Masayuki Noro, Kazuhiro Yokoyama:
Implementation of prime decomposition of polynomial ideals over small finite fields. SIGSAM Bull. 37(3): 81-82 (2003) - [c8]Masayuki Noro:
A Computer Algebra System: Risa/Asir. Algebra, Geometry, and Software Systems 2003: 147-162 - 2002
- [c7]Masayuki Noro, Kazuhiro Yokoyama:
Yet another practical implementation of polynomial factorization over finite fields. ISSAC 2002: 200-206
1990 – 1999
- 1999
- [j4]Masayuki Noro, Kazuhiro Yokoyama:
A Modular Method to Compute the Rational Univariate Representation of Zero-dimensional Ideals. J. Symb. Comput. 28(1-2): 243-263 (1999) - 1998
- [c6]Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama:
Efficient Implementation of Schoof's Algorithm. ASIACRYPT 1998: 66-79 - [c5]Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama:
Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm. Public Key Cryptography 1998: 253-257 - 1997
- [c4]Masayuki Noro, John McKay:
Computation of replicable functions on Risa/Asir. PASCO 1997: 130-138 - 1994
- [j3]Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima:
Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials. J. Symb. Comput. 17(6): 545-563 (1994) - 1992
- [j2]Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima:
Solutions of Systems of Algebraic Equations and Linear Maps on Residue Class Rings. J. Symb. Comput. 14(4): 399-417 (1992) - [c3]Masayuki Noro, Taku Takeshima:
Risa/Asir - a Computer Algebra System. ISSAC 1992: 387-396 - 1990
- [c2]Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima:
On Determining the Solvability of Polynomials. ISSAC 1990: 127-134 - [c1]Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima:
On Factoring Multi-Variate Polynomials over Algebraically Closed Fields (abstract). ISSAC 1990: 297
1980 – 1989
- 1989
- [j1]Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima:
Computing Primitive Elements of Extension Fields. J. Symb. Comput. 8(6): 553-580 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
