#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1992

1995

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kurt Siegl
- 1993

kMAPLEk (speak: parallel Maple) is a portable system for parallel symbolic computation. The system is built as an interface between the parallel declarative programming language Strand and the sequential computer algebra system Maple, thus providing the elegance of Strand and the power of the existing sequential algorithms in Maple. The implementation of… (More)

- Kurt Siegl
- PPOPP
- 1993

||MAPLE|| (speak: parallel Maple) is a portable system for parallel symbolic computation. The system is built as an interface between the parallel declarative programming language Strand and the sequential computer algebra system Maple, thus providing the elegance of Strand and the power of the existing sequential algorithms in Maple.
The implementation of… (More)

- Roberto Pirastu, Kurt Siegl, Roberto Pirastuy
- 1994

The problem of computing a closed form for sums of special functions arises in many parts of mathematics and computer science, especially in combinatorics and complexity analysis. Here we discuss two algorithms for indeenite summation of rational functions, due to Abramov and Paule. We describe some improvements and a parallel implementation on a… (More)

- Roberto Pirastu, Kurt Siegl
- J. Symb. Comput.
- 1995

- Kurt Siegl
- 1992

This paper presents a new system for parallel symbolic computation called kMAPLEk (speak: parallel Maple), in which logic programming provides paralle-lism and imperative programming provides eeciency. The system is built as a combination between the parallel declarative programming language Strand and the sequential computer algebra system Maple. We… (More)

- Kurt Siegl
- 1994

The idea using polynomial factorization for speeding up the computation of Buch-berger's Grr obner bases algorithm for the purpose of polynomial equation solving leads to major improvements in the computation time. In this paper we show how one may introduce factoriza-tion within a parallel Grr obner basis algorithm, without unnecessary doubling parts of… (More)

- ‹
- 1
- ›