Brownian motion and algorithm complexity
From MaRDI portal
The Brownian motion is shown to be a useful tool in analysing some sorting and tree manipulation algorithms.
Cites work
- A Note on Gray Code and Odd-Even Merge
- A probabilistic analysis of the height of tries and of the complexity of triesort
- An invariance principle for random walk conditioned by a late return to zero
- Combinatorial aspects of continued fractions
- Data Movement in Odd-Even Merging
- Excursions in Brownian motion
- scientific article; zbMATH DE number 3858075 (Why is no real title available?)
- scientific article; zbMATH DE number 3872676 (Why is no real title available?)
- scientific article; zbMATH DE number 3829247 (Why is no real title available?)
- scientific article; zbMATH DE number 3757718 (Why is no real title available?)
- scientific article; zbMATH DE number 3803442 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Kac's formula, levy's local time and brownian excursion
- On Deviations between Theoretical and Empirical Distributions
- On the Excursion Process of Brownian Motion
- On the height of trees
- On the integral of the absolute value of the pinned Wiener process
- Register Allocation for Unary–Binary Trees
- The analysis of simple list structures
- The average height of binary trees and other simple trees
- The Brownian excursion area: A numerical analysis
Cited in
(14)- Random walks, Gaussian processes and list structures
- A path integral approach to data structure evolution
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Some width function asymptotics for weighted trees
- Generalized covariances of multi-dimensional Brownian excursion local times.
- The descriptive complexity of Brownian motion
- Algorithms for Brownian dynamics across discontinuities
- Distinctness of compositions of an integer: A probabilistic analysis
- Quickest search over Brownian channels
- Probabilistic analysis of some distributed algorithms
- Exact and asymptotic distributions in digital and binary search trees
- Trie size in a dynamic list structure
- Dynamic analysis of some relational databases parameters
- Robust variations of interpolation search: An asymptotic analysis
This page was built for publication: Brownian motion and algorithm complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082076)
