SPAA
1992
ACM
15 years 4 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
74
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
112
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
92
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
86
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...
68
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
76
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM