ISSAC 2002: Lille, France

• Sergei A. Abramov:
  Applicability of Zeilberger's algorithm to hypergeometric terms. 1-7
  
• Bernhard Beckermann, Howard Cheng, George Labahn:
  Fraction-free row reduction of matrices of skew polynomials. 8-15
  
• Russell J. Bradford, James H. Davenport:
  Towards better simplification of elementary functions. 16-22
  
• Manuel Bronstein, Sébastien Lafaille:
  Solutions of linear ordinary differential equations in terms of special functions. 23-28
  
• Arthur D. Chtcherba, Deepak Kapur:
  On the efficiency and optimality of Dixon-based resultant methods. 29-36
  
• Robert M. Corless, André Galligo, Ilias S. Kotsireas, Stephen M. Watt:
  A geometric-numeric algorithm for absolute factorization of multivariate polynomials. 37-45
  
• Alicia Dickenstein, Ioannis Z. Emiris:
  Multihomogeneous resultant matrices. 46-54
  
• Samuel S. Dooley:
  Editing mathematical content and presentation markup in interactive mathematical documents. 55-62
  
• Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet:
  Finite field linear algebra subroutines. 63-74
  
• Pilar Fernandez-Ferreiros, Maria de los Angeles Gomez-Molleda, Laureano González-Vega:
  Partial solvability by radicals. 84-91
  
• Elisabetta Fortuna, Patrizia M. Gianni, Paola Parenti, Carlo Traverso:
  Computing the topology of real algebraic surfaces. 92-100
  
• Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee:
  Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. 101-108
  
• Mark van Hoeij, Michael B. Monagan:
  A modular GCD algorithm over number fields presented with multiple extensions. 109-116
  
• Joris van der Hoeven:
  A new zero-test for formal power series. 117-122
  
• Shahadat Hossain, Trond Steihaug:
  Sparsity issues in the computation of Jacobian matrices. 123-130
  
• Claude-Pierre Jeannerod:
  A reduced form for perturbed matrix polynomials. 131-137
  
• Erich Kaltofen:
  An output-sensitive variant of the baby steps/giant steps determinant algorithm. 138-144
  
• Amit Khetan:
  Determinantal formula for the chow form of a toric surface. 145-150
  
• Irina A. Kogan, Marc Moreno Maza:
  Computation of canonical forms for ternary cubics. 151-160
  
• Ha Q. Le:
  Simplification of definite sums of rational functions by creative symmetrizing method. 161-167
  
• Ziming Li, Fritz Schwarz, Serguei P. Tsarev:
  Factoring zero-dimensional ideals of linear partial differential operators. 168-175
  
• Eugene M. Luks, Takunari Miyazaki:
  Polynomial-time normalizers for permutation groups with restricted composition factors. 176-183
  
• Guillermo Matera, Alexandre Sedoglavic:
  The differential Hilbert function of a differential rational mapping can be computed in polynomial time. 184-191
  
• Kosaku Nagasaka:
  Towards certified irreducibility testing of bivariate approximate polynomials. 192-199
  
• Masayuki Noro, Kazuhiro Yokoyama:
  Yet another practical implementation of polynomial factorization over finite fields. 200-206
  
• Victor Y. Pan, Xinmao Wang:
  Acceleration of Euclidean algorithm and extensions. 207-213
  
• Daniel Richardson, Simon Langley:
  Some observations on familiar numbers. 214-220
  
• Renaud Rioboo:
  Towards faster real algebraic numbers. 221-228
  
• Josef Schicho:
  Simplification of surface parametrizations. 229-237
  
• Éric Schost:
  Degree bounds and lifting techniques for triangular sets. 238-245
  
• Arne Storjohann:
  High-order lifting. 246-254
  
• Akira Suzuki, Yosuke Sato:
  An alternative approach to comprehensive Gröbner bases. 255-261
  
• Carlo Traverso, Alberto Zanoni:
  Numerical stability and stabilization of Groebner basis computation. 262-269
  
• Volker Weispfenning:
  Canonical comprehensive Gröbner bases. 270-276
  

Last update Fri May 24 19:29:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page