ISSAC 1999: Vancouver, B.C., Canada
Keith O. Geddes, Bruno Salvy, Samuel S. Dooley (Eds.): Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999. ACM 1999 ISBN 1-58113-073-2
Mohamed Elkadi, Bernard Mourrain: A New Algorithm for the Geometric Decomposition of a Variety. 9-16
Carlos Andradas, Tomás Recio, J. Rafael Sendra: Base Field Restriction Techniques for Parametric Curves. 17-22
John J. Wavrik: Commutativity Theorems: Examples in Search of Algorithms. 31-36
Willem A. de Graaf, J. Wisliceny: Constructing Bases of Finitely Presented Lie Algebras Using Gröbner Bases in Free Algebras. 37-43
Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble: Efficient Construction of Drinfel'd Doubles. 45-52
Victor Shoup: Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields. 53-58
Erich Kaltofen, Michael B. Monagan: On the Genericity of the Modular Polynomial GCD Algorithm. 59-66
Zeljko Zilic, Katarzyna Radecka: On Feasible Multivariate Polynomial Interpolations over Arbitrary Fields. 67-74
Joachim von zur Gathen, Michael Nöcker: Computing Special Powers in Finite Fields (extended abstract). 83-90
Igor Pak, Sergey Bratus: On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract). 91-96
John Shackell: Star Products and the Representation of Asymptotic Growth. 97-104
C. J. Rust, Gregory J. Reid, Allan D. Wittkopf: Existence and Uniqueness Theorems for Formal Power Series Solutions of Analytic Differential Systems. 105-112
Y. O. Macutan: Formal Solutions of Scalar Singularly-Perturbed Linear Differential Equations. 113-120
Claude-Pierre Jeannerod, Eckhard Pflügel: A Reduction Algorithm for Matrices Depending on a Parameter. 121-128
Volker Weispfenning: Mixed Real-Integer Linear Quantifier Elimination. 129-136
Christopher W. Brown: Guaranteed Solution Formula Construction. 137-144
Scott McCallum: On Projection in CAD-Based Quantifier Elimination with Equational Constraint. 145-149
Serguei P. Tsarev: On Factorization of Nonlinear Ordinary Differential Equations. 159-164
Guoting Chen, Jean Della Dora: Rational Normal Form for Dynamical Systems by Carleman Linearization. 165-172
Manuel Bronstein, Anne Fredet: Solving Linear Ordinary Differential Equations over C(x, eint f(x) dx). 173-179
Bernhard Beckermann, George Labahn, Gilles Villard: Shifted Normal Forms of Polynomial Matrices. 189-196
John Abbott, Manuel Bronstein, Thom Mulders: Fast Deterministic Computation of Determinants of Dense Matrices. 197-204
Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman: Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. 205-212
Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt: Approximate polynomial decomposition. 213-219
Dominique Villard, Michael B. Monagan: ADrien: An Implementation of Automatic Differentiation in Maple. 221-228
Nicolas J. Doye: Automated Coercion for Axiom. 229-235
Laurent Bernardin, Bruce W. Char, Erich Kaltofen: Symbolic Computation in Java: An Appraisement. 237-244
A. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin: Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study. 253-260
Delphine Boucher: About the Polynomial Solutions of Homogeneous Linear Differential Equations Depending on Parameters. 261-268
Sergei A. Abramov, Mark van Hoeij: Desingularization of Linear Difference Operators with Polynomial Coefficients. 269-275
Moulay A. Barkatou: Rational Solutions of Matrix Difference Equations: The Problem of Equivalence and Factorization. 277-282
Olivier Arsac, Stéphane Dalmas, Marc Gaëtano: Design of a Customizable Component to Display and Edit Formulas. 283-290
Paul S. Wang: Design and Protocol for Internet Accessible Mathematical Computation. 291-298
Ha Q. Le, Chris Howlett: Client-Server Communication Standards for Mathematical Computation. 299-306



