C.A.R. Hoare. Algorithm 63 (partition) and algorithm 65 (find). Comm. ACM, 4,7:666--677, 1961. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Minimizing Randomness in Minimum Spanning Tree, Parallel.. - Pettie, Ramachandran (Correct)
....complexity is known to be 1:5n o(n) FR75, CM89] and it is shown in [DZ99] that any deterministic selection algorithm (even non uniform) must use (2 )n comparisons (the best deterministic algorithm [DZ01] uses about 2. 942n comparisons) Among randomized algorithms, Hoare s Find algorithm [Hoa61] uses O(log 2 n) random bits, but more than 1:5n o(n) comparisons. The [FR75] algorithm uses a polynomial number of random bits. We observe that [FR75] can be used with a pairwise independent sampler to use O(log n) random bits, and argue that there exist randomized selection algorithms that ....
C. A. R. Hoare. Algorithm 63 (PARTITION) and algorithm 65 (FIND). CACM, 4(7):321-322, 1961.
Thinking in Parallel: Some Basic Data-Parallel Algorithms and.. - Vishkin (2002) (1 citation) (Correct)
No context found.
C.A.R. Hoare. Algorithm 63 (partition) and algorithm 65 (find). Comm. ACM, 4,7:666--677, 1961.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC