ACM Communications in Computer Algebra, Volume 44

Volume 44, Numbers 1/2, March / June 2010

Issue 171 number 1, march 2010

• 
  D. J. Jeffrey:
  LU factoring of non-invertible matrices. 1-8
• 
  Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
  Rational-functions telescopers: blending creative telescoping with hermite reduction. 9-10

Abstracts of recent doctoral dissertations in computer algebra

• 
  Montserrat Manubens:
  Abstract only: Parametric polynomial system discussion: canonical comprehensive Gröbner systems. 11-12
• 
  Silviu Radu:
  Abstract only: An algorithmic approach to Ramanujan's congruences and related problems. 11-12
• 
  In memoriam: Chionh Eng Wee. 18-19

Issue 172 number 2, june 2010

• 
  Wolfgang Gröbner:
  On the Macaulay inverse system and its importance for the theory of linear differential equations with constant coefficients. 20-23

Abstracts of invited talks, contributed posters, and software demos at the east coast computer algebra day 2010

• 
  Anton Leykin:
  Abstract only: Certified numerical solving of systems of polynomial equations. 24
• 
  Mark van Hoeij:
  Abstract only: The complexity of factoring univariate polynomials over the rationals. 24
• 
  David Saunders:
  Abstract only: Exact linear algebra. 24
• 
  Gregory V. Bard:
  Abstract only: DEMOCRACY: a heuristic for polynomial systems of equations over finite fields. 25
• 
  Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
  Abstract only: Complexity of sparsest multiple computation. 25
• 
  Deborah Mathews:
  Abstract only: An empirical study of parallel big number arithmetic. 25
• 
  Lingchuan Meng, Jeremy Johnson, Franz Franchetti, Yevgen Voronenko, Marc Moreno Maza, Yuzhen Xie:
  Abstract only: SPIRAL-generated modular FFTs. 25-26
• 
  Bryan S. Youse, B. David Saunders:
  Abstract only: Bitslicing with matrix algorithms oblivious to the data compression. 26
• 
  Tingting Fang, Mark van Hoeij:
  Abstract only: Solving linear differential equations by using descent. 26
• 
  Yongjae Cha, Mark van Hoeij, Giles Levy:
  Abstract only: Solving linear recurrence relations. 26

Emerging trends papers accepted for PLMMS 2010

• 
  Florian Haftmann, Cezary Kaliszyk, Walther Neuper:
  CTP-based programming languages?: considerations about an experimental design. 27-41
• 
  Vincent Lefèvre, Philippe Théveny, Florent de Dinechin, Claude-Pierre Jeannerod, Christophe Mouilleron, David Pfannholzer, Nathalie Revol:
  LEMA: towards a language for reliable arithmetic. 41-52
• 
  Serge Autexier, Dominik Dietrich:
  Recent developments in mega's proof search programming language. 52-59
• 
  Luca De Feo, Éric Schost:
  transalpyne: a language for automatic transposition. 59-71

Abstracts of recent doctoral dissertations in computer algebra

• 
  Stanislav Bulygin:
  Abstract only: Polynomial system solving for decoding linear codes and algebraic cryptanalysis parametric polynomial system discussion: canonical comprehensive. 72

Volume 44, Numbers 3/4, September / December 2010

• 
  Amal Gheffar:
  Linear differential, difference and q-difference homogeneous equations having no rational solutions. 78-83

ISSAC 2010 poster abstracts

• 
  Felix Antritter, Johannes Middeke:
  An efficient algorithm for checking hyper-regularity of matrices. 84-86
• 
  Dennis S. Arnon:
  A product information management system as a workbench for quantifier elimination computations with QEPCAD. 87-88
• 
  Andrew Arnold, Michael B. Monagan:
  A fast recursive algorithm for computing cyclotomic polynomials. 89-90
• 
  Thomas Bächler, Vladimir P. Gerdt, Markus Lange-Hegermann, Wilhelm Plesken, Daniel Robertz:
  Thomas decomposition and its applications. 91-92
• 
  Isabel Bermejo, Ignacio García-Marco:
  An algorithm for checking whether a simplicial toric ideal is a complete intersection. 93-94
• 
  Johannes Blümlein, Sebastian Klein, Carsten Schneider, Flavia Stan:
  A symbolic summation approach to feynman integrals. 95-96
• 
  Changbo Chen, Marc Moreno Maza, Yuzhen Xie:
  Cache complexity and multicore implementation for univariate real root isolation. 97-98
• 
  Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Éric Schost:
  Complexity and performance results for non FFT-based univariate polynomial multiplication. 99-100
• 
  Annie A. M. Cuyt, Wen-shin Lee:
  Reconstructing sparse trigonometric functions. 101-102
