|
| Table of Contents
For full text in
On the reduction of linear systems of difference equations
M. A. Barkatou
Pages 1 - 6
A differential-equations approach to functional equivalence
J. Shackle
Pages 7 - 10
Series solutions of algebraic and differential equations: a comparison of linear and quadratic algebraic convergence
R. J. Fateman
Pages 11 - 16
A factorization algorithm for linear ordinary differential equations
F. Schwarz
Pages 17 - 25
An improved Las Vegas primality test
E. Kaltofen, T. Valente and N. Yui
Pages 26 - 33
On some computations with dense structured matrices
Victor Pan
Pages 34 - 42
Inversibility of rational mappings and structural identifiability in automatics
F. Ollivier
Pages 43 - 54
Knuth-Bendix procedure and Buchberger algorithm: a synthesis
F. Winkler
Pages 55 - 67
Lookup tables, recurrences and complexity
R. J. Fateman
Pages 68 - 73
Labeled trees and the efficient computation of derivations
R. Grossman and R. G. Larson
Pages 74 - 80
Factoring rational polynomials over the complexes
C. Bajaj, J. Canny, R. Garrity and J. Warren
Pages 81 - 90
A new modular algorithm for computation of algebraic number polynomial gcds
T. J. Smedley
Pages 91 - 94
A fast, reliable algorithm for calculating Pade´-Hermite forms
S. Cabay and G. Labahn
Pages 95 - 100
Computing with algebraic series
M. E. Alonso, T. Mora and M. Raimondo
Pages 101 - 111
Recovery of algebraic numbers from their
John Abbott
Pages 112 - 120
Solving systems of nonlinear polynomial equations faster
J. F. Canny, E. Kaltofen and L. Yagati
Pages 121 - 128
Some results on the defect
R. Bradford
Pages 129 - 135
Sturm-Habicht sequence
L. Gaonzalez, H. Lombardi, T. Recio and M.-F. Roy
Pages 136 - 146
MINION: an environment to organize mathematical problem solving
J. M. Purtilo
Pages 147 - 154
Can REDUCE be run in parallel?
J. Fitch
Pages 155 - 162
A code optimization package for REDUCE
J. A. van Hulzen, B. J. Hulshof, B. L. Gates and M. C. van Heerwaarden
Page 163
A MACSYMA package for the generation and manipulation of chebyshev series
T. H. Einwohner and R. J. Fateman
Pages 180 - 185
GENCRAY: a portable code generator for cray fortran
S. Weerawarana and P. S. Wang
Pages 186 - 191
Experimenting the Gro¨bner basis algorithm with the A1PI system
C. Traverso and L. Donati
Pages 192 - 198
A program generator for efficient evaluation of fourier series
B. R. Miller
Pages 199 - 206
Simplification of real elementary functions
M. Bronstein
Pages 207 - 211
On the risch-norman integration method and its implementation in MAPLE
K. O. Geddes and L. Y. Stefanus
Pages 212 - 217
Symbolic summation with generating functions
R. A. Ravenscroft and E. A. Lamagna
Pages 228 - 233
Automatic reasoning about numerical stability of rational expressions
B. W. Char
Pages 234 - 241
Computing the normal forms of matrices depending on parameters
G. Chen
Pages 242 - 249
On the castelnuovo regularity for curves
M. Giusti
Pages 250 - 253
Careful algebraic translations of geometry theorems
B. Kutzler
Pages 254 - 263
Quantifier elimination and the sign variation method for real root isolation
G. E. Collins and J. R. Johnson
Pages 264 - 271
On the computer solution of symmetric homogeneous triangle inequalities
S. Rabinowitz
Pages 272 - 286
Dense representation of affine coordinate rings of curves with one point at infinity
S. C. Porter
Pages 287 - 297
A parallel implementation of the cylindrical algebraic decomposition algorithm
B. D. Saunders, H. R. Lee and S. K. Abdali
Pages 298 - 307
Massively parallel symbolic computation
A. Deprit and E. Deprit
Pages 308 - 316
Parallel algorithms for hermite normal form of an integer matrix
F. Siebert-Roch
Pages 317 - 321
Using rewriting techniques to solve the generalized word problem in polycyclic groups
J. Avenhaus and D. Wi:Gbmann
Pages 322 - 337
A method for enumerating cosets of a group presented by a canonical system
N. Kuhn and K. Madlener
Pages 338 - 350
Reduction of group constructions to point stabilizers
G. Cooperman, L. Finkelstein and E. Luks
Pages 351 - 356
Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system
M. Okada
Pages 357 - 363
Note on theorem proving strategies for resolution counterparts of non-classical logics
P. O'Hearn and Z. Stachniak
Pages 364 - 372
Employing path dissolution to shorten tableaux proofs
N. V. Murray and E. Rosenthal
Pages 373 - 381
Constrained equational reasoning
C. Kirchner and H. Kirchner
Pages 382 - 389
Resolvents and symmetric functions
A. Valibouze
Pages 390 - 399
|
|
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 Wed, 1 Mar. 2000 15:44 -0500
.
| ||