ISSAC 1995: Montreal, Canada

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC '95, Montreal, Canada, July 10-12, 1995. ACM Press, 1995

Differential Equations

Ian G. Lisle, Gregory J. Reid, A. Boulton:
Algorithmic Determination of Structure of Infinite Lie Pseudogroups of Symmetries of PDEs. 1-6
Electronic Edition (ACM DL) BibTeX
Thomas Wolf:
Programs for Applying Symmetries. 7-15
Electronic Edition (ACM DL) BibTeX
Fritz Schwarz:
Symmetries of 2^nd and 3^rd Order ODE's. 16-25
Electronic Edition (ACM DL) BibTeX
M. J. Doffou, Robert L. Grossman:
The Symbolic Computation of Differential Invariants of Polynomial Vector Field Systems Using Trees. 26-31
Electronic Edition (ACM DL) BibTeX

Ron Avitzur, Olaf Bachmann, Norbert Kajler:
From Honest to Intelligent Plotting. 32-41
Electronic Edition (ACM DL) BibTeX
Eugene V. Zima:
Simplification and Optimization Transformations of Chains of Recurrences. 42-50
Electronic Edition (ACM DL) BibTeX
Trân Quoc Nam:
A Hybrid Symbolic-Numerical Method for Tracing Surface-to-Surface Intersections. 51-58
Electronic Edition (ACM DL) BibTeX
Shankar Krishnan, Dinesh Manocha:
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets. 59-67
Electronic Edition (ACM DL) BibTeX

Mario Daberkow, Michael Pohst:
Computations with Relative Extensions of Number Fields with an Application to the Construction of Hilbert Class Fields. 68-76
Electronic Edition (ACM DL) BibTeX
Peter A. Broadbery, T. Gómez-Díaz, Stephen M. Watt:
On the Implementation of Dynamic Evaluation. 77-84
Electronic Edition (ACM DL) BibTeX
Kazuhiro Yokoyama, Ziming Li, István Nemes:
Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial. 85-89
Electronic Edition (ACM DL) BibTeX
Mark van Hoeij:
An Algorithm for Computing the Weierstrass Normal Form. 90-95
Electronic Edition (ACM DL) BibTeX

Dima Grigoriev, Yagati N. Lakshman:
Algorithms for Computing Sparse Shifts for Multivariate Polynomials. 96-103
Electronic Edition (ACM DL) BibTeX
Daniel Richardson:
A Simplified Method of Recognizing Zero Among Elementary Constants. 104-109
Electronic Edition (ACM DL) BibTeX
Mark Giesbrecht:
Fast Computation of the Smith Normal Form of an Integer Matrix. 110-118
Electronic Edition (ACM DL) BibTeX
Arne Storjohann, George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation. 119-125
Electronic Edition (ACM DL) BibTeX

Gene Cooperman:
STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems. 126-132
Electronic Edition (ACM DL) BibTeX
T. H. Einwohner, Richard J. Fateman:
Searching Techniques for Integral Tables. 133-139
Electronic Edition (ACM DL) BibTeX
Neil Soiffer:
Mathematical Typesetting in Mathematica. 140-149
Electronic Edition (ACM DL) BibTeX
Clemens Ballarin, Karsten Homann, Jacques Calmet:
Theorems and Algorithms: An Interface between Isabelle and Maple. 150-157
Electronic Edition (ACM DL) BibTeX

François Boulier, Daniel Lazard, François Ollivier, Michel Petitot:
Representation for the Radical of a Finitely Generated Differential Ideal. 158-166
Electronic Edition (ACM DL) BibTeX
Maria Grazia Marinari, Teo Mora, H. Michael Möller:
Gröbner Duality and Multiplicities in Polynomial System Solving. 167-179
Electronic Edition (ACM DL) BibTeX
Laureano González-Vega, Guadalupe Trujillo:
Implicitization of Parametric Curves and Surfaces by Using Symmetric Functions. 180-186
Electronic Edition (ACM DL) BibTeX
Deepak Kapur, Tushar Saxena:
Comparison of Various Multivariate Resultant Formulations. 187-194
Electronic Edition (ACM DL) BibTeX

Robert M. Corless, Patrizia M. Gianni, Barry M. Trager, Stephen M. Watt:
The Singular Value Decomposition for Polynomial Systems. 195-207
Electronic Edition (ACM DL) BibTeX
Klaus-Dieter Semmler, Mika Seppälä:
Numerical Uniformization of Hyperelliptic Curves. 208-215
Electronic Edition (ACM DL) BibTeX
Claudine Chaffy:
The Analytic Continuation Process: From Computer Algebra to Numerical Analysis. 216-222
Electronic Edition (ACM DL) BibTeX
M. P. Quéré, Gilles Villard:
An Algorithm for the Reduction of Linear DAE. 223-231
Electronic Edition (ACM DL) BibTeX

Angel Díaz, Erich Kaltofen:
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. 232-239
Electronic Edition (ACM DL) BibTeX
Hsin-Chao Liao, Richard J. Fateman:
Evaluation of the Heuristic Polynomial GCD. 240-247
Electronic Edition (ACM DL) BibTeX
Bohdan S. Majewski, George Havas:
A Solution to the Extended GCD Problem. 248-253
Electronic Edition (ACM DL) BibTeX
Jonathan Sorenson:
An Analysis of Lehmer's Euclidean GCD Algorithm. 254-258
Electronic Edition (ACM DL) BibTeX

Gene Cooperman, Larry Finkelstein, Michael Tselman:
Computing with Matrix Groups Using Permutation Representations. 259-264
Electronic Edition (ACM DL) BibTeX
Ferenc Rakoczi:
Fast Recognition of the Nilpotency of Permutation Groups. 265-269
Electronic Edition (ACM DL) BibTeX
Prabhav Marje:
A Nearly Linear Algorithm for Sylow Subgroups in Small-Base Groups. 270-277
Electronic Edition (ACM DL) BibTeX
Torsten Minkwitz:
On the Computation of Ordinary Irreducible Representations of Finite Groups. 278-284
Electronic Edition (ACM DL) BibTeX

Sergei A. Abramov:
Rational Solutions of linear Difference and q-Difference Equations with Polynomial Coefficients. 285-289
Electronic Edition (ACM DL) BibTeX
Sergei A. Abramov, Manuel Bronstein, Marko Petkovsek:
On Polynomial Solutions of Linear Operator Equations. 290-296
Electronic Edition (ACM DL) BibTeX
Moulay A. Barkatou:
A Rational Version of Moser's Algorithm. 297-302
Electronic Edition (ACM DL) BibTeX
Sergei A. Abramov:
Indefinite Sums of Rational Functions. 303-308
Electronic Edition (ACM DL) BibTeX