A constant arising from the analysis of algorithms for determining the maximum of a random walk

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199705)10:3<333::AID-RSA3>3.0.CO;2-X" /><333::AID-RSA3>3.0.CO;2-X 10.1002/(SICI)1098-2418(199705)10:3<333::AID-RSA3>3.0.CO;2-XzbMath0874.60066OpenAlexW1993378407MaRDI QIDQ4344225

Hsien-Kuei Hwang

Publication date: 15 July 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199705)10:3<333::aid-rsa3>3.0.co;2-x

zbMATH Keywords

average-case analysismaximum-finding algorithms

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50)

Related Items (3)

On certain functionals of the maximum of Brownian motion and their applications ⋮ A stochastically quasi-optimal search algorithm for the maximum of the simple random walk ⋮ How many probes are needed to compute the maximum of a random walk?

This page was built for publication: A constant arising from the analysis of algorithms for determining the maximum of a random walk