3454 search results - page 424 / 691 » Modern computer algebra |
187
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
169
click to vote
EUROCAST
2001
Springer
15 years 10 months ago
2001
Springer
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
159
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
187
click to vote
EUROPAR
1997
Springer
15 years 10 months ago
1997
Springer
We experiment with sequential and parallel versions of the Karatsuba multiplication algorithm implemented under the paclib computer algebra system on a Sequent Symmetry shared-memo...
224
click to vote
CONCUR
1993
Springer
15 years 10 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...