The brownian motion : a neglected tool for the complexity analysis of sorted tables manipulation
Open Access
- 1 January 1983
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 17 (4) , 365-385
- https://doi.org/10.1051/ita/1983170403651
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Expected complexity of fast search with uniformly distributed dataInformation Processing Letters, 1981
- A robust variation of interpolation searchInformation Processing Letters, 1980
- An algorithmic and complexity analysis of interpolation searchActa Informatica, 1980
- Interpolation search—a log log N searchCommunications of the ACM, 1978
- The complexity of searching an ordered random tablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov TheoremsThe Annals of Mathematical Statistics, 1952
- Heuristic Approach to the Kolmogorov-Smirnov TheoremsThe Annals of Mathematical Statistics, 1949
- Stochastic Problems in Physics and AstronomyReviews of Modern Physics, 1943