A class of logarithmic integrals

Rankings of partial derivatives

Lazy multiplication of formal power series

Uniform quantifier elimination and constraint query processing

On the worst-case complexity of integer Gaussian elimination

Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)

Fast algorithms for Taylor shifts and certain difference equations

Complexity and uniformity of elimination in Presburger arithmetic

Constructing faithful matrix representations of Lie algebras

Tensor product decomposition and other algorithms for representations of large simple Lie algebras

Polynomial time algorithms for modules over finite dimensional algebras

Finding relations among the roots of an irreducible polynomial

Relative resolvents and partition tables in Galois group computations

Resolvent computations by resultants without extraneous powers

Application of genetic algorithms to the algebraic simplification of tensor polynomials

Decomposing a permutation into a conjugated tensor product

A solution to the extended GCD problem with applications

Stabilization of polynomial systems solving with Groebner bases

Fraction-free computation of matrix Padé systems

A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots

Extraneous factors in the Dixon resultant formulation

Algorithms and design for a second-order automatic differentiation module

On symmetric powers of differential operators

An algorithm for computing exponential solutions of first order linear differential systems

A method for the integration of solutions of Ore equations

On randomized Lanczos algorithms

Fast polynomial factorization over high algebraic extensions of finite fields

The structure of sparse resultant matrices

A sequence of series for the Lambert W function

Meijer G function representations

Integral closure of Noetherian rings

A numerical absolute primality test for bivariate polynomials

Polynomial real root isolation using approximate arithmetic

Asymptotically fast computation of subresultants

An OpenMath 1.0 implementation

Network servers for symbolic mathematics

A toolbox for program manipulation and efficient code generation with an application to a problem in computer vision

Factoring polynomials over algebraic number fields via norms

GCD of polynomials and Bezout matrices

The average number of modular factors in Trager's polynomial factorization algorithm

A modular algorithm for computing greatest common right divisors of Ore polynomials

Minimal completely factorable annihilators

About the Newton algorithm for non-linear ordinary differential equations

Computer evaluation of cyclicity in planar cubic system

Symbolic manipulation of integrodifferential expressions and factorization of linear ordinary differential operators over transcendental extensions of a differential field

Rectilinear p-piercing problems

Integration of the signum, piecewise and related functions

The minimised geometric Buchberger algorithm: an optimal algebraic algorithm for integer programming

Practical integer division with Karatsuba complexity

Moduli spaces and symmetry loci of polynomial maps

A relatively optimal rational space curve reparametrization algorithm through canonical divisors

On computing the dual of a plane algebraic curve

Symbolic computation of object/image equations

SIMATH--a computer algebra system for number theoretic applications

Guarded expressions in practice

A survey of the Theorema project

On the computation of conjugacy classes in permutation groups

Computing with subgroups of automorphism groups of finite groups

Families of ideals in statistics

Maximizing performance on parallel machines (abstract)

The cycloheptane molecule (abstract): a challenge to computer algebra

Parallel computer algebra (tutorial)

"Real world" arithmetic (tutorial)