EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 / No 4 (1995) RAIRO-Theor. Inf. Appl., 29 4 (1995) 255-276 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 4, 1995
Page(s) 255 - 276
DOI https://doi.org/10.1051/ita/1995290402551
Published online 01 February 2017
  1. 1. G. BRASSARD and P. BRATLEY, Algorithms: Theory and Practice, Prentice-Hall, Englewoord Cliffs, New Jersey, 1988. [MR: 1013783] [Zbl: 0643.68003] [Google Scholar]
  2. 2. S. CAMBANIS, G. SIMONS and W. STOUT, Inequalities for the expected value of K (x, y) when the marginals are fîxed, Zeit Wahrsch. Verw. Geb., 1976, 36, pp. 285-294. [MR: 420778] [Zbl: 0325.60002] [Google Scholar]
  3. 3. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics, 1952, 23, pp. 493-507. [MR: 57518] [Zbl: 0048.11804] [Google Scholar]
  4. 4. Y. CHOW and H. TEICHER, Probability Theory, Springer Verlag, New York, 1978. [MR: 513230] [Zbl: 0399.60001] [Google Scholar]
  5. 5. K. CHUNG, A Course in Probability Theory, Second Edition, Academic Press, Orlando, Florida, 1974. [MR: 346858] [Google Scholar]
  6. 6. L. DEVROYE, Exponential bounds for the running time of a selection algorithm, Journal of Computer and System Sciences, 1984, 29, pp. 1-7. [MR: 761047] [Zbl: 0555.68018] [Google Scholar]
  7. 7. G. GONNET and R. BAEZA-YATES, Handbook of Algorithms and Data Structures in Pascal and C, Second Edition, Addison-Wesley, Reading, Massachusetts, 1991. [Zbl: 0719.68001] [Google Scholar]
  8. 8. P. HENNEQUIN, Combinatorial Analysis of Quicksort Algorithm, RAIRO, Theoretical Informatics and Applications, 1989, 23, pp. 317-333. [EuDML: 92337] [MR: 1020477] [Zbl: 0685.68058] [Google Scholar]
  9. 9. C. HOARE, Find (Algorithm 65), Communications of the ACM, 1961, 4, pp. 321-322. [Google Scholar]
  10. 10. C. HOARE, Quicksort, The Computer Journal, 1962, 5, pp. 10-15. [MR: 142216] [Zbl: 0108.13601] [Google Scholar]
  11. 11. D. KNUTH, The Art of Computer Programming, 3: Sorting and Searching, Addison-Wesley, Reading, Massachussetts, 1973. [Zbl: 0302.68010] [MR: 378456] [Google Scholar]
  12. 12. R. KRUISE, Data Structures and Program Design, Second Edition, Prentice-Hall, Englewood Cliffs, New Jersey, 1987. [Google Scholar]
  13. 13. E. LEHMANN, Nonparametrics: Statistical Methods Based on Ranks, Holden-Day, San Francisco/McGraw-Hill, New York, 1975. [MR: 395032] [Zbl: 0354.62038] [Google Scholar]
  14. 14. H. MAHMOUD, Evolution of Rondom Search Trees, John Wiley, New York, 1992. [Zbl: 0762.68033] [Google Scholar]
  15. 15. H. MAHMOUD, A law of large numbers for path lengths in search trees, Chapter in Random Graphs: Vol. II, A. FRIEZE and TOMASZ LUCZAK, eds., John Wiley, New York, 1992. [MR: 1166615] [Zbl: 0825.68491] [Google Scholar]
  16. 16. M. RÉGNIER, A limiting distribution for Quicksort, RAIRO, Theoretical Informatics and Applications, 1989, 23, pp. 335-343. [EuDML: 92338] [MR: 1020478] [Zbl: 0677.68072] [Google Scholar]
  17. 17. U. RÖSLER, A limit theorem for "QUICKSORT", RAIRO, Theoretical Informatics and Applications, 1991, 25, pp. 85-100. [EuDML: 92383] [MR: 1104413] [Zbl: 0718.68026] [Google Scholar]
  18. 18. R. SEDGEWICK, Quicksort with equal keys, SIAM J. on Computing, 1977, 6, pp. 240-267. [MR: 449004] [Zbl: 0356.68053] [Google Scholar]
  19. 19. R. SEDGEWICK, The analysis of quicksort programs, Acta Informatica, 1977, 7, pp. 327-355. [MR: 451845] [Zbl: 0325.68016] [Google Scholar]
  20. 20. R. SEDGEWICK, Quicksort, Garland, New York, 1980. [Google Scholar]
  21. 21. R. SEDGEWICK, Algorithms, Second edition, Addison-Wesley, Reading, Massachusetts, 1988. [Zbl: 0529.68002] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.