On the number of comparisons in Hoare's algorithm "find"

Studia Scientiarum Mathematicarum Hungarica

Volumn 33, Issue 1-3, 1997, Pages 185-207

  Kodaj, B ^a   Mori T F ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Coupling; Median; Probability distances; Wasserstein metric; Young functions

Indexed keywords

EID: 0012834694     PISSN: 00816906     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. ANDERSON, D. H. and BROWN, R., Combinatorial aspects of C. A. R. Hoare's FIND algorithm, Australas. J. Combin. 5 (1992), 109-119. MR 94e:05005
2. BARLOW, R. E. and PROSCHAN, F., Statistical theory of reliability and life testing. Probability models, Holt, Rinehart and Winston, New York, 1975. MR 55 #11534
3. BLUM, M., PRATT, V., TARJAN, R. E., FLOYD, R. W. and RIVEST, R. L., Time bounds for selection, J. Comput. System Sci. 7 (1973), 448-461. MR 48 #8256
4. CAMBANIS, S., SIMONS, G. and STOUT. W., Inequalities for εk(X, Y) when the marginals are fixed, Z. Wahrscheinlichkeitstheorie Verw. Gebiete 36 (1976), 285-294. MR 54 #8790
5. COLE, R. and YAP, CHEE K., A parallel median algorithm, Inform. Process. Lett. 20 (1985), 137-139. MR 86k:68004
6. CUNTO, W. and MUNRO, J. I., Average case selection, J. Assoc. Comput. Mach. 36 (1989), 270-279. MR 91f:68024
7. HOARE, C. A., Algorithm 65 FIND, Comm. ACM 4 (1961), 321.
8. KNUTH, D. E., Mathematical analysis of algorithms, Information processing '71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1: Foundations and systems, North-Holland, Amsterdam, 1972, 19-27. MR 53 #7122
9. KRASNOSEL'SKIǏ, M. A. and RUTICKIǏ, YA. B., Convex functions and Orlicz spaces, Noordhoff, Leiden, 1961. MR 23 #A4016
10. RACHEV, S. T., Probability metrics and the stability of stochastic models, Wiley, New York, 1991. MR 93b:60012
11. RIVEST, R. and FLOYD, R. W., Bounds for the expected time for median computations (extended abstract), Combinatorical algorithms (Courant Comput. Sci. Sympos. 9, New York Univ., New York, 1972), Algorithmics Press, New York, 1973, 69-76. MR 50 #11849
12. RIVEST, R. and FLOYD, R. W., Expected time bounds for selections, Comm. ACM 18 (1975), 165-172. Zbl 296.68049
13. SCHÖNHAGE, A., PATERSON, M. and PIPPENGER, N., Finding the median, J. Comput. System Sci. 13 (1976), 184-199. MR 55 #1814
14. SINGLETON, R. C., Algorithm 347: An efficent algorithm for sorting with minimal storage, Commun. ACM 12 (1969), 185-186. (See MR 94e:05005.)
15. YAP, CHEE K., New upper bounds for selection, Comm. ACM 19 (1976), 501-508. MR 54 #6559