How many probes are needed to compute the maximum of a random walk?
type: Item
instance of: scholarly article
title: How many probes are needed to compute the maximum of a random walk?
zbMATH Open document ID: 0962.60018
DOI: 10.1016/S0304-4149(98)00077-5
author: Philippe Chassaing
published in: Stochastic Processes and their Applications
publication date: 2001-01-17T00:00:00Z
Mathematics Subject Classification ID: 60G50
zbMATH DE Number: 1554309
zbMATH Keywords: average case analysis of algorithms
zbMATH Keywords: quasi-optimal algorithm
zbMATH Keywords: random walk
zbMATH Keywords: Brownian motion
zbMATH Keywords: Brownian meander
MaRDI profile type: Publication
cites work: Q3785143
cites work: Q3026011
cites work: An almost optimal algorithm for unbounded searching
cites work: Q3682518
cites work: A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
cites work: Q5524074
cites work: A Random Walk and a Wiener Process Near a Maximum
cites work: Functionals of Brownian meander and Brownian excursion
cites work: Branching Processes in Simple Random Walk
cites work: A property of power series with positive coefficients
cites work: Q5512461
cites work: Q5624436
cites work: A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search
cites work: A constant arising from the analysis of algorithms for determining the maximum of a random walk
cites work: Parallel minimax search for a maximum
cites work: Q4170017
cites work: Generalized Kraft’s Inequality and Discrete k-Modal Search
cites work: Search for the maximum of a random walk
cites work: More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
cites work: More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
cites work: Q4303982
description: scientific article; zbMATH DE number 1554309