en:publications

This translation is older than the original page and might be outdated. See what has changed.

Publications

Here is the list of my pulications, classified into as follows:

  • Original articles
  • Oral presentations at international conferences
  • Poster presentations at international conferences
  • Oral presentations at domestic conferences

I have tried to make publications of my researches available online as much as possible, with the following resources:

  • DOI (Digital Object Identifier): an identifier given permanently to the document on the internet. In most of the cases it is the link to the primary resource of the article. Downloading the article may be restricted upon subscription of online resources (journals or proceedings).
  • E-print archive: Archives used to submit refereed articles before publication. Free access to the submissions. According to copyright policies of each journals, I submit manuscripts of nearby versions to the published forms. arXiv is one of the most well-known e-print archive.
  • Institutional repository: e-print archives run by universities and other research institutions, for storing and publishing research results developed in their own institutions. I mainly use here for proceedings in conferences and articles written in Japanese.
  • Other: I post any other links for resources on the web.

Materials offline can be provided directly, with files or offprints. Please feel free to contact me.

  • N. Horigome, A. Terui, M. Mikawa. A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases. Proceedings of the 7th International Congress on Mathematical Software (ICMS 2020). Lecture Notes in Computer Science 12097, Springer, 2020, 3–13. [doi:10.1007/978-3-030-52200-1_1]
  • Y. Wada, T. Matsuzaki, A. Terui, N.H. Arai. An automated deduction and its implementation for solving problem of sequence at university entrance examination. Proceedings of the 5th International Congress on Mathematical Software (ICMS 2016). Lecture Notes in Computer Science 9725, Springer, 2016, 82–89. [doi:10.1007/978-3-319-42432-3_11]
  • K. Ohara, S. Tajima, A. Terui. Developing Linear Algebra Packages on Risa/Asir for Eigenproblems (Extended abstract). Proceedings of the 4th International Congress on Mathematical Software (ICMS 2014). Lecture Notes in Computer Science 8592, Springer, 2014, 321–324. [doi:10.1007/978-3-662-44199-2_50]
  • S. Tajima, K. Ohara, A. Terui. An Extension and Efficient Calculation of the Horner's Rule for Matrices (Extended abstract). Proceedings of the 4th International Congress on Mathematical Software (ICMS 2014). Lecture Notes in Computer Science 8592, Springer, 2014, 346–351. [doi:10.1007/978-3-662-44199-2_54]
  • A. Terui. GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theor. Comput. Sci. 2013, 479, 127–149. [doi:10.1016/j.tcs.2012.10.023] [arXiv:1207.0630]
  • A. Terui. “GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials.” Proceedings of the 12th International Workshop on Computer Algebra in Scientific Computing: CASC 2010, Lecture Notes in Computer Science, Springer, 6244, 2010, 238–249. [doi: 10.1007/978-3-642-15274-0_22] [arXiv:1007.1836]
  • A. Terui. “GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients.” Proceedings of the Joint Conference of ASCM 2009 and MACIS 2009, COE Lecture Note Vol. 22. Faculty of Mathematics, Kyushu University, 2009, 212–221. [arXiv:1007.1834] [http://hdl.handle.net/2324/16844]
  • T. Sasaki and A. Terui. “Computing Clustered Close-Roots of Univariate Polynomials.” Proceedings of The 3rd International Workshop on Symbolic-Numeric Computation (SNC 2009). ACM, 2009, 177–184. [doi:10.1145/1577190.1577217]
  • A. Terui. “An Iterative Method for Calculating Approximate GCD of Univariate Polynomials.” Proceedings of 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009). ACM, 2009, 351–358. [doi:10.1145/1576702.1576750] [http://hdl.handle.net/2241/103423]
  • J. Morita and A. Terui. Words, tilings and combinatorial spectra. Hiroshima Math. J. 2009, 39 (1), 37–60. [http://projecteuclid.org/euclid.hmj/1237392379]
  • A. Terui. Recursive Polynomial Remainder Sequence and its Subresultants. J. Algebra. 2008, 320, 633–659. [doi:10.1016/j.jalgebra.2007.12.023] [arXiv:0806.0495]
  • A. Terui. “Recursive Polynomial Remainder Sequence and the Nested Subresultants.” Proceedings of the 8th International Workshop on Computer Algebra in Scientific Computing (CASC 2005), Lecture Notes in Computer Science 3718. Springer, 2005, 445–456. [doi:10.1007/11555964_38] [arXiv:0806.0488]
  • A. Terui. “Subresultants in Recursive Polynomial Remainder Sequence.” Proceedings of the 6th International Workshop on Computer Algebra in Scientific Computing CASC 2003. Technische Universität Munchen, Germany, 2003, 363–375. [arXiv:0806.0478]
  • A. Terui and T. Sasaki. Durand-Kerner method for the real roots. Japan J. Indust. Appl. Math. 2002, 19 (1), 19–38. 10.1007/BF03167446]
  • A. Terui and T. Sasaki. “Approximate zero-points” of real univariate polynomial with large error terms. IPSJ J. 2000, 41 (4), 974–989. [http://ci.nii.ac.jp/naid/110002725305/en/]
  • T. Sasaki and A. Terui. A formula for separating small roots of a polynomial. ACM SIGSAM Bulletin. 2002, 36 (3), 19–23. [doi:10.1145/603273.603277]
  • N. Horigome, A. Terui, M. Mikawa. A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases. The 7th International Congress on Mathematical Software (ICMS 2020), Braunschweig, Germany (Online), July 13, 2020.
  • Y. Wada, T. Matsuzaki, A. Terui, N.H. Arai. An automated deduction and its implementation for solving problem of sequence at university entrance examination. The 5th International Congress on Mathematical Software (ICMS 2016), Berlin, Germany, July 11, 2016.
  • A. Terui. Towards simplified construction of subresultant matrix of multiple univariate polynomials. Dagstuhl Seminar 15251: Sparse modelling and multi-exponential analysis. Schloss Dagstuhl, June 18, 2015. [doi:10.4230/DagRep.5.6.48]]
  • K. Ohara, S. Tajima, A. Terui. Developing Linear Algebra Packages on Risa/Asir for Eigenproblems. The 4th International Congress on Mathematical Software (ICMS 2014). Seoul, Korea, August 9, 2014.
  • S. Tajima, K. Ohara, A. Terui. An Extension and Efficient Calculation of the Horner's Rule for Matrices. The 4th International Congress on Mathematical Software (ICMS 2014). Seoul, Korea, August 9, 2014.
  • A. Terui. GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials. The 12th International Workshop on Computer Algebra in Scientific Computing (CASC 2010), Tsakhkadzor, Armenia, September 9, 2010.
  • A. Terui. GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients. The Joint Conference of ASCM 2009 and MACIS 2009, Fukuoka, Japan, December 14, 2009.
  • T. Sasaki and A. Terui. Computing Clustered Close-Roots of Univariate Polynomials. The 3rd International Workshop on Symbolic-Numeric Computation (SNC 2009), Kyoto, Japan, August 5, 2009.
  • A. Terui. An Iterative Method for Calculating Approximate GCD of Univariate Polynomials. The 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009), Seoul, Republic of Korea, July 31, 2009.
  • T. Sasaki and A. Terui. Computing Close Roots in a Cluster of Univariate Polynomial. The 12th International Conference on Applications of Computer Algebra (ACA 2006), Varna, Bulgaria, June 27, 2006.
  • A. Terui. “Recursive Polynomial Remainder Sequence and the Nested Subresultants.” The 8th International Workshop on Computer Algebra in Scientific Computing (CASC 2005), Kalamata, Greece, September 13, 2005.
  • A. Terui. “Subresultants in Recursive Polynomial Remainder Sequence.” The 6th International Workshop on Compuer Algebra in Scientific Computing (CASC 2003), Passau, Germany, September 21, 2003.
  • T. Sasaki and A. Terui. A Formula for Separating Small Close Roots from Others. The 8th International Conference on Applications of Computer Algebra (ACA 2002), Volos, Greece, June 26, 2002.
  • A. Terui and T. Sasaki. “Approximate Zero-points” of Real Univariate Polynomial with Large Error Terms. The 4th International IMACS Conference on Applications of Computer Algebra (IMACS-ACA 1998), Prague, Czech Republic, August 10, 1998.
  • A. Terui. Calculating Approximate GCD of Multiple Univariate Polynomials using Approximate Syzygies. The 38th International Symposium on Symbolic and Algebraic Computation (ISSAC 2013), Boston, USA, June 26–29, 2013.
  • A. Terui. GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Poster presentation). The 2010 International Symposium on Symbolic and Algebraic Computation (ISSAC 2010), Munich, Germany, July 25–28, 2010.
  • A. Terui. An Iterative Method for Calculating Approximate GCD of Univariate Polynomials. The 11th International Workshop on Computer Algebra in Scientific Computing (CASC 2009), Kobe, Japan, September 13–17, 2009.
  • T. Sasaki, K. Shihara, A. Terui, Y. Ozaki, F. Kako. Approximate Algebraic Computation: Practice and Problems. The 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC 1997), Maui, Hawaii, USA, July 21–23, 1997. ACM SIGSAM Bulletin. 1997, 31 (3), 32. [doi:10.1145/271130.271184]

Most of presentations are in Japanese. For the list, please take a look at the Japanese page. English translation can be provided upon request.

  • en/publications.txt
  • Last modified: 2020/07/14 09:25
  • by aterui