Table of Contents

• Power series and linear difference equationsSergei A. Abramov. 1-2 [doi]
• Digital atlases and difference formsElizabeth L. Mansfield. 3-4 [doi]
• Can we create a viable free open source alternative to magma, maple, mathematica and matlab?William A. Stein. 5-6 [doi]
• Towards a computer algebraic algorithm for flat output determinationFelix Antritter, Jean Lévine. 7-14 [doi]
• Regular systems of linear functional equations and applicationsMoulay A. Barkatou, Gary Broughton, Eckhard Pflügel. 15-22 [doi]
• Products of ordinary differential operators by evaluation and interpolationAlin Bostan, Frédéric Chyzak, Nicolas Le Roux. 23-30 [doi]
• Implicitization and parametrization of quadratic surfaces with one simple base pointXuhui Wang, Falai Chen, Jiansong Deng. 31-38 [doi]
• Solving differential equations in terms of bessel functionsRuben Debeerst, Mark van Hoeij, Wolfram Koepf. 39-46 [doi]
• On the computation of the topology of a non-reduced implicit space curveDaouda Niang Diatta, Bernard Mourrain, Olivier Ruatta. 47-54 [doi]
• Gröbner-free normal forms for boolean polynomialsMichael Brickenstein, Alexander Dreyer. 55-62 [doi]
• Q-adic transform revisitedJean-Guillaume Dumas. 63-70 [doi]
• Computing the global optimum of a multivariate polynomial over the realsMohab Safey El Din. 71-78 [doi]
• Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalitiesJean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din. 79-86 [doi]
• Complete subdivision algorithms, II: isotopic meshing of singular algebraic curvesMichael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap. 87-94 [doi]
• A pommaret division algorithm for computing Grobner bases in boolean ringsVladimir P. Gerdt, Mikhail V. Zinin. 95-102 [doi]
• On lacunary polynomial perfect powersMark Giesbrecht, Daniel S. Roche. 103-110 [doi]
• Plane geometry and convexity of polynomial stability regionsDidier Henrion, Michael Sebek. 111-116 [doi]
• An algorithm for finding symmetric Grobner bases in infinite dimensional ringsMatthias Aschenbrenner, Christopher J. Hillar. 117-124 [doi]
• Moment matrices, trace matrices and the radical of idealsItnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai. 125-132 [doi]
• Integration of algebraic functions: a simple heuristic for finding the logarithmic partManuel Kauers. 133-140 [doi]
• Expressing a fraction of two determinants as a determinantErich Kaltofen, Pascal Koiran. 141-146 [doi]
• Symbolic optimization of algebraic functionsMasaaki Kanno, Kazuhiro Yokoyama, Hirokazu Anai, Shinji Hara. 147-154 [doi]
• Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalarsErich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi. 155-164 [doi]
• Numerical primary decompositionAnton Leykin. 165-172 [doi]
• Computational D-module theory with singular, comparison with other systems and two new algorithmsViktor Levandovskyy, Jorge Martín-Morales. 173-180 [doi]
• Complex brackets, balanced complex differences, and applications in symbolic geometric computingHongbo Li, Lei Huang. 181-188 [doi]
• The complete root classification of a parametric polynomial on an intervalSongxin Liang, David J. Jeffrey, Marc Moreno Maza. 189-196 [doi]
• Hilbert s nullstellensatz and an algorithm for proving combinatorial infeasibilityJesús A. De Loera, J. Lee, P. N. Malkin, S. Margulies. 197-206 [doi]
• When does (::::T::::) equal sat(::::T::::)?François Lemaire, Marc Moreno Maza, Wei Pan, Yuzhen Xie. 207-214 [doi]
• Deciding polynomial-exponential problemsMelanie Achatz, Scott McCallum, Volker Weispfenning. 215-222 [doi]
• On generalized ln-surfaces in 4-spaceMartin Peternell, Boris Odehnal. 223-230 [doi]
• A rational decomposition-lemma for systems of linear differential-algebraic equationsEckhard Pflügel. 231-238 [doi]
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fieldsAdrien Poteaux, Marc Rybowicz. 239-246 [doi]
• Multi-modular algorithm for computing the splitting field of a polynomialGuénaël Renault, Kazuhiro Yokoyama. 247-254 [doi]
• Linearizablity of 1: -3 resonant system with homogeneous cubic nonlinearitiesZhibek Kadyrsizova, Valery G. Romanovski. 255-260 [doi]
• Integro-differential polynomials and operatorsMarkus Rosenkranz, Georg Regensburger. 261-268 [doi]
• Power series composition and change of basisAlin Bostan, Bruno Salvy, Éric Schost. 269-276 [doi]
• Loewy decomposition of third-order linear aPDE s in the planeDima Grigoriev, Fritz Schwarz. 277-286 [doi]
• The nearest polynomial with a zero in a given domain from a geometrical viewpointHiroshi Sekigawa. 287-294 [doi]
• Moving frames for laplace invariantsEkaterina Shemyakova, Elizabeth L. Mansfield. 295-302 [doi]
• Real root isolation for exp-log functionsAdam W. Strzebonski. 303-314 [doi]
• Gröbner bases for public key cryptographyMassimo Caboara, Fabrizio Caruso, Carlo Traverso. 315-324 [doi]
• Computing the multiplicity structure from geometric involutive formXiaoli Wu, Lihong Zhi. 325-332 [doi]
• Exact algorithms and software in optimization and polyhedral computationKomei Fukuda. 333-334 [doi]
• Algorithmic invariant theoryGregor Kemper. 335-336 [doi]
• Algebraic algorithms and coding theoryMadhu Sudan. 337 [doi]