default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Communications in Computer Algebra, Volume 53
Volume 53, Number 1, March 2019
- Ao Li, Robert M. Corless
:
Revisiting Gilbert Strang's "a chaotic search for i". 1-22 - Sergei A. Abramov, Moulay A. Barkatou:
Row reduction process for matrices of scalar operators: storing the intermediate results of row transformation. 23-30
Volume 53, Number 2, June 2019
- Shanshan Yao, Yifei Feng, Xiaohong Jia, Li-Yong Shen:
ISSAC 2019 software presentations communicated by Yue Ren: a package to compute implicit equations for rational curves and surfaces. 33-36 - Hoon Hong, Alexey Ovchinnikov, Gleb Pogudin, Chee Yap:
SIAN: a tool for assessing structural identifiability of parametric ODEs. 37-40 - Robin Larrieu:
Computing generic bivariate Gröbner bases with Mathemagix. 41-44 - Kisun Lee:
Certifying approximate solutions to polynomial systems on Macaulay2. 45-48 - Clemens Hofstadler, Clemens G. Raab, Georg Regensburger:
Certifying operator identities via noncommutative Gröbner bases. 49-52 - Antonio Jiménez-Pastor:
A sage implementation for DD-finite functions. 53-56 - Manuel Kauers, Marc Mezzarobba:
Multivariate ore polynomials in SageMath. 57-60 - Julián Cuevas-Rozo, Jose Divasón, Miguel Ángel Marco-Buzunáriz, Ana Romero:
A Kenzo interface for algebraic topology computations in SageMath. 61-64 - Sergei A. Abramov, Anna A. Ryabenko, Leonid A. Sevastianov, Min Wu, Yvette Zonn:
The conference "computer algebra" in Moscow. 65-77
Volume 53, Number 3, September 2019
- Kosuke Sakata:
An efficient reduction strategy for signature-based algorithms to compute Gröbner basis. 81-92 - Shayea Aldossari, Mark van Hoeij:
Methods for simplifying differential equations. 93-95 - Shaoshi Chen, Jing Guo:
Additive Ore-Sato theorem. 96-98 - Boming Chi, Akira Terui:
The GPGCD algorithm with the Bézout matrix. 99-102 - Robert M. Corless, Leili Rafiee Sevyeri:
Approximate GCD in Bernstein basis. 103-106 - Mawunyo Kofi Darkey-Mensah, Przemyslaw Koprowski:
Intrinsic factorization of ideals in Dedekind domains. 107-109 - Hao Du, Jing Guo, Ziming Li:
An additive decomposition in multiple logarithmic extensions. 110-113 - Jesse Elliott, Éric Schost:
Bit complexity for critical point computation in smooth and compact real hypersurfaces. 114-117 - Marijn Heule, Manuel Kauers, Martina Seidl:
A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications. 118-121 - Bo Huang, Wei Niu:
Algebraic approach to chaos induced by snapback repeller. 122-125 - Manuel Kauers, Thibaut Verron:
Why you should remove zeros from data before guessing. 126-129 - Kazuki Kondo, Hiroshi Sekigawa:
Robust computation methods for sparse interpolation of multivariate polynomials. 130-133 - Jiang Liu:
Block distance invariant method for monoterm canonicalization of Riemann tensor polynomials. 134-137 - Akshar Nair, James H. Davenport, Gregory Sankaran, Scott McCallum:
Lazard's CAD exploiting equality constraints. 138-141 - Garrett Paluck, Michael B. Monagan:
New bivariate Hensel lifting algorithm for n factors. 142-145 - Patricia Pascual-Ortigosa, Eduardo Sáenz-de-Cabezón, Henry P. Wynn:
Algebraic algorithms for the reliability analysis of multi-state k-out-of-n systems. 146-149 - Yi Zhou, Mark van Hoeij:
Fast algorithm for factoring difference operators. 150-152
Volume 53, Number 4, December 2019
- International Symposium on Wen-Tsun Wu's Academic Thought and Mathematics Mechanization. 155-181
- Jürgen Gerhard, Ilias S. Kotsireas:
Maple Conference 2019. 182 - Abstracts of recent doctoral dissertations in computer algebra. 183-188
- Ioannis Z. Emiris:
15 PhD positions in GRAPES: learning, processing & optimising shapes. 189
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.
last updated on 2025-02-07 23:55 CET 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:
