scientific article

zbMath0523.68031MaRDI QIDQ3674055

Guy Louchard

Publication date: 1983

Full work available at URL: https://eudml.org/doc/92194

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Brownian motionprobabilistic behaviouranalysis of sorted tablescomplexity of manipulation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)

Related Items

Brownian motion and algorithm complexity, Random walks, Gaussian processes and list structures, Exact and asymptotic distributions in digital and binary search trees, A path integral approach to data structure evolution, Analytic analysis of algorithms, Some results on tries with adaptive branching., Robust variations of interpolation search: An asymptotic analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expected complexity of fast search with uniformly distributed data
• An algorithmic and complexity analysis of interpolation search
• Interpolation search—a log log N search
• Heuristic Approach to the Kolmogorov-Smirnov Theorems
• Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems
• Stochastic Problems in Physics and Astronomy