FSTTCS 1990 Foundations of Software Technology and Theoretical Computer Science
 |  |
Wall of Fame | Most Viewed FSTTCS-1990 Paper
FSTTCS
1990
Springer
14 years 3 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...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 62 | ||
| 2 | | 53 |