A Band and Bound Technique for Simple Random Algorithms

DOI10.1017/S0269964800001649MaRDI QIDQ3415974zbMATH OpenFDO

Authors Vernon Rego

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800001649

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Theory of computing (68Q99)

Recommendations

• Naive asymptotics for hitting time bounds in Markov chains
• scientific article; zbMATH DE number 1246226
• scientific article; zbMATH DE number 1183278
• A subexponential randomized algorithm for the simple stochastic game problem
• Weakest precondition reasoning for expected runtimes of randomized algorithms

Cited in

(2)

• Naive asymptotics for hitting time bounds in Markov chains
• A method for obtaining randomized algorithms with small tail probabilities

This page was built for publication: A Band and Bound Technique for Simple Random Algorithms

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