Brownian motion and algorithm complexity
- 1 March 1986
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 26 (1) , 17-34
- https://doi.org/10.1007/bf01939359
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- Sur le nombre de registres nécessaires à l'évaluation d'une expression arithmétiqueRAIRO. Informatique théorique, 1984
- On the performance evaluation of extendible hashing and trie searchingActa Informatica, 1983
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Une preuve combinatoire de la rationalité d'une série génératrice associée aux arbresRAIRO. Informatique théorique, 1982
- A Note on Gray Code and Odd-Even MergeSIAM Journal on Computing, 1980
- Combinatorial aspects of continued fractionsDiscrete Mathematics, 1980
- On the excursion process of Brownian motionTransactions of the American Mathematical Society, 1980
- Excursions in Brownian motionArkiv för Matematik, 1976
- An Invariance Principle for Random Walk Conditioned by a Late Return to ZeroThe Annals of Probability, 1976