Search for the maximum of a random walk

DOI10.1145/195058.195182MaRDI QIDQ2817626zbMATH OpenOpenAlexFDO

Authors Andrew Odlyzko

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195182

Mathematics Subject Classification ID

Random walks on graphs (05C81) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Search for the maximum of a random walk
• The secretary problem for a random walk
• 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?
• scientific article; zbMATH DE number 4080680

Cited in

(11)

• 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?
• Finding passwords by random walks: how long does it take?
• Locating the maximum of a simple random sequence by sequential search
• scientific article; zbMATH DE number 1203237 (Why is no real title available?)
• A constant arising from the analysis of algorithms for determining the maximum of a random walk
• Average case behavior of random search for the maximum
• Notes on Low discriminants and the generalized Newman conjecture
• Search for the maximum of a random walk
• Tight bounds for blind search on the integers and the reals
• Search cost for a nearly optimal path in a binary tree

This page was built for publication: Search for the maximum of a random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817626)