scientific article; zbMATH DE number 3829247

MaRDI QIDQ3674055zbMATHFDO

Authors Guy Louchard

Publication date 1983

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

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)

Cites work

• scientific article; zbMATH DE number 3642731 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3560404 (Why is no real title available?)
• scientific article; zbMATH DE number 3447884 (Why is no real title available?)
• An algorithmic and complexity analysis of interpolation search
• Expected complexity of fast search with uniformly distributed data
• Heuristic Approach to the Kolmogorov-Smirnov Theorems
• Interpolation search—a log log N search
• Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems
• Stochastic Problems in Physics and Astronomy

Cited in

(7)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674055)