Contributions
 Project

 Papers

 K.Nagasaka. Mathematical thinking skills and automatic generation of ordering questions. Sushikisyori, Vol. 28(2), 2022, 95108. (Japanese)
 K.Nagasaka. Relaxed NewtonSLRA for Approximate GCD. Lecture Notes in Computer Science. Volume 12865. Computer Algebra in Scientific Computing: 23rd International Workshop, CASC 2021, Sochi, Russia, September 1317, 2021. Proceedings. Springer. 2021, 272292.
 K.Nagasaka. Approximate squarefree part and decomposition. Journal of Symbolic Computation, Vol. 104, 2021, Pages 402418.
 K.Nagasaka. Multiplechoice questions in Mathematics: automatic generation, revisited. Electronic Proceedings of the 25th Asian Technology Conference in Mathematics (ATCM2020), 2020. 2178512178515. (invited speaker).
 K.Nagasaka. Toward the best algorithm for approximate GCD of univariate polynomials. Journal of Symbolic Computation, Vol. 105, 2021, Pages 427.
 K.Nagasaka. Approximate GCD by Bernstein Basis, and its Applications. Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC2020), 2020. 372379.
 K.Nagasaka. Parametric Greatest Common Divisors using Comprehensive Groebner Systems. Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC2017), 2017. 341348.
 K.Nagasaka. Approximate Polynomial GCD over Integers with Digitswise Lattice. Communications of JSSAC. Vol. 2, 2016, Pages 1532.
 K.Nagasaka and T.Masui. Extended QRGCD Algorithm. Lecture Notes in Computer Science. Volume 8136. Computer Algebra in Scientific Computing: 15th International Workshop, CASC 2013, Berlin, Germany, September 913, 2013. Proceedings. Springer. 2013, 257272.
 K.Nagasaka. Approximate Polynomial GCD over Integers. Journal of Symbolic Computation, Vol. 46(12), 2011, Pages 13061317.
 K.Nagasaka. Computing a Structured Groebner Basis Approximately. Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC2011), 2011. 273280.
 K.Nagasaka. A Study on Groebner Basis with Inexact Input. Lecture Notes in Computer Science. Volume 5743. Computer Algebra in Scientific Computing: 11th International Workshop, CASC 2009, Kobe, Japan, September 1317, 2009. Proceedings. Springer Berlin. 2009, 247258.
 K.Nagasaka. Ruppert matrix as subresultant mapping. Lecture Notes in Computer Science. Volume 4770. Computer Algebra in Scientific Computing: 10th International Workshop, CASC 2007, Bonn, Germany, September 1620, 2007. Proceedings. Springer Berlin. 2007, 316327.
 K.Nagasaka. SymbolicNumeric Algebra for Polynomials. The Mathematica Journal, Vol. 10(3), 2007, 593616.
 K.Nagasaka. Using Coefficientwise Tolerance in SymbolicNumeric Algorithms for Polynomials. Sushikisyori, Vol. 12(3), 2006, 2130.
 K.Nagasaka. Towards More Accurate Separation Bounds of Empirical Polynomials II. Lecture Notes in Computer Science. Volume 3718. Computer Algebra in Scientific Computing: 8th International Workshop, CASC 2005, Kalamata, Greece, September 1216, 2005. Proceedings. SpringerVerlag. 2005, 318329.
 K.Nagasaka. Towards More Accurate Separation Bounds of Empirical Polynomials. ACM SIGSAM Bulletin, Formally Reviewed Articles, Vol. 38(4), 2004, 119129.
 K.Nagasaka. SNAP Package for Mathematica and Its Applications. Proc. The Ninth Asian Technology Conference in Mathematics (ATCM2004), 2004. 308316.
 K.Nagasaka. Neighborhood Irreducibility Testing of Multivariate Polynomials. Proc. Computer Algebra in Scientific Computing (CASC2003), 2003. 283292.
 K.Nagasaka. Towards Certified Irreducibility Testing of Bivariate Approximate Polynomials. Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC2002), 2002. 192199.
 K.Nagasaka. Estimation of Cancellation Errors in Multivariate Hensel Construction with FloatingPoint Numbers. Proc. The Sixth Asian Technology Conference in Mathematics (ATCM2001), 2001. 408415.
 Preprints

 Talks

 K.Nagasaka, R.Oshimatani. Groebner basis detection with parameters (Extended Abstract). Computer Algebra in Scientific Computing: 24th International Workshop, CASC 2022. 2226th August 2022.
 K.Nagasaka. Approximate GCD and Its Implementations. Milestones in Computer Algebra, MICA2016. 1618th July 2016.
 K.Nagasaka. A SymbolicNumeric Approach to Groebner Basis with Inexact Input.Fields Institute Workshop on Hybrid Methodologies for SymbolicNumeric Computation, Hybrid2011. 1619th November 2011.
 K.Nagasaka. An improvement in the lattice construction process of Approximate Polynomial GCD over Integers (Extended Abstract).Proc. SymbolicNumeric Computation (SNC2011), 2011. 6364.
 K.Nagasaka. Homomorphic Encryption and Approximate GCD of Integers and Polynomials over Integers. RIMS Workshop on Developments in Computer Algebra Research. 79th July 2010. ACM Communications in Computer Algebra, Vol. 45, No. 3, Issue 177. 165.
 K.Nagasaka. SNAP package for Mathematica. ISSAC 2007 Software Exhibitions. 29th July  1st Aug. 2007.
 Y. Kiriu, K. Nagasaka and T. Takahashi. Finding Mathematical Structures in Arts I. International Mathematica Symposium, IMS 2006. 1923th June 2006.
 K. Nagasaka. Mathematical Issues of Mathematica's BigFloat and Our Resolutions in SNAP Package. International Mathematica Symposium, IMS 2006. 1923th June 2006.
 K. Nagasaka. Irreducibility Radii. ARCC Workshop: The computational complexity of polynomial factorization. 1519th May 2006.
 K. Nagasaka. SNAP. International Mathematica Symposium, IMS 2005. 58th August 2005.
 K. Nagasaka. An implementation issue on SNAP and significant digits. Conference on Applications of Computer Algebra, ACA 2005. 31th July3th August 2005.
 T. Takahashi, K. Nagasaka. On the Degeneracy Conditions of Singularities by Using CGBs. Algorithmic Algebra and Logic 2005 (Conference in Honor of the 60th Birthday of Volker Weispfenning). 2005. Proc. A3L (2005), 253256.
