Abstract is missing.
- On solutions of linear functional systemsSergei A. Abramov, Manuel Bronstein. 1-6 [doi]
- Minimal decomposition of indefinite hypergeometric sumsSergei A. Abramov, Marko Petkovsek. 7-14 [doi]
- On the Barnes functionVictor Adamchik. 15-20 [doi]
- Generic ideals and Moreno-Socías conjuctureEdith Aguirre, Abdul Salam Jarrah, Reinhard C. Laubenbacher. 21-23 [doi]
- Hybrid sparse resultant matrices for bivariate systemsCarlos D Andrea, Ioannis Z. Emiris. 24-31 [doi]
- Maple s evaluation process as constraint contextual rewritingAlessandro Armando, Clemens Ballarin. 32-37 [doi]
- PARDI!François Boulier, François Lemaire, Marc Moreno Maza. 38-47 [doi]
- Families of estimable termsMassimo Caboara, Lorenzo Robbiano. 56-63 [doi]
- Computing all factorizations in ***Howard Cheng, George Labahn. 64-71 [doi]
- Scalable parallel coset enumeration using bulk definitionGene Cooperman, Victor Grinberg. 77-84 [doi]
- Towards factoring bivariate approximate polynomialsRobert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt. 85-92 [doi]
- On Liouvillian solutions of linear differential equations of order 4 and 5Olivier Cormier. 93-100 [doi]
- Hybrid computationJean Della Dora, Aude Maignan, Mihaela Mirica-Ruse, Sergio Yovine. 101-108 [doi]
- Computation of the radical of polynomial ideals over fields of arbitrary characteristicElisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager. 116-120 [doi]
- Polynomial root finding using iterated Eigenvalue computationSteven Fortune. 121-128 [doi]
- On computer-assisted classification of coupled integrable equationsMikhail V. Foursov, Marc Moreno Maza. 129-136 [doi]
- Semi-numerical determination of irreducible branches of a reduced space curveAndré Galligo, David Rupprecht. 137-142 [doi]
- Symbolic-interval cooperation in constraint programmingLaurent Granvilliers, Eric Monfroy, Frédéric Benhamou. 150-166 [doi]
- Unirational fields of transcendence degree one and functional decompositionJaime Gutierrez, Rosario Rubio San Miguel, David Sevilla. 167-174 [doi]
- Solvability by radicals from an algorithmic point of viewGuillaume Hanrot, François Morain. 175-182 [doi]
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structuresHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. 183-191 [doi]
- The membership problem for ideals of binomial skew polynomial ringsLiu Jinwang, Zhuojun Liu, Liu Xiaoqi, Wang Mingsheng. 192-195 [doi]
- Diagnosing and correcting student s misconceptions in an educational computer algebra systemNeven Jurkovic. 195-200 [doi]
- Dimensional analysis in computer algebraRaya Khanin. 201-208 [doi]
- Towards approximations which preserve integralsElizabeth L. Mansfield, Peter E. Hydon. 217-222 [doi]
- A linear space algorithm for computing the herite normal formDaniele Micciancio, Bogdan Warinschi. 231-236 [doi]
- Remarks on Gröbner basis for ideals under compositionWang Mingsheng, Zhuojun Liu. 237-244 [doi]
- Algorithms for trigonometric polynomialsJamie Mulholland, Michael B. Monagan. 245-252 [doi]
- Univariate polynomials: nearly optimal algorithms for factorization and rootfindingVictor Y. Pan. 253-267 [doi]
- New complexity bounds for cylindrical decompositions of sub-pfaffian setsSavvas Pericleous, Nicolai Vorobjov. 268-275 [doi]
- A multivariate Weierstrass iterative rootfinderOlivier Ruatta. 276-283 [doi]
- Approximate multivariate polynomial factorization based on zero-sum relationsTateaki Sasaki. 284-291 [doi]
- Discrete comprehensive Gröbner basesYosuke Sato, Akira Suzuki. 292-296 [doi]
- Black box methods for least squares problemsB. David Saunders. 297-302 [doi]
- On a parallel Lehmer-Euclid GCD algorithmSidi Mohamed Sedjelmaci. 303-308 [doi]
- A probabilistic algorithm to test local algebraic observability in polynomial timeAlexandre Sedoglavic. 309-317 [doi]
- Computation of the degree of rational maps between curvesJ. Rafael Sendra, Franz Winkler. 317-322 [doi]
- Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithmEmmanuel Thomé. 323-331 [doi]
- Irreducible trinomials over finite fieldsJoachim von zur Gathen. 332-336 [doi]
- IAMC architecture and prototyping: a progress reportPaul S. Wang, Simon Gray, Norbert Kajler, Dongdai Lin, Weidong Liao, Xiao Zou. 337-344 [doi]
- On computational properties of chains of recurrencesEugene V. Zima. 345 [doi]