• 
  Xavier Dahan, Marc Moreno Maza, Éric Schost, Adrien Poteaux:
  Almost linear time operations with triangular sets. 103-104
• 
  Luca De Feo, Éric Schost:
  transalpyne: a language for automatic transposition. 105-106
• 
  Charles-Éric Drevet, Md. Nazrul Islam, Éric Schost:
  Optimization techniques for small matrix multiplication. 107-108
• 
  Burçin Eröcal, Arne Storjohann:
  Nullspace computation over rational function fields for symbolic summation. 109-110
• 
  Sardar Anisul Haque, Shahadat Hossain, Marc Moreno Maza:
  Cache friendly sparse matrix-vector multiplication. 111-112
• 
  Albert Heinle, Viktor Levandovskyy:
  Factorization of polynomials in Z-graded skew polynomial rings. 113-114
• 
  Christian Hellström:
  VarInt: variational integrator design with maple. 115
• 
  Seyed Mohammad Mahdi Javadi, Michael B. Monagan:
  On sparse interpolation over finite fields. 116-117
• 
  Karen T. Kohl:
  An implementation of the method of brackets for symbolic integration. 118-119
• 
  Anja Korporal, Georg Regensburger, Markus Rosenkranz:
  A maple package for integro-differential operators and boundary problems. 120-122
• 
  Jae Hee Lee:
  Cylindrical algebraic decomposition for reasoning about qualitative spatial knowledge. 123-124
• 
  Viktor Levandovskyy:
  Non-commutative subsystems of singular. 125-126
• 
  Shuichi Moritsugu:
  Radius computation for an inscribed pentagon in Sanpou-Hakki (1690). 127-128
• 
  Hiroshi Murakami:
  Sturm root counting using chebyshev expansion. 129-131
• 
  Nalina Phisanbut, Russell J. Bradford, James H. Davenport:
  Geometry of branch cuts. 132-135
• 
  Sonia L. Rueda:
  Linear differential implicitization and differential resultants. 136-137
• 
  Yannick Saouter:
  Heuristics for cannon's algorithm with an application to lyons sporadic group. 138-139
• 
  Yannick Saouter, Gérald Le Mestre:
  A FPGA implementation of Chen's algorithm. 140-141
• 
  Tateaki Sasaki, Fujio Kako:
  Computing floating-point Gröbner bases accurately. 142-143
• 
  Dana Schlomiuk, Nicolae Vulpe:
  Invariants and symbolic calculations in the theory of quadratic differential systems. 144-146
• 
  Hiroshi Sekigawa, Kiyoshi Shirayanagi:
  Solvability of bivariate polynomial systems under perturbation. 147-148
• 
  Ekaterina Shemyakova:
  X- and Y -invariants for Darboux transformations. 149-150
• 
  Grischa Studzinski:
  Computation of dimensions of non-commutative algebras. 151-152
• 
  Akira Terui:
  GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials. 153-155

Abstracts of recent doctoral dissertations in computer algebra

• 
  Flavia Stan:
  Algorithms for special functions: computer algebra and analytical aspects. 156-157
• 
  Colas Bardavid:
  Differential schemes: geometric approach and functorial approach. 157-159
• 
  Daniel E. Steffy:
  Exact solutions to linear systems of equations using output sensitive lifting. 160-182

ISSAC 2010 software presentations

• 
  Yongjae Cha, Mark van Hoeij, Giles Levy:
  Solving linear recurrence equations. 183-185
• 
  Felix Effenberger, Jonathan Spreer:
  simpcomp: a GAP toolbox for simplicial complexes. 186-189
• 
  Burçin Eröcal:
  Summation in finite terms using sage. 190-193
• 
  Mickaël Gastineau, Jacques Laskar:
  TRIP: a computer algebra system dedicated to celestial mechanics and perturbation series. 194-197
• 
  Madalina Hodorog, Bernard Mourrain, Josef Schicho:
  GENOM3CK: a library for genus computation of plane complex algebraic curves using knot theory. 198-200
• 
  Mohamed Barakat, Markus Lange-Hegermann:
  LocalizeRingForHomalg: localize commutative rings at maximal ideals. 201-204
• 
  Michael B. Monagan, Roman Pearce:
  Sparse polynomial multiplication and division in Maple 14. 205-209
• 
  The SCIEnce project:
  Symbolic computation software composability protocol and its implementations. 210-212
• 
  The SCIEnce project:
  SymGrid-Par: parallel orchestration of symbolic computation systems. 213-216
• 
  Jan Verschelde:
  Polynomial homotopy continuation with PHCpack. 217-220