EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 17 / No 4 (1983) RAIRO. Inform. théor., 17 4 (1983) 365-385 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 17, Number 4, 1983
Page(s) 365 - 385
DOI https://doi.org/10.1051/ita/1983170403651
Published online 01 February 2017
  1. 1. H. BATEMAN, Higher Transcendal Functions, Vol. 1, McGraw-Hill, 1953. [MR: 58756] [Google Scholar]
  2. 2. F. W. BURTON and G. N. LEWIS, A Robust Variation of Interpolation Search, Information Processing Letters, Vol. 10, No. 4 and 5, 1980, pp.198-201. [Google Scholar]
  3. 3. S. CHANDRASEKHAR, Stochastic Problems in Physics and Astronomy, Review of Modern Physics, Vol. 15, 1943, pp. 57-59. [MR: 8130] [Zbl: 0061.46403] [Google Scholar]
  4. 4. D. R. COX and H. D. MILLER, The Theory of Stochastic Processes, Chapman and Hall, 1980. [Zbl: 0359.60004] [Google Scholar]
  5. 5. M. D. DONSKER, Justification and Extension of Doob's Heuristic Approach to the Kolmogorov-Smirnov Theorems, Annals of Mathematical Statistics, 1952, pp. 277-281. [MR: 47288] [Zbl: 0046.35103] [Google Scholar]
  6. 6. J. L. DOOB, Heuristic Approach to the Kolmogorov-Smirnov Theorems, Annals of Mathematical and Statistics, Vol. 20, 1949, pp. 393-403. [MR: 30732] [Zbl: 0035.08901] [Google Scholar]
  7. 7. P. FLAJOLET, Analyse d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du BURO, 1981, pp. 34-35. [EuDML: 272546] [Google Scholar]
  8. 8. G. H. GONNET, Interpolation and Interpolation-Hash Searching, Research Report CS-77-02, University of Waterloo, 1977. [MR: 2716070] [Google Scholar]
  9. 9. G. H. GONNET, D. R. LAWRENCE and J. A. GEORGE, An Algorithmic and Complexity Analysis of Interpolation Search, Acta Informatica, Vol. 13, 1980, pp. 39-52. [MR: 557548] [Zbl: 0405.68057] [Google Scholar]
  10. 10. K. ITO and Jr. H. P. MCKEAN, Diffusion Processes and their Sample Paths, Springer-Verlag, 1974. [MR: 345224] [Zbl: 0285.60063] [Google Scholar]
  11. 11. D. E. KNUTH, The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973. [MR: 445948] [Zbl: 0302.68010] [Google Scholar]
  12. 12. G. N. LEWIS, N. J. BOYNTON and F. W. BURTON, Expected Complexity of Fast Search with Uniformly Distributed Data, Information Processing Letters, Vol. 13, No. 1, 1981, pp. 4-7. [MR: 636310] [Zbl: 0468.68061] [Google Scholar]
  13. 13. Y. PERL, A. ITAI and H. AVNI, Interpolation Search. A Log Log N Search, Communications of the ACM, Vol. 21, No. 7, 1978, pp. 550-553. [MR: 489109] [Zbl: 0378.68029] [Google Scholar]
  14. 14. R. SEDGEWICK, Mathematical Analysis of Combinatorial Algorithms in Probability and Computer Science, G. LATOUCHE and G. LOUCHARD, Ed., Academic Press (to appear). [MR: 753477] [Google Scholar]
  15. 15. A. C. YAO and F. F. YAO, The Complexity of Searching an Ordered Random Table, Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976, pp. 173-177. [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.