An algebraic method to compute the mobility of closed-loop overconstrained mechanisms (Ali, Moinet, Serre).- Simplicial topological coding and homology of spin networks (Berec).- Trial set and Groebner bases for binary codes (Borges-Quintana, Borges-Trenard, Martiinez-Moro).- Automated Study of Envelopes of 1-parameter Families of Surfaces (Dana-Picard, Zehavi).- Complex Roots of Quaternion Polynomials (Dospra, Poulakis).- Mathematical renormalization in quantum electrodynamics via noncommutative generating series (Duchamp, Ngoc Minh, Quoc Hoan, Penson, Simonnet).- The root lattice A2 in the construction of substitution tilings and singular hypersurfaces (Escudero).- Finding eigenvalues of self-maps with the Kronecker canonical form (Ethier, Jablonski, Mrozek).- Algorithm for Predicting Mathematical Formulae from Linear Strings for Mathematical Inputs (Fukui).- Algebraic Modelling of Covering Arrays (Garn, Simos).- Applications of Signatures Curves to Characterize Melanomas and Moles (Grim, Shakiban).- Contemporary interpretation of a historical locus problem with the use of computer algebra (Hasek, Kovacs, Zahradnik).- Computing the Chern-Schwartz-MacPherson Class of Complete Simplical Toric Varieties (Helmer).- The Generalized Rabinowitsch Trick (Kapur, Sun, Wang, Zhou).- A Web-based Quantum Computer Simulator with Symbolic Extensions (Karamitrou, Tsimpouris, Mavridi, Sgarbas).- Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems ( Lewis).- Visualization of Orthonormal Triads in Cylindrical and Spherical Coordinates (Lopez-Garcia, Jimenez Zamudio, Diaz V.).- Geometric and Computational Approach to Classical and Quantum Secret Sharing (Matsumoto, Ruano).- Computing the Dixon Resultant with the Maple Package DR (Minimair).- Collaborative Computer Algebra (Minimair).- States and channels in quantum mechanics without complex numbers (Miszczak).- Double Hough transform for estimating the position of the mandibular canal in dental radiographs (Onchis-Moaca, Zappala, Gotja, Real).- Simple and Nearly Optimal Polynomial Root- nding by Means of Root Radii Approximation (Pan).- A Fast Schur-Euclid-type Algorithm for Quasiseparable Polynomials (Perera, Olshevsky).- The use of CAS Piranha for the construction of motion equations of the planetary system problem (Perminov, Kuznetsov).- Code-Based Cryptosystems Using Generalized Concatenated Codes (Puchinger, Muelich, Ishak, Bossert).- Univariate real root isolation over a single logarithmic extension of real algebraic numbers (Strzebonski, Tsigaridas).- On the complexity of multivariate polynomial division (van der Hoeven).- Preserving syntactic correctness while editing mathematical formulas (van der Hoeven, Lecerf, Raux).- About balanced application of CAS in undergraduate mathematics (Varbanova).- Some remarks on Taylor’s polynomials visualization using Mathematica in context of function approximation (Wojas, Krupa).- Zooming algorithms for accurate plotting of functions of two realvariables (Zeitoun, Dana-Picard).
