scientific article; zbMATH DE number 3829247
From MaRDI portal
Publication:3674055
zbMATH Open0523.68031MaRDI QIDQ3674055FDOQ3674055
Publication date: 1983
Full work available at URL: https://eudml.org/doc/92194
Title of this publication is not available (Why is that?)
Brownian motionprobabilistic behaviouranalysis of sorted tablescomplexity of manipulation algorithms
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic Problems in Physics and Astronomy
- Title not available (Why is that?)
- Heuristic Approach to the Kolmogorov-Smirnov Theorems
- Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems
- Expected complexity of fast search with uniformly distributed data
- Interpolation search—a log log N search
- An algorithmic and complexity analysis of interpolation search
- Title not available (Why is that?)
Cited In (7)
- Some results on tries with adaptive branching.
- Brownian motion and algorithm complexity
- A path integral approach to data structure evolution
- Exact and asymptotic distributions in digital and binary search trees
- Robust variations of interpolation search: An asymptotic analysis
- Analytic analysis of algorithms
- Random walks, Gaussian processes and list structures
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)
