Brownian motion and algorithm complexity
From MaRDI portal
Publication:1082076
DOI10.1007/BF01939359zbMath0602.68034MaRDI QIDQ1082076
Publication date: 1986
Published in: BIT (Search for Journal in Brave)
Related Items
Random walks, Gaussian processes and list structures, Some width function asymptotics for weighted trees, Generalized covariances of multi-dimensional Brownian excursion local times., Exact and asymptotic distributions in digital and binary search trees, A path integral approach to data structure evolution, Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis, Dynamic analysis of some relational databases parameters, Distinctness of compositions of an integer: A probabilistic analysis, Probabilistic analysis of some distributed algorithms, Trie size in a dynamic list structure, Robust variations of interpolation search: An asymptotic analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic analysis of the height of tries and of the complexity of triesort
- The Brownian excursion area: A numerical analysis
- The analysis of simple list structures
- Combinatorial aspects of continued fractions
- On the integral of the absolute value of the pinned Wiener process
- The average height of binary trees and other simple trees
- An invariance principle for random walk conditioned by a late return to zero
- Excursions in Brownian motion
- Kac's formula, levy's local time and brownian excursion
- Register Allocation for Unary–Binary Trees
- On the Excursion Process of Brownian Motion
- A Note on Gray Code and Odd-Even Merge
- Data Movement in Odd-Even Merging
- On the height of trees
- On Deviations between Theoretical and Empirical Distributions