Others (in Japanese) are only in available in Japanese page.
 Posters (including short communications)

 K.Nagasaka. Approximate GCD by relaxed NewtonSLRA algorithm. ISSAC 2021 Short communications. 18th  23rd July. 2021. ACM Communications in Computer Algebra. Vol. 55(3). 2021. 97101.
 K.Nagasaka. Seeking Better Algorithms for Approximate GCD. ISSAC 2016 Poster presentations. 19th  22th July. 2016. ACM Communications in Computer Algebra. Vol. 51(1). 2017. 1517.
 K.Nagasaka and T.Masui. Revisiting QRGCD and Comparison with ExQRGCD. ISSAC 2013 Poster presentations. 26th  29th June. 2013. ACM Communications in Computer Algebra. Vol. 47(3). 2013. 8889.
 K.Nagasaka. Backward error analysis of approximate Groebner basis. ISSAC 2012 Poster presentations. 22th  25th July. 2012. ACM Communications in Computer Algebra. Vol. 46(3). 2012. 116117.
 K.Nagasaka. Approximate Polynomial GCD over Integers. ISSAC 2008 Poster presentations. 20th  23th July. 2008. ACM Communications in Computer Algebra. Vol. 42(3). 2008. 124126. (Correction: Gelfond's bound should be Knuth's)
 Developments and Administrations

Only available in Japanese page.
 Productions

Only available in Japanese page.
 Editorial and Organizing activities


 Workshop: GCD and related topics, GCDART 2022. Chair.
 ISSAC 2022 (International Symposium on Symbolic and Algebraic Computation, 2022). Program Committee.
 Workshop: GCD and related topics, GCDART 2020. Chair.
 Workshop: GCD and related topics, GCDART 2018. Chair.
 2016 RIMS Joint Research: Developments in Computer Algebra. Chair.
 Journal of Symbolic Computation. Volume 75 (July 2016). Special issue on the conference ISSAC 2014. CoEditor.
 SNC 2014 (SymobolicNumeric Computation, 2014). Program Committee.
 ISSAC 2014 (International Symposium on Symbolic and Algebraic Computation, 2014). General CoChair and Local Chair.
 ASCM 2012 (Asian Symposium on Computer Mathematics, 2012). Program Committee.
 SNC 2011 (SymobolicNumeric Computation, 2011). Program Committee.
 CASC 2009 (Computer Algebra in Scientific Computing, 2009). Local Organizing Committee Chair.
 ISSAC 2009 (International Symposium on Symbolic and Algebraic Computation, 2009). Program Committee.
 ISSAC 2006 (International Symposium on Symbolic and Algebraic Computation, 2006). Poster and Software Demos CoChair.
 Maple Transactions. Associate Editor. 2021/06.
 ACM Communications in Computer Algebra. Associate Editor. 2016/08.
 Communications of JSSAC(Japan Society of Symbolic and Algebraic Computations). Editor. 2012/062014/05.
 Bulletin of the Japan Society for Symbolic and Algebraic Computation. Editor. 20102012/04.
 Educations and Positions

 May., 2009  present
 Associate Professor (Position changes but English translation does't change) at Division of Human Environment, Graduate School of Human Development and Environment, Kobe University.
 Apr., 2007  Apr., 2009
 Associate Professor (English translation changes) at Division of Human Environment, Graduate School of Human Development and Environment, Kobe University.
 Jun., 2005
 Encouragement Prize (Japan Society for Symbolic and Algebraic Computation)
 Apr., 2004  Mar., 2007
 Assistant Professor at Division of Mathematics and Informatics, Department of Science of Human Environment, Faculty of Human Development, Kobe University.
 Oct., 2002  Apr., 2004
 Research Associate at Media and Information Technology Center, Yamaguchi University.
 Apr., 2002  Sep., 2002
 Temporary Researcher at Venture Business Laboratory, University of Tsukuba.
 Mar., 2002
 Ph.D. (Science): Doctoral Program in Mathematics, University of Tsukuba.
 Jul., 1999  Sep., 1999
 Internship at Wolfram Research Inc.
 Mar., 1998
 M.S. (Science): Doctoral Program in Mathematics, University of Tsukuba.
