ISSAC 1997: Maui, Hawaii, USA

Algorithms I

• Victor Adamchik: A Class of Logarithmic Integrals. 1-8
• C. J. Rust, Gregory J. Reid: Rankings of Partial Derivatives. 9-16
• Joris van der Hoeven: Lazy Multiplication of Formal Power Series. 17-20
• Saugata Basu: Uniform Quantifier Elimination and Constraint Query Processing. 21-27

Algorithms & Complexity I

• Xin Gui Fang, George Havas: On the Worst-case Complexity of Integer Gaussian Elimination. 28-31
• Gilles Villard: Further Analysis of Coppersmith's Block Wiedemann Algorithm for the Solution of Sparse Linear Systems (Extended Abstract). 32-39
• Joachim von zur Gathen, Jürgen Gerhard: Fast Algorithms for Taylor Shifts and Certain Difference Equations. 40-47
• Volker Weispfenning: Complexity and Uniformity of Elimination in Presburger Arithmetic. 48-53

Applications I

• Willem A. de Graaf: Constructing Faithful Matrix Representations of Lie Algebras. 54-59
• Andrej A. Zolotykh: Tensor Product Decomposition and Other Algorithms for Representations of Large Simple Lie Algebras. 60-67
• Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski: Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. 68-74

Polynomial Algorithms I

• John McKay, Richard Stauduhar: Finding Relations Among the Roots of an Irreducible Polynomial. 75-77
• Antoine Colin: Relative Resolvents and Partition Tables in Galois Group Computations. 78-84
• Frédéric Lehobey: Resolvent Computations by Resultants Without Extraneous Powers. 85-92

Algorithms II

• Masoud Kavian, R. G. McLenaghan, Keith O. Geddes: Application of Genetic Algorithms to the Algebraic Simplification of Tensor Polynomials. 93-100
• Sebastian Egner, Markus Püschel, Thomas Beth: Decomposing a Permutation into a Conjugated Tensor Product. 101-108
• Arne Storjohann: A Solution to the Extended GCD Problem with Applications. 109-116

Systems of Equations

• Hans J. Stetter: Stabilization of Polynomial Systems Solving with Groebner Bases. 117-124
• Bernhard Beckermann, Stanley Cabay, George Labahn: Fraction-free Computation of Catrix Padé Systems. 125-132
• Robert M. Corless, Patrizia M. Gianni, Barry M. Trager: A Reordered Schur Factorization Method for Zero-dimensional Polynomial Systems with Multiple Roots. 133-140
• Deepak Kapur, Tushar Saxena: Extraneous Factors in the Dixon Resultant Formulation. 141-148

Differential Equations I

• Jason Abate, Christian H. Bischof, Lucas Roh, Alan Carle: Algorithms and Design for a Second-Order Automatic Differentiation Module. 149-155
• Manuel Bronstein, Thom Mulders, Jacques-Arthur Weil: On Symmetric Powers of Differential Operators. 156-163
• Eckhard Pflügel: An Algorithm for Computing Exponential Solutions of First Order Linear Differential Systems. 164-171
• Sergei A. Abramov, Mark van Hoeij: A Method for the Integration of Solutions of Ore Equations. 172-175

Algorithms & Complexity II

• Wayne Eberly, Erich Kaltofen: On Randomized Lanczos Algorithms. 176-183
• Erich Kaltofen, Victor Shoup: Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. 184-188
• Ioannis Z. Emiris, Victor Y. Pan: The Structure of Sparse Resultant Matrices. 189-196

Applications II

• Robert M. Corless, David J. Jeffrey, Donald E. Knuth: A Sequence of Series for the Lambert W Function. 197-204
• Kelly Roach: Meijer G Functions Representations. 205-211
• Patrizia M. Gianni, Barry M. Trager: Integral Closure of Noetherian Rings. 212-216

Polynomial Algorithms II

• André Galligo, Stephen M. Watt: A Numerical Absolute Primality Test for Bivariate Polynomials. 217-224
• Jeremy R. Johnson, Werner Krandick: Polynomial Real Root Isolation using Approximate Arithmetic. 225-232
• Daniel Reischert: Asymptotically Fast Computation of Subresultants. 233-240

Systems I

• Stéphane Dalmas, Marc Gaëtano, Stephen M. Watt: An OpenMath 1.0 Implementation. 241-248
• Richard J. Fateman: Network Servers for Symbolic Mathematics. 249-256
• Michael B. Monagan, Gladys Monagan: A Toolbox for Program Manipulation and Efficient Code Generation with an Application to a Problem in Computer Vision. 257-264

Polynomial Algorithms III

• Mark J. Encarnación: Factoring Polynomials over Algebraic Number Fields via Norms. 265-270
• Luca Gemignani: GCD of Polynomials and Bezout Matrices. 271-277
• Mark J. Encarnación: The Average Number of Modular Factors in Trager's Polynomial Factorization Algorithm. 278-281
• Ziming Li, István Nemes: A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials. 282-289

Differential Equations II

• Sergei A. Abramov, Eugene V. Zima: Minimal Completely Factorable Annihilators. 290-297
• Jean Della Dora, F. Richard-Jung: About the Newton Algorithm for Non-Linear Ordinary Differential Equations. 298-304
• Victor F. Edneral: Computer Evaluation of Cyclicity in Planar Cubic System. 305-309
• Serguei P. Tsarev: Symbolic Manipulation of Integrodifferential Expressions and Factorization of Linear Ordinary Differential Operators over Transcendental Extensions of a Differential Field. 310-315

Algorithms III

• Doron Nussbaum: Rectilinear p-Piercing Problems. 316-323
• David J. Jeffrey, George Labahn, Martin von Mohrenschildt, A. D. Rich: Integration of the Signum, Piecewise and Related Functions. 324-330
• Qiang Li, Yike Guo, Tetsuo Ida, John Darlington: The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming. 331-338
• Tudor Jebelean: Practical Integer Division with Karatsuba Complexity. 339-341

Geometry

• Masayo Fujimura, Kiyoko Nishizawa: Moduli Spaces and Symmetry Loci of Polynomial Maps. 342-348
• Carlos Andradas, Tomás Recio, J. Rafael Sendra: A Relatively Optimal Rational Space Curve Reparametrization Algorithm Through Canonical Divisors. 349-355
• Emil Volcheck: On Computing the Dual of a Plane Algebraic Curve. 356-358
• Peter F. Stiller: Symbolic Computation of Object/Image Equations. 359-364

Systems II

• Horst Günter Zimmer: SIMATH - a Computer Algebra System for Number Theoretic Applications. 365-375
• Andreas Dolzmann, Thomas Sturm: Guarded Expressions in Practice. 376-383
• Bruno Buchberger, Tudor Jebelean, Franz Kriftner, Mircea Marin, Elena Tomuta, Daniela Vasaru: A Survey of the Theorema Project. 384-391

Applications III

• John J. Cannon, Bernd Souvignier: On the Computation of Conjugacy Classes in Permutation Groups. 392-399
• Charles C. Sims: Computing with Subgroups of Automorphism Groups of Finite Groups. 400-403
• Massimo Caboara, Lorenzo Robbiano: Families of Ideals in Statistics. 404-409