6045 search results - page 954 / 1209 » Computable Linearizations of Well-partial-orderings |
151
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
148
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. In this paper, we present a methodology for mapping an Embedded Signal Processing ESP application onto HPC platforms such that the throughput performance is maximized. Pr...
128
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
178
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
133
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...