default search action
ACM Communications in Computer Algebra, Volume 52
Volume 52, Number 1, March 2018
- Robert M. Corless
, Julia E. Jankowski:
Revisiting the discharge time of a cylindrical leaking bucket: or, "one does not simply call dsolve into mordor.". 1-10 - Germán A. G. Combariza:
A few conjectures about the multiple zeta values. 11-20
Volume 52, Number 2, June 2018
- Hiroki Nagashima, Kiyoshi Shirayanagi:
Effect of the interval-symbol method with correct zero rewriting on the δ-LLL algorithm. 24-31 - Robert M. Corless
Comprehensive anti-derivatives and parametric continuity. 32-33 - Victor Magron, Mohab Safey El Din:
Realcertify: a maple package for certifying non-negativity. 34-37 - Luca De Feo, Hugues Randriambololona, Édouard Rousseau:
Lattices of compatibly embedded finite fields in nemo/flint. 38-41
Volume 52, Number 3, September 2018
- Hans-Gert Gräbe
20 Years SymbolicData. 45-54 - Joris van der Hoeven
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. 55-58 - Joel Nagloo
Commuting planar polynomial vector fields for conservative newton systems. 59-62 - Alessandro Budroni, Federico Pintore
Hashing to G2 on BLS pairing-friendly curves. 63-66 - François Boulier, François Fages, Ovidiu Radulescu
The SYMBIONT project: symbolic methods for biological networks. 67-70 - José Gómez-Torrecillas
Minimum distance computation of linear codes via genetic algorithms with permutation encoding. 71-74 - Annie A. M. Cuyt, Wen-shin Lee:
A scale and shift paradigm for sparse interpolation in one and more dimensions. 75-77 - Simon Telen, Bernard Mourrain, Marc Van Barel
Truncated normal forms for solving polynomial systems. 78-81 - Curtis Bright
The SAT+CAS paradigm and the Williamson conjecture. 82-84 - Jorge Caravantes
Offsets to conics and quadrics: a new determinantal representation for their implicit equation. 85-88 - Johannes Middeke
Towards a direct method for finding hypergeometric solutions of linear first order recurrence systems. 89-91 - Tudor Jebelean:
Techniques for natural-style proofs in elementary analysis. 92-95 - Eugene V. Zima:
Accelerating indefinite hypergeometric summation algorithms. 96-99 - Seung Gyu Hyun, Stephen Melczer
A fast algorithm for solving linearly recurrent sequences. 100-103 - Ranjana Mehta
Unboundedness of Betti numbers of curves. 104-107 - Cameron Farnsworth, Jose Israel Rodriguez:
Homogenized funtf varieties and algebraic frame completion. 108-111
Volume 52, Number 4, December 2018
- Isabel Bermejo, Eva García-Llorente, Ignacio García-Marco
Noether resolutions in dimension 2. 114-116 - Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. 117-119 - Majid Gazor
Gröbner bases and multi-dimensional persistent bifurcation diagram classifications. 120-122 - Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy, Éric Schost:
Sparse FGLM using the block Wiedemann algorithm. 123-125 - Rui-Juan Jing, Marc Moreno Maza:
Computing the integer points of a polyhedron. 126-129 - Jean Kieffer, Luca De Feo:
Isogeny-based cryptography in Julia/Nemo: a case study. 130-132 - Alexey A. Kytmanov, A. M. Kytmanov, Evgeniya K. Myshkina:
On computing residue integrals for a class of nonlinear transcendental systems. 133-135 - Roberto La Scala
Computing noncommutative Hilbert series. 136-138 - Florian Lauster, D. Russell Luke, Matthew K. Tam:
Symbolic computation with monotone operators. 139-141 - Chenqi Mou, Dongming Wang:
On W-characteristic sets of lexicographic Gröbner bases. 142-144 - Dai Numahata, Hiroshi Sekigawa
Robust algorithms for sparse interpolation of multivariate polynomials. 145-147 - Masaru Sanuki
Improvement of EZ-GCD algorithm based on extended hensel construction. 148-150 - Nicole Sutherland:
Computation of geometric Galois groups and absolute factorizations. 151-153 - Jiaxiong Hu, Anton Panferov:
Abstracts of recent doctoral dissertations in computer algebra. 154-155
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 2024-12-19 22:15 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: