We stand with Ukraine  

Kosaku Nagasaka

Orcid: 0009-0009-4764-8836

According to our database1, Kosaku Nagasaka authored at least 23 papers between 2002 and 2023.

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

2023
Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters.
[BibTeX]
[DOI]
Kosaku Nagasaka
,
Ryo Oshimatani
ACM Commun. Comput. Algebra, September, 2023

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021
Toward the best algorithm for approximate GCD of univariate polynomials.
[BibTeX]
[DOI]
Kosaku Nagasaka
J. Symb. Comput., 2021

Approximate square-free part and decomposition.
[BibTeX]
[DOI]
Kosaku Nagasaka
J. Symb. Comput., 2021

Approximate GCD by relaxed NewtonSLRA algorithm.
[BibTeX]
[DOI]
Kosaku Nagasaka
ACM Commun. Comput. Algebra, 2021

Relaxed NewtonSLRA for Approximate GCD.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020
Approximate GCD by bernstein basis, and its applications.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2017
Seeking better algorithms for approximate GCD.
[BibTeX]
[DOI]
Kosaku Nagasaka
ACM Commun. Comput. Algebra, 2017

Parametric Greatest Common Divisors using Comprehensive Gröbner Systems.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra.
[BibTeX]
[DOI]
Kosaku Nagasaka
,
Ágnes Szántó
,
Franz Winkler
J. Symb. Comput., 2016

2013
Revisiting QRGCD and comparison with ExQRGCD.
[BibTeX]
[DOI]
Kosaku Nagasaka
,
Takaaki Masui
ACM Commun. Comput. Algebra, 2013

Extended QRGCD Algorithm.
[BibTeX]
[DOI]
Kosaku Nagasaka
,
Takaaki Masui
Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012
Backward error analysis of approximate Gröbner basis.
[BibTeX]
[DOI]
Kosaku Nagasaka
ACM Commun. Comput. Algebra, 2012

2011
An improvement in the lattice construction process of approximate polynomial GCD over integers.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the SNC 2011, 2011

Computing a structured Gröbner basis approximately.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2009
A Study on Gröbner Basis with Inexact Input.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008
Approximate polynomial GCD over integers.
[BibTeX]
[DOI]
Kosaku Nagasaka
ACM Commun. Comput. Algebra, 2008

2007
SNAP package for Mathematica.
[BibTeX]
[DOI]
Kosaku Nagasaka
ACM Commun. Comput. Algebra, 2007

Ruppert Matrix as Subresultant Mapping.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2005
Towards More Accurate Separation Bounds of Empirical Polynomials II.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

On the Degeneracy Conditions of Singularities by Using Comprehensive Gröbner Bases.
[BibTeX]
Tadashi Takahashi
,
Kosaku Nagasaka
Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004
Towards more accurate separation bounds of empirical polynomials.
[BibTeX]
[DOI]
Kosaku Nagasaka
SIGSAM Bull., 2004

2002
Towards certified irreducibility testing of bivariate approximate polynomials.
[BibTeX]
[DOI]
Kosaku Nagasaka
Proceedings of the Symbolic and Algebraic Computation, 2002


  Loading...