ISSAC '88, Proceedings of the International Symposium on Symbolic and Algebraic Computation. Rome, Italy, July 4--8, 1988. (Q1801240)

[The articles of this volume will not be indexed individually.] Contents: \textit{Invited talks}: \textit{G. Ausiello}, \textit{A. Marchetti Spaccamela} and \textit{U. Nanni}, Dynamic maintenance of paths and path expressions on graphs, pp. 1--12; \textit{D. R. Musser} and \textit{A. A. Stepanov}, Generic programming, pp. 13--25; \textit{F. Sergeraert}, From a noncomputability result to new interesting definitions and computability results, pp. 26--32; \textit{N. Sharma} and \textit{P. S. Wang}, Symbolic derivation and automatic generation of parallel routines for finite element analysis, pp. 33--56. \textit{Differential algebra}: \textit{M. F. Singer}, Liouvillian first integrals of differential equations, pp. 57--63; \textit{M. Bronstein}, Fast reduction of the Risch differential equation, pp. 64--72. \textit{Applications}: \textit{C. Chaffy-Camus}, An application of \texttt{REDUCE} to the approximation of \(f(x,y)\), pp. 73--84; \textit{F. Vinette} and \textit{J. Čížek}, The use of symbolic computation in solving non- relativistic quantum mechanical problems, pp. 85--95; \textit{S. K. Abdali} and \textit{D. S. Wise}, Experiments with quadtree representations of matrices, pp. 96--108; \textit{B. W. Char}, \textit{A. R. Macnaughton} and \textit{P. A. Strooper}, Discovering inequality conditions in the analytical solution of optimization problems, pp. 109--115; \textit{H. Caprasse}, \textit{J. Demaret} and E. Schrüfer, Can \texttt{EXCALC} be used to investigate high- dimensional cosmological models with nonlinear Lagrangians? pp. 116--124. \textit{Gröbner bases}: \textit{C. Traverso}, Gröbner trace algorithms, pp. 125--138; \textit{H. Kobayashi}, \textit{S. Moritsugu} and \textit{R. W. Hogan}, Solving systems of algebraic equations, pp. 139--149; \textit{T. Mora}, Gröbner bases in non-commutative algebras, pp. 150--161; \textit{A. Galligo}, \textit{L. Pottier} and \textit{C. Traverso}, Greater easy common divisor and standard basis completion algorithms, pp. 162--176; \textit{S. Arnborg}, Experiments with a projection operator for algebraic decomposition, pp. 177--182. \textit{Differential equations}: \textit{M. A. Barkatou}, Rational Newton algorithm for computing formal solutions of linear differential equations, pp. 183--195; \textit{M. A. H. MacCallum}, An ordinary differential equation solver for \texttt{REDUCE}, pp. 196--205; \textit{S. M. Watt}, A fixed point method for power series computation, pp. 206--217; \textit{E. Freire}, \textit{E. Gamero}, \textit{E. Ponce} and \textit{L. G. Franquelo}, An algorithm for symbolic computation of center manifolds, pp. 218-230. \textit{Algorithmic number theory}: \textit{H. Rolletschek}, Shortest division chains in imaginary quadratic number fields, pp. 231--243; \textit{R. J. Bradford} and \textit{J. H. Davenport}, Effective tests for cyclotomic polynomials, pp. 244--251; \textit{G. E. Collins} and \textit{J. R. Johnson}, The probability of relative primality of Gaussian integers, pp. 252--258; \textit{A. J. Menezes}, \textit{P. C. van Oorschot} and \textit{S. A. Vanstone}, Some computational aspects of root finding in \(\text{GF}(q^ m)\), pp. 259--270; \textit{A. Juozapavičius}, Symbolic computation for Witt rings, pp. 271--273. \textit{Algebraic geometry}: \textit{S. S. Abhyankar} and \textit{Ch. L. Bajaj}, Computations with algebraic curves, pp. 274--284; \textit{J. Teitelbaum}, On the computational complexity of the resolution of plane curves singularities, pp. 285--292; \textit{J. Canny}, Generalized characteristic polynomials, pp. 293--299; \textit{P. Gianni}, \textit{V. Miller} and \textit{B. Trager}, Decomposition of algebras, pp. 300--308; \textit{M. Giusti}, \textit{D. Lazard} and \textit{A. Valibouze}, Algebraic transformations of polynomial equations, symmetric polynomials and elimination, pp. 309--314. \textit{Computational geometry}: \textit{H. Edelsbrunner}, \textit{F. P. Preparata} and \textit{D. B. West}, Tetrahedrizing point sets in three dimensions, pp. 315--331; \textit{S. Stifter}, A generalization of the Roider method to solve the robot collision problem in 3D, pp. 332--343; \textit{P. H. Todd} and \textit{G. W. Cherry}, Symbolic analysis of planar drawings, pp. 344--355; \textit{F. Winkler}, A geometrical decision algorithm based on the Gröbner bases algorithm, pp. 356--363. \textit{Computational logic}: \textit{C. Brown}, \textit{G. Cooperman} and \textit{L. Finkelstein}, Solving permutation problems using rewriting systems, pp. 364--377; \textit{D. Wissmann}, Applying rewriting techniques to groups with power-commutation-presentations, pp. 378--389; \textit{V. Weispfenning}, Efficient decision procedures for locally finite theories II, pp. 390--401; \textit{T. Boy de la Tour} and \textit{R. Caferra}, A formal approach to some usually informal techniques used in mathematical reasoning, pp. 402--406; \textit{D. Cantone}, \textit{V. Cutello} and \textit{A. Ferro}, Decision procedures for elementary sublanguages of set theory XIV: Three languages involving rank related constructs, pp. 407--422. \textit{Systems}: \textit{J.-L. Roch}, \textit{P. Senechaud}, \textit{F. Siebert-Roch} and \textit{G. Villard}, Computer algebra on MIMD machine, pp. 423--439; \textit{C. Dicrescenzo} and \textit{D. Duval}, Algebraic extensions and algebraic closure in Scratchpad II, pp. 440--446; \textit{H. Kredel}, Software development for computer algebra or From ALDES/SAC-2 to WEB/Modula-2, pp. 447--455; \textit{G. Butler} and \textit{J. Cannon}, Cayley, version 4: the user language, pp. 456--466. \textit{Arithmetic}: \textit{E. Kaltofen} and \textit{L. Yagati}, Improved sparse multivariate polynomial interpolation algorithm, pp. 467--474; \textit{K. O. Geddes}, \textit{G. H. Gonnet} and \textit{T. J. Smedley}, Heuristic methods for operations with algebraic numbers, pp. 475-480; \textit{J. Shackell}, Asymptotic estimation of oscillating functions using an interval calculus, pp. 481--489; \textit{K. O. Geddes} and \textit{G. H. Gonnet}, A new algorithm for computing symbolic limits using hierarchical series, pp. 490--495; \textit{I. R. Hentzel} and \textit{D. J. Pokrass}, Verification of non-identities in algebras, pp. 496--507. \textit{Miscellaneous}: \textit{H. Abdulrab}, Equations in words, pp. 508--520; \textit{N. L. White} and \textit{T. McMillan}, Cayley factorization, pp. 521--533; \textit{D. Yu. Grigor'ev}, Complexity of computing the characters and the genre of a system of exterior differential equations, pp. 534--543.