Free Access
RAIRO-Theor. Inf. Appl.
Volume 23, Number 3, 1989
Page(s) 317 - 333
Published online 01 February 2017
  1. 1 A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
  2. 2 L. COMTET, Analyse Combinatoire, P.U.F., Paris, 1970. [Zbl: 0221.05002] [Google Scholar]
  3. 3 P. FLAJOLET, Mathematical Analysis of Algorithms and Data Structures, I.N.R.I.A., Res. Rep., Vol. 400, 1985. [Google Scholar]
  4. 4 P. FLAJOLET and C. PUECH, Partial match retrieval of multidimensional data, J.A.C.M. 33, Vol. 2, 1986, pp.371-407. [MR: 835110] [Google Scholar]
  5. 5 D. FOATA, La série génératrice exponentielle dans les problèmes d'énumération, S.M.S., Montréal University Press, 1974. [MR: 505546] [Zbl: 0325.05007] [Google Scholar]
  6. 6 D. H. GREENE, Labelled Formal Languages and Their Uses, Ph. D. Thesis, 1983. [Google Scholar]
  7. 7 D. E. KNUTH, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Vol. 3, Sorting and searching, Addison Wesley, Reading, 1968, 1973. [Zbl: 0302.68010] [MR: 378456] [Google Scholar]
  8. 8 M. REGNIER, A limiting Distribution for Quicksort, RAIRO, Th. Informatics and Applications (to appear). [EuDML: 92338] [MR: 1020478] [Zbl: 0677.68072] [Google Scholar]
  9. 9 R. SEDGEWICK, Quicksort, Garland pub. co., New York, 1980. [Google Scholar]
  10. 10 J. M. STEYAERT, Complexité et structure des algorithmes, Thesis Paris, 1984. [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.