Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kurt Siegl

dblp:24/3326 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models
declarative parallelism
0.011993
Parallelizing Algorithms for Symbolic Computation using ||MAPLE|| · PPoPP 1993
Parallel and multicore computing
parallel programming models
0.011993
Parallelizing Algorithms for Symbolic Computation using ||MAPLE|| · PPoPP 1993
Parallel and multicore computing › parallel algorithms
parallel symbolic computation
0.011993
Parallelizing Algorithms for Symbolic Computation using ||MAPLE|| · PPoPP 1993

Methods — techniques the papers use, named apart from their topics

strand · 0.0maple · 0.0
YearPublicationVenuePosition
1995 Parallel Computation and Indefinite Summation: A MAPLE Application for the Rational Case
Roberto Pirastu, Kurt Siegl
J. Symb. Comput.2
1993 Parallelizing Algorithms for Symbolic Computation using ||MAPLE||
abstract
||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 different parallel programming paradigms shows that it is fairly easy to parallelize even complex algebraic algorithms using this system. Sample applications (among them algorithms solving multivariate nonlinear equation systems) are implemented on various parallel architectures. For example a straightforward parallelization of the complex and important problem of real root isolation has been parallelized using a generic Strand program of fewer than 20 lines of code and a slight modification of 5 lines in the original sequential Maple source. Even with such a simple modification we gained a speed-up of 5 times, that is better than thos...
Kurt Siegl
PPoPP1