The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulation
暂无分享,去创建一个
[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[2] Andrew Chi-Chih Yao,et al. The complexity of searching an ordered random table , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[3] F. Warren Burton,et al. A Robust Variation of Interpolation Search , 1980, Inf. Process. Lett..
[4] J. Doob. Heuristic Approach to the Kolmogorov-Smirnov Theorems , 1949 .
[5] H. Bateman,et al. Higher Transcendental Functions [Volumes I-III] , 1953 .
[6] Robert Sedgewick. Mathematical analysis of combinatorial algorithms , 1983 .
[7] F. Warren Burton,et al. Expected Complexity of Fast Search with Uniformly Distributed Data , 1981, Inf. Process. Lett..
[8] Alon Itai,et al. Interpolation search—a log logN search , 1978, CACM.
[9] Philippe Flajolet,et al. Analyse d'algorithmes de manipulation d'arbres et de fichiers , 1981 .
[10] S. Chandrasekhar. Stochastic problems in Physics and Astronomy , 1943 .
[11] M. Donsker. Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems , 1952 .