ISSAC 2001: London, Ontario, Canada

• Sergei A. Abramov, Manuel Bronstein:
  On solutions of linear functional systems. 1-6
  
• Sergei A. Abramov, Marko Petkovsek:
  Minimal decomposition of indefinite hypergeometric sums. 7-14
  
• Victor Adamchik:
  On the Barnes function. 15-20
  
• Edith Aguirre, Abdul Salam Jarrah, Reinhard C. Laubenbacher:
  Generic ideals and Moreno-Socías conjucture. 21-23
  
• Carlos D'Andrea, Ioannis Z. Emiris:
  Hybrid sparse resultant matrices for bivariate systems. 24-31
  
• Alessandro Armando, Clemens Ballarin:
  Maple's evaluation process as constraint contextual rewriting. 32-37
  
• François Boulier, François Lemaire, Marc Moreno Maza:
  PARDI!. 38-47
  
• Laurent Busé:
  Residual resultant over the projective plane and the implicitization problem. 48-55
  
• Massimo Caboara, Lorenzo Robbiano:
  Families of estimable terms. 56-63
  
• Howard Cheng, George Labahn:
  Computing all factorizations in ***. 64-71
  
• Francesca Cioffi, Ferruccio Orecchia:
  Computation of minimal generators of ideals of fat points. 72-76
  
• Gene Cooperman, Victor Grinberg:
  Scalable parallel coset enumeration using bulk definition. 77-84
  
• Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt:
  Towards factoring bivariate approximate polynomials. 85-92
  
• Olivier Cormier:
  On Liouvillian solutions of linear differential equations of order 4 and 5. 93-100
  
• Jean Della Dora, Aude Maignan, Mihaela Mirica-Ruse, Sergio Yovine:
  Hybrid computation. 101-108
  
• César Domínguez, Julio Rubio:
  Modeling inheritance as coercion in a symbolic computation system. 109-115
  
• Elisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager:
  Computation of the radical of polynomial ideals over fields of arbitrary characteristic. 116-120
  
• Steven Fortune:
  Polynomial root finding using iterated Eigenvalue computation. 121-128
  
• Mikhail V. Foursov, Marc Moreno Maza:
  On computer-assisted classification of coupled integrable equations. 129-136
  
• André Galligo, David Rupprecht:
  Semi-numerical determination of irreducible branches of a reduced space curve. 137-142
  
• Luca Gemignani:
  A generalized Graeffe's iteration for evaluating polynomials and rational functions. 143-149
  
• Laurent Granvilliers, Eric Monfroy, Frédéric Benhamou:
  Symbolic-interval cooperation in constraint programming. 150-166
  
• Jaime Gutierrez, Rosario Rubio San Miguel, David Sevilla:
  Unirational fields of transcendence degree one and functional decomposition. 167-174
  
• Guillaume Hanrot, François Morain:
  Solvability by radicals from an algorithmic point of view. 175-182
  
• Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
  Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. 183-191
  
• Jinwang Liu, Zhuojun Liu, Xiaoqi Liu, Mingsheng Wang:
  The membership problem for ideals of binomial skew polynomial rings. 192-195
  
• Neven Jurkovic:
  Diagnosing and correcting student's misconceptions in an educational computer algebra system. 195-200
  
• Raya Khanin:
  Dimensional analysis in computer algebra. 201-208
  
• Joze Korelc:
  Hybrid system for multi-language and multi-environment generation of numerical codes. 209-216
  
• Elizabeth L. Mansfield, Peter E. Hydon:
  Towards approximations which preserve integrals. 217-222
  
• Scott McCallum:
  On propagation of equational constraints in CAD-based quantifier elimination. 223-231
  
• Daniele Micciancio, Bogdan Warinschi:
  A linear space algorithm for computing the herite normal form. 231-236
  
• Mingsheng Wang, Zhuojun Liu:
  Remarks on Gröbner basis for ideals under composition. 237-244
  
• Jamie Mulholland, Michael B. Monagan:
  Algorithms for trigonometric polynomials. 245-252
  
• Victor Y. Pan:
  Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. 253-267
  
• Savvas Pericleous, Nicolai Vorobjov:
  New complexity bounds for cylindrical decompositions of sub-pfaffian sets. 268-275
  
• Olivier Ruatta:
  A multivariate Weierstrass iterative rootfinder. 276-283
  
• Tateaki Sasaki:
  Approximate multivariate polynomial factorization based on zero-sum relations. 284-291
  
• Yosuke Sato, Akira Suzuki:
  Discrete comprehensive Gröbner bases. 292-296
  
• B. David Saunders:
  Black box methods for least squares problems. 297-302
  
• Sidi Mohamed Sedjelmaci:
  On a parallel Lehmer-Euclid GCD algorithm. 303-308
  
• Alexandre Sedoglavic:
  A probabilistic algorithm to test local algebraic observability in polynomial time. 309-317
  
• J. Rafael Sendra, Franz Winkler:
  Computation of the degree of rational maps between curves. 317-322
  
• Emmanuel Thomé:
  Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. 323-331
  
• Joachim von zur Gathen:
  Irreducible trinomials over finite fields. 332-336
  
• Paul S. Wang, Simon Gray, Norbert Kajler, Dongdai Lin, Weidong Liao, Xiao Zou:
  IAMC architecture and prototyping: a progress report. 337-344
  
• Eugene V. Zima:
  On computational properties of chains of recurrences. 345
  

Last update Fri May 25 08:24:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page