|
| Table of Contents
For full text in
Computing selected solutions of polynomial equations
Dinesh Manocha
Pages 1 - 8
Automating the construction of stationary multiple-point classes
Sylvain Petitjean
Pages 9 - 14
On the isomorphisms of smooth algebraic curves
Hong Du
Pages 15 - 19
Examples of automatic theorem proving a real geometry
Ahmed Guergueb, Jean Mainguené and Marie-Françoise Roy
Pages 20 - 24
A first report on the A
Stephen M. Watt, Peter A. Broadbery, Samuel S. Dooley, Pietro Iglio, Scott C. Morrison, Jonathan M. Steinbach and Robert S. Sutor
Pages 25 - 31
How to make AXIOM into a scratchpad
Richard D. Jenks and Barry M. Trager
Pages 32 - 40
The Albert nonassociative algebra system: a progress report
David P. Jacobs
Pages 41 - 44
GENTRAN 90: a REDUCE package for the generation of Fortran 90 code
W. N. Borst, V. V. Goldman and J. A. van Hulzen
Pages 45 - 51
Programming with algebraic structures: design of the MAGMA language
Wieb Bosma, John Cannon and Graham Matthews
Pages 52 - 57
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
Mark J. Encarnación
Pages 58 - 65
Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessors
Mohamed Omar Rayes, Paul S. Wang and Kenneth Weber
Pages 66 - 73
Automatic identification of time scales in enzyme kinetics models
Bruce W. Char and Mark F. Russo
Pages 74 - 83
A system for the symbolic analysis of problems in engineering mechanics
Philip H. Todd, Robin J. Y. McLeod and Marcia Harris
Pages 84 - 89
Factoring high-degree polynomials by the black box Berlekamp algorithm
Erich Kaltofen and Austin Lobo
Pages 90 - 98
Algebraic and geometric reasoning using Dixon resultants
Deepak Kapur, Tushar Saxena and Lu Yang
Pages 99 - 107
On computing sparse shifts for univariate polynomials
Y. N. Lakshman and B. David Saunders
Pages 108 - 113
Monomial bases and polynomial system solving (extended abstract)
Ioannis Z. Emiris and Ashutosh Rege
Pages 114 - 122
The Gro¨bner basis algorithm and subresultant theory
Ana Maria Mandache
Pages 123 - 128
The shape of the Shape Lemma
Eberhard Becker, Teo Mora, Maria Grazia Marinari and Carlo Traverso
Pages 129 - 133
Constructing permutation representations for large matrix groups
Gene Cooperman, Larry Finkelstein, Bryant York and Michael Tselman
Pages 134 - 138
Computing normalizers in permutation
Eugene M. Luks, Ferenc Rákóczi and Charles R. B. Wright
Pages 139 - 146
Constructing canonical presentations for subgroups of context-free groups in polynomial time (extended abstract)
Robert Cremanns and Friedrich Otto
Pages 147 - 153
Finding blocks of imprimitivity in small-base groups in nearly linear time
Martin Schönert and Ákos Seress
Pages 154 - 157
A conjecture on integration in finite terms with elementary functions and polylogarithms
Jamil Baddoura
Pages 158 - 162
Characteristic classes for irregular singularities
Ron Sommeling
Pages 163 - 168
D'Alembertian solutions of linear differential and difference equations
Sergei A. Abramov and Marko Petkovšek
Pages 169 - 174
Fast polynomial dispersion computation and its application to indefinite summation
Yiu-Kwong Man and Francis J. Wright
Pages 175 - 180
An application of symbolic computation in the physical sciences
Charles C. Dyer
Pages 181 - 186
Computing parameterizations of rational algebraic curves
Mark van Hoeij
Pages 187 - 190
Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion
Sandra Licciardi and Teo Mora
Pages 191 - 196
Sufficiency analysis for the calculus of variations
Robert M. Corless
Pages 197 - 204
How to compute the Melnikov vector?
Alain Goriely and Michael Tabor
Pages 205 - 210
On the implementation of a new algorithm for the computation of hyperelliptic integrals
Laurent Bertrand
Pages 211 - 215
Algorithms for finding the structure of solutions of a system of linear partial differential equations
Toshinori Oaku
Pages 216 - 223
Algebraic geometry and group theory in geometric constraint satisfaction
Oscar E. Ruiz S. and Placid M. Ferreira
Pages 224 - 233
Symbolic-numeric stability investigations of Jameson's schemes for the thin-layer Navier-Stokes equations
V. G. Ganzha, E. V. Vorozhtsov, J. Boers and J. A. van Hulzen
Pages 234 - 241
Chains of recurrences--a method to expedite the evaluation of closed-form functions
Olaf Bachmann, Paul S. Wang and Eugene V. Zima
Pages 242 - 249
Branch cuts in computer algebra
Adam Dingle and Richard J. Fateman
Pages 250 - 257
Quantifier elimination for real algebra--the cubic case
Volker Weispfenning
Pages 258 - 263
An algorithm for complexes
Roberto La Scala
Pages 264 - 268
A fine-grained parallel completion procedure
Reinhard Bündgen, Manfred Göbel and Wolfgang Küchlin
Pages 269 - 277
Symbolic-numeric nonlinear equation solving
Kelly Roach
Pages 278 - 284
The identity problem for elementary functions and constants
Dan Richardson and John Fitch
Pages 285 - 290
Signature functions for algebraic numbers
Michael B. Monagan and Gaston H. Gonnet
Pages 291 - 296
Asymptotically fast solution of Toeplitz-like singular linear systems
Erich Kaltofen
Pages 297 - 304
Fast algorithms for rational forms of integer matrices
Mark Giesbrecht
Pages 305 - 311
Fast parallel computation of the Smith normal form of polynomial matrices
Gilles Villard
Pages 312 - 317
Inheritance of rewrite rule structures applied to symbolic computation
Jason F. Harris
Pages 318 - 323
Algorithms for type inference with coercions
Andreas Weber
Pages 324 - 329
MP: a protocol for efficient exchange of mathematical expressions
Simon Gray, Norbert Kajler and Paul Wang
Pages 330 - 335
An improved algorithm for factoring linear ordinary differential operators
Manuel Bronstein
Pages 336 - 340
The use of the special semi-groups for solving differential equations
Jacques-Arthur Weil
Pages 341 - 347
Optical character recognition for typeset mathematics
Benjamin P. Berman and Richard J. Fateman
Pages 348 - 353
On the symbolic insimplification of the general 6R-manipulator kinematic equations
T. Recio and M. J. González-López
Pages 354 - 358
|
|
For full text in
|
The Digital Library is published by the Association for Computing Machinery. Copyright © 1999, 2000 ACM, Inc.
This page was last updated Thu, 10 Feb. 2000 15:16 -0500
.
| ||