2 search results - page 1 / 1 » fsttcs 1990 |
FSTTCS
1990
Springer
13 years 9 months ago
1990
Springer
FSTTCS
1990
Springer
13 years 9 months ago
1990
Springer
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...