default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKosaku Nagasaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Kosaku Nagasaka:
Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation. J. Symb. Comput. 127: 102368 (2025)- 2023
- [j12]Kosaku Nagasaka, Ryo Oshimatani:
Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters. ACM Commun. Comput. Algebra 57(3): 160-164 (2023) - [c12]Kosaku Nagasaka
:
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials. ISSAC 2023: 470-479 - 2021
- [j11]Kosaku Nagasaka:
Approximate GCD by relaxed NewtonSLRA algorithm. ACM Commun. Comput. Algebra 55(3): 97-101 (2021) - [j10]Kosaku Nagasaka:
Approximate square-free part and decomposition. J. Symb. Comput. 104: 402-418 (2021) - [j9]Kosaku Nagasaka:
Toward the best algorithm for approximate GCD of univariate polynomials. J. Symb. Comput. 105: 4-27 (2021) - [c11]Kosaku Nagasaka:
Relaxed NewtonSLRA for Approximate GCD. CASC 2021: 272-292 - 2020
- [c10]Kosaku Nagasaka:
Approximate GCD by bernstein basis, and its applications. ISSAC 2020: 372-379
2010 – 2019
- 2017
- [j8]Kosaku Nagasaka:
Seeking better algorithms for approximate GCD. ACM Commun. Comput. Algebra 51(1): 15-17 (2017) - [c9]Kosaku Nagasaka:
Parametric Greatest Common Divisors using Comprehensive Gröbner Systems. ISSAC 2017: 341-348 - 2016
- [j7]Kosaku Nagasaka, Ágnes Szántó, Franz Winkler:
Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra. J. Symb. Comput. 75: 1-3 (2016) - 2014
- [e1]Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, Ágnes Szántó:
International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014. ACM 2014, ISBN 978-1-4503-2501-1 [contents] - 2013
- [j6]Kosaku Nagasaka, Takaaki Masui:
Revisiting QRGCD and comparison with ExQRGCD. ACM Commun. Comput. Algebra 47(3/4): 88-89 (2013) - [c8]Kosaku Nagasaka, Takaaki Masui:
Extended QRGCD Algorithm. CASC 2013: 257-272 - 2012
- [j5]Kosaku Nagasaka:
Backward error analysis of approximate Gröbner basis. ACM Commun. Comput. Algebra 46(3/4): 116-117 (2012) - 2011
- [j4]Kosaku Nagasaka:
Approximate polynomial GCD over integers. J. Symb. Comput. 46(12): 1306-1317 (2011) - [c7]Kosaku Nagasaka:
Computing a structured Gröbner basis approximately. ISSAC 2011: 273-280 - [c6]Kosaku Nagasaka:
An improvement in the lattice construction process of approximate polynomial GCD over integers. SNC 2011: 63-64
2000 – 2009
- 2009
- [c5]Kosaku Nagasaka:
A Study on Gröbner Basis with Inexact Input. CASC 2009: 247-258 - 2008
- [j3]Kosaku Nagasaka:
Approximate polynomial GCD over integers. ACM Commun. Comput. Algebra 42(3): 124-126 (2008) - 2007
- [j2]Kosaku Nagasaka:
SNAP package for Mathematica. ACM Commun. Comput. Algebra 41(3): 105-106 (2007) - [c4]Kosaku Nagasaka:
Ruppert Matrix as Subresultant Mapping. CASC 2007: 316-327 - 2005
- [c3]Tadashi Takahashi, Kosaku Nagasaka:
On the Degeneracy Conditions of Singularities by Using Comprehensive Gröbner Bases. Algorithmic Algebra and Logic 2005: 253-256 - [c2]Kosaku Nagasaka:
Towards More Accurate Separation Bounds of Empirical Polynomials II. CASC 2005: 318-329 - 2004
- [j1]Kosaku Nagasaka:
Towards more accurate separation bounds of empirical polynomials. SIGSAM Bull. 38(4): 119-129 (2004) - 2002
- [c1]Kosaku Nagasaka:
Towards certified irreducibility testing of bivariate approximate polynomials. ISSAC 2002: 192-199
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-12-09 23:11 CET 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:
