default search action
Akira Terui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Ryo Hatakeyama, Akira Terui, Masahiko Mikawa:
Towards trajectory planning of a robot manipulator with computer algebra using Bézier curves for obstacle avoidance. SCSS (Work in Progress) 2024: 21-27 - [c13]Kenta Kuramochi, Akira Terui, Masahiko Mikawa:
Solving estimation problems using minimax polynomials and Gröbner bases. SCSS (Work in Progress) 2024: 57-62 - [c12]Takumu Okazaki, Akira Terui, Masahiko Mikawa:
Towards trajectory planning for a 6-degree-of-freedom robot manipulator considering the orientation of the end-effector using computer algebra. SCSS (Work in Progress) 2024: 84-91 - [c11]Yusuke Shirato, Natsumi Oka, Akira Terui, Masahiko Mikawa:
An optimized path planning of manipulator with spline curves using real quantifier elimination based on comprehensive Gröbner systems. SCSS (Work in Progress) 2024: 105-112 - 2023
- [c10]Mizuki Yoshizawa, Akira Terui
, Masahiko Mikawa
Inverse Kinematics and Path Planning of Manipulator Using Real Quantifier Elimination Based on Comprehensive Gröbner Systems. CASC 2023: 393-419 - [i14]Ayane Ito, Takefumi Kasai, Akira Terui:
Computer-assisted proofs of "Kariya's theorem" with computer algebra. CoRR abs/2304.07491 (2023) - [i13]Mizuki Yoshizawa, Akira Terui, Masahiko Mikawa:
Inverse kinematics and path planning of manipulator using real quantifier elimination based on Comprehensive Gröbner Systems. CoRR abs/2305.12451 (2023) - 2022
- [i12]Boming Chi, Akira Terui:
The GPGCD Algorithm with the Bézout Matrix for Multiple Univariate Polynomials. CoRR abs/2205.02984 (2022) - [i11]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials. CoRR abs/2209.04807 (2022) - 2021
- [i10]Shuto Otaki, Akira Terui, Masahiko Mikawa:
A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Real Quantifier Elimination based on Comprehensive Gröbner Systems. CoRR abs/2111.00384 (2021) - 2020
- [c9]Boming Chi, Akira Terui
The GPGCD Algorithm with the Bézout Matrix. CASC 2020: 170-187 - [c8]Noriyuki Horigome, Akira Terui
A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases. ICMS 2020: 3-13 - [i9]Ryuji Koshikawa, Akira Terui, Masahiko Mikawa:
Solving System of Nonlinear Equations with the Genetic Algorithm and Newton's Method. CoRR abs/2007.05159 (2020)
2010 – 2019
- 2019
- [j7]Boming Chi, Akira Terui:
The GPGCD algorithm with the Bézout matrix. ACM Commun. Comput. Algebra 53(3): 99-102 (2019) - 2018
- [i8]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials. CoRR abs/1801.08437 (2018) - [i7]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui:
Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials. CoRR abs/1811.09149 (2018) - 2016
- [c7]Yumi Wada, Takuya Matsuzaki, Akira Terui
An Automated Deduction and Its Implementation for Solving Problem of Sequence at University Entrance Examination. ICMS 2016: 82-89 - 2014
- [c6]Katsuyoshi Ohara, Shinichi Tajima, Akira Terui
Developing Linear Algebra Packages on Risa/Asir for Eigenproblems. ICMS 2014: 321-324 - [c5]Shinichi Tajima, Katsuyoshi Ohara, Akira Terui
An Extension and Efficient Calculation of the Horner's Rule for Matrices. ICMS 2014: 346-351 - 2013
- [j6]Akira Terui
Calculating approximate GCD of multiple univariate polynomials using approximate syzygies. ACM Commun. Comput. Algebra 47(3/4): 110-111 (2013) - [j5]Akira Terui
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theor. Comput. Sci. 479: 127-149 (2013) - 2012
- [i6]Akira Terui:
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. CoRR abs/1207.0630 (2012) - 2011
- [j4]Akira Terui
Abstracts from RIMS workshop on developments in computer algebra research. ACM Commun. Comput. Algebra 45(3/4): 162-165 (2011) - 2010
- [j3]Akira Terui
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials. ACM Commun. Comput. Algebra 44(3/4): 153-155 (2010) - [c4]Akira Terui
GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials. CASC 2010: 238-249 - [i5]Akira Terui:
GPGCD, an Iterative Method for Calculating Approximate GCD of Univariate Polynomials, with the Complex Coefficients. CoRR abs/1007.1834 (2010) - [i4]Akira Terui:
GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials. CoRR abs/1007.1836 (2010)
2000 – 2009
- 2009
- [c3]Akira Terui
An iterative method for calculating approximate GCD of univariate polynomials. ISSAC 2009: 351-358 - [c2]Tateaki Sasaki, Akira Terui
Computing clustered close-roots of univariate polynomials. SNC 2009: 177-184 - 2008
- [i3]Akira Terui:
Subresultants in Recursive Polynomial Remainder Sequence. CoRR abs/0806.0478 (2008) - [i2]Akira Terui:
Recursive Polynomial Remainder Sequence and the Nested Subresultants. CoRR abs/0806.0488 (2008) - [i1]Akira Terui:
Recursive Polynomial Remainder Sequence and its Subresultants. CoRR abs/0806.0495 (2008) - 2005
- [c1]Akira Terui
Recursive Polynomial Remainder Sequence and the Nested Subresultants. CASC 2005: 445-456 - 2002
- [j2]Tateaki Sasaki, Akira Terui
A formula for separating small roots of a polynomial. SIGSAM Bull. 36(3): 19-23 (2002)
1990 – 1999
- 1997
- [j1]Tateaki Sasaki, Kousuke Shihara, Akira Terui
Approximate algebraic computation: practice and problems. SIGSAM Bull. 31(3): 32 (1997)
Coauthor Index
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-10-17 20:31 CEST 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: