Towards certified irreducibility testing of bivariate approximate polynomials. - Kosaku Nagasaka (ISSAC, 2002)

Towards more accurate separation bounds of empirical polynomials. - Kosaku Nagasaka (SIGSAM Bull., 2004)

On the Degeneracy Conditions of Singularities by Using Comprehensive Gröbner Bases. - Tadashi Takahashi; Kosaku Nagasaka (Algorithmic Algebra and Logic, 2005)

Towards More Accurate Separation Bounds of Empirical Polynomials II. - Kosaku Nagasaka (CASC, 2005)

Ruppert Matrix as Subresultant Mapping. - Kosaku Nagasaka (CASC, 2007)

SNAP package for Mathematica. - Kosaku Nagasaka (ACM Commun. Comput. Algebra, 2007)

Approximate polynomial GCD over integers. - Kosaku Nagasaka (ACM Commun. Comput. Algebra, 2008)

A Study on Gröbner Basis with Inexact Input. - Kosaku Nagasaka (CASC, 2009)

Computing a structured Gröbner basis approximately. - Kosaku Nagasaka (ISSAC, 2011)

An improvement in the lattice construction process of approximate polynomial GCD over integers. - Kosaku Nagasaka (SNC, 2011)

Backward error analysis of approximate Gröbner basis. - Kosaku Nagasaka (ACM Commun. Comput. Algebra, 2012)

Extended QRGCD Algorithm. - Kosaku Nagasaka; Takaaki Masui (CASC, 2013)

Revisiting QRGCD and comparison with ExQRGCD. - Kosaku Nagasaka; Takaaki Masui (ACM Commun. Comput. Algebra, 2013)

Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra. - Kosaku Nagasaka; Ágnes Szántó; Franz Winkler 001 (J. Symb. Comput., 2016)

Parametric Greatest Common Divisors using Comprehensive Gröbner Systems. - Kosaku Nagasaka (ISSAC, 2017)

Seeking better algorithms for approximate GCD. - Kosaku Nagasaka (ACM Commun. Comput. Algebra, 2017)

Approximate GCD by bernstein basis, and its applications. - Kosaku Nagasaka (ISSAC, 2020)

Relaxed NewtonSLRA for Approximate GCD. - Kosaku Nagasaka (CASC, 2021)

Approximate GCD by relaxed NewtonSLRA algorithm. - Kosaku Nagasaka (ACM Commun. Comput. Algebra, 2021)

Approximate square-free part and decomposition. - Kosaku Nagasaka (J. Symb. Comput., 2021)

Toward the best algorithm for approximate GCD of univariate polynomials. - Kosaku Nagasaka (J. Symb. Comput., 2021)

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials. - Kosaku Nagasaka (ISSAC, 2023)

Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters. - Kosaku Nagasaka; Ryo Oshimatani (ACM Commun. Comput. Algebra, 2023)

Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation. - Kosaku Nagasaka (J. Symb. Comput., 2025)