default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTateaki Sasaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Tateaki Sasaki:
A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs). ACM Commun. Comput. Algebra 56(3): 97-124 (2022)- 2021
- [c37]Tateaki Sasaki, Masaru Sanuki
, Daiju Inaba:
Proposal of Multivariate Polynomial Arithmetic in a Specified Width of High- or Low-Exponents. SYNASC 2021: 25-32
2010 – 2019
- 2019
- [c36]Tateaki Sasaki:
An Attempt to Enhance Buchberger's Algorithm by Using Remainder Sequences and GCD Operation. SYNASC 2019: 27-34 - 2018
- [c35]Tateaki Sasaki:
A Theory and an Algorithm for Computing Sparse Multivariate Polynomial Remainder Sequence. CASC 2018: 345-360 - [c34]Tateaki Sasaki, Daiju Inaba:
Computing the Lowest-Order Element of a Multivariate Elimination Ideal by Using Remainder Sequences. SYNASC 2018: 37-44 - 2017
- [j24]Tateaki Sasaki, Daiju Inaba:
Enhancing the extended hensel construction by using Gröbner basis. ACM Commun. Comput. Algebra 51(1): 26-28 (2017) - [c33]Tateaki Sasaki, Daiju Inaba:
Simple Relation between the Lowest-Order Element of Ideal 〈G, H〉 and the Last Element of Polynomial Remainder Sequence. SYNASC 2017: 55-62 - 2016
- [j23]Tateaki Sasaki, Hiroshi Kai:
Memories on Professor Matu-tarow Noda. ACM Commun. Comput. Algebra 50(2): 69 (2016) - [c32]Tateaki Sasaki, Daiju Inaba:
Enhancing the Extended Hensel Construction by Using Gröbner Bases. CASC 2016: 457-472 - [c31]Tateaki Sasaki, Daiju Inaba:
Various Enhancements for Extended Hensel Construction of Sparse Multivariate Polynomials. SYNASC 2016: 83-86 - 2015
- [c30]Masaru Sanuki, Daiju Inaba, Tateaki Sasaki:
Computation of GCD of Sparse Multivariate Polynomials by Extended Hensel Construction. SYNASC 2015: 34-41 - 2014
- [j22]Tateaki Sasaki, Daiju Inaba, Fujio Kako:
Solving Parametric Sparse Linear Systems by Local Blocking. ACM Commun. Comput. Algebra 48(3/4): 137-139 (2014) - [c29]Tateaki Sasaki, Daiju Inaba, Fujio Kako:
Solving Parametric Sparse Linear Systems by Local Blocking. CASC 2014: 403-418 - [c28]Tateaki Sasaki:
Solving Parametric Sparse Linear Systems by Local Blocking, II. SYNASC 2014: 74-81 - 2013
- [c27]Tateaki Sasaki, Daiju Inaba, Fujio Kako:
Towards Industrial Application of Approximate Computer Algebra. CASC 2013: 315-330 - [c26]Tateaki Sasaki, Tetsu Yamaguchi:
On Algebraic Preprocessing of Floating-Point DAEs for Numerical Model Simulation. SYNASC 2013: 81-88 - 2012
- [c25]Tateaki Sasaki, Daiju Inaba:
Approximately Singular Systems and Ill-Conditioned Polynomial Systems. CASC 2012: 308-320 - [c24]Tateaki Sasaki:
Proposal of Singularization of Approximately Singular Polynomial Systems. SYNASC 2012: 45-52 - 2011
- [c23]Tateaki Sasaki, Daiju Inaba:
A study of Hensel series in general case. SNC 2011: 34-43 - [c22]Tateaki Sasaki:
A Theory and an Algorithm of Approximate Gröbner Bases. SYNASC 2011: 23-30 - 2010
- [j21]Tateaki Sasaki, Fujio Kako:
Computing floating-point Gröbner bases accurately. ACM Commun. Comput. Algebra 44(3/4): 142-143 (2010) - [c21]Tateaki Sasaki, Fujio Kako:
Term Cancellations in Computing Floating-Point Gröbner Bases. CASC 2010: 220-231
2000 – 2009
- 2009
- [j20]Tateaki Sasaki, Yasutaka Ookura:
Approximate factorization of polynomials in Z[x]. ACM Commun. Comput. Algebra 43(3/4): 99-101 (2009) - [c20]Tateaki Sasaki:
A Practical Method for Floating-Point Gröbner Basis Computation. ASCM 2009: 109-124 - [c19]Tateaki Sasaki, Daiju Inaba:
Series-Expansion of Multivariate Algebraic Functions at Singular Points: Nonmonic Case. ASCM 2009: 125-140 - [c18]Tateaki Sasaki, Daiju Inaba:
Convergence and many-valuedness of hensel seriesnear the expansion point. SNC 2009: 159-168 - [c17]Tateaki Sasaki, Yasutaka Ookura:
Approximate factorization of polynomials over Z. SNC 2009: 169-176 - [c16]Tateaki Sasaki, Akira Terui:
Computing clustered close-roots of univariate polynomials. SNC 2009: 177-184 - [e1]Hiroshi Kai, Hiroshi Sekigawa, Tateaki Sasaki, Kiyoshi Shirayanagi, Ilias S. Kotsireas:
Symbolic Numeric Computation, SNC '09, Kyoto, Japan - August 03 - 05, 2009. ACM 2009, ISBN 978-1-60558-664-9 [contents] - 2008
- [j19]Tateaki Sasaki, Daiju Inaba:
Convergence domain of series expansions of multivariate algebraic functions. ACM Commun. Comput. Algebra 42(3): 127-128 (2008) - 2007
- [c15]Tateaki Sasaki, Fujio Kako:
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation. ASCM 2007: 278-292 - [c14]Daiju Inaba, Tateaki Sasaki:
A numerical study of extended Hensel series. SNC 2007: 103-109 - [c13]Masaru Sanuki, Tateaki Sasaki:
Computing Approximate GCDs in Ill-conditioned Cases. SNC 2007: 170-179 - [c12]Tateaki Sasaki, Fujio Kako:
Computing floating-point gröbner bases stably. SNC 2007: 180-189 - 2006
- [j18]Yasushi Umeda, Tateaki Sasaki:
Computing determinants of rational functions. ACM Commun. Comput. Algebra 40(1): 2-8 (2006) - [j17]Daiju Inaba, Takeshi Osoekawa, Tateaki Sasaki:
Visualization of extended Hensel factors. ACM Commun. Comput. Algebra 40(2): 44-45 (2006) - [j16]Takeshi Osoekawa, Tateaki Sasaki:
Hensel fan. ACM Commun. Comput. Algebra 40(2): 48-49 (2006) - 2005
- [j15]Tateaki Sasaki, Daiju Inaba, Kentaro Katamachi:
An approach to singularity from the extended Hensel construction. SIGSAM Bull. 39(3): 94-95 (2005) - 2004
- [j14]Tateaki Sasaki:
A theorem for separating close roots of a polynomial and its derivatives. SIGSAM Bull. 38(3): 85-92 (2004) - 2003
- [c11]Tateaki Sasaki:
The subresultant and clusters of close roots. ISSAC 2003: 232-239 - 2002
- [j13]Tateaki Sasaki, Akira Terui:
A formula for separating small roots of a polynomial. SIGSAM Bull. 36(3): 19-23 (2002) - 2001
- [c10]Tateaki Sasaki:
Approximate multivariate polynomial factorization based on zero-sum relations. ISSAC 2001: 284-291 - 2000
- [j12]Tateaki Sasaki, Daiju Inaba:
Hensel construction of F(x, u1, ..., xl) l ≥ 2 at a singular point and its applications. SIGSAM Bull. 34(1): 9-17 (2000)
1990 – 1999
- 1998
- [j11]Tateaki Sasaki, Tomoyuki Sato:
Cancellation errors in multivariate resultant computation with floating-point numbers. SIGSAM Bull. 32(4): 13-20 (1998) - [c9]Tateaki Sasaki, Satoshi Yamaguchi:
An Analysis of Cancellation Error in Multivariate Hensel Construction with Floating-Point Number Arithmetic. ISSAC 1998: 1-8 - 1997
- [j10]Tateaki Sasaki, Mutsuko K. Sasaki:
Polynomial remainder sequence and approximate GCD. SIGSAM Bull. 31(3): 4-10 (1997) - [j9]Fujio Kako, Tateaki Sasaki:
Proposal of "effective floating-point number" for approximate algebraic computation. SIGSAM Bull. 31(3): 31 (1997) - [j8]Tateaki Sasaki, Kousuke Shihara, Akira Terui, Yuichi Ozaki, Fujio Kako:
Approximate algebraic computation: practice and problems. SIGSAM Bull. 31(3): 32 (1997) - 1996
- [j7]Takahiro Sado, Tomohiro Halaikawa, Tateaki Sasaki:
Pseudo-parallel execution of modular computation. SIGSAM Bull. 30(1): 4-8 (1996) - 1992
- [j6]Tateaki Sasaki, Mutsuko K. Sasaki:
On integer-to-rational conversion algorithm. SIGSAM Bull. 26(2): 19-21 (1992) - [j5]Miroslav Kolár, Tateaki Sasaki:
Multivariate quotient by power-series division. SIGSAM Bull. 26(3): 17-20 (1992) - [j4]Tateaki Sasaki, Masayuki Suzuki:
Three New Algorithms for Multivariate Polynomial GCD. J. Symb. Comput. 13(4): 395-412 (1992)
1980 – 1989
- 1987
- [c8]Masayuki Suzuki, Tateaki Sasaki, Mitsuhisa Sato, Yoshinari Fukui:
A Hybrid algebraic-numeric system ANS and its preliminary implementation. EUROCAL 1987: 163-171 - [c7]Tateaki Sasaki:
Some algebraic algorithms based on head term elimination over polynomial rings. EUROCAL 1987: 348-354 - 1986
- [j3]Mutsuko K. Sasaki, Tateaki Sasaki:
Techniques in computer art. Vis. Comput. 2(2): 106-111 (1986) - [c6]Tateaki Sasaki:
Simplification of algebraic expression by multiterm rewriting rules. SYMSAC 1986: 115-120 - 1983
- [c5]Akio Furukawa, Tateaki Sasaki:
Multi polynominal remainder sequence and its application to linear diophantine equations. EUROCAL 1983: 24-35 - 1982
- [j2]Tateaki Sasaki, Hirokazu Murao:
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems. ACM Trans. Math. Softw. 8(3): 277-289 (1982) - 1981
- [j1]Yasumasa Kanada, Tateaki Sasaki:
LISP-based "big-float" system is not slow. SIGSAM Bull. 15(2): 13-19 (1981) - [c4]Tateaki Sasaki, Hirokazu Murao:
Efficient Gaussian elimination method for symbolic determinants and linear systems (Extended Abstract). SYMSACC 1981: 155-159 - [c3]Tateaki Sasaki, Yasumasa Kanada:
Parallelism in algebraic computation and parallel algorithms for symbolic linear systems. SYMSACC 1981: 160-167
1970 – 1979
- 1979
- [c2]Tateaki Sasaki:
An arbitrary precision real arithmetic package in REDUCE. EUROSAM 1979: 358-368 - 1978
- [c1]Eiichi Goto, Takashi Soma, Masanori Idesawa, Tateaki Sasaki:
Electron beam lithography for advanced LSl fabrication. AFIPS National Computer Conference 1978: 1223-1228
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-07 22:20 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:
