Sciweavers

Share
CAP
2010
8 years 7 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
CAP
2010
8 years 7 months ago
Spiral-generated modular FFT algorithms
Lingchuan Meng, Yevgen Voronenko, Jeremy R. Johnso...
CAP
2010
8 years 7 months ago
Cache friendly sparse matrix-vector multiplication
Sardar Anisul Haque, Shahadat Hossain, Marc Moreno...
CAP
2010
8 years 7 months ago
A quantitative study of reductions in algebraic libraries
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
Yue Li, Gabriel Dos Reis
CAP
2010
8 years 7 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
CAP
2010
8 years 7 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe
CAP
2010
8 years 7 months ago
Parallel arithmetic encryption for high-bandwidth communications on multicore/GPGPU platforms
In this work we study the feasibility of high-bandwidth, secure communications on generic machines equipped with the latest CPUs and General-Purpose Graphical Processing Units (GP...
Ludovic Jacquin, Vincent Roca, Jean-Louis Roch, Mo...
CAP
2010
8 years 7 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan
CAP
2010
8 years 7 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
CAP
2010
8 years 7 months ago
Accuracy versus time: a case study with summation algorithms
In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed,...
Philippe Langlois, Matthieu Martel, Laurent Th&eac...
books