Restart strategies in a continuous setting

DOI10.1007/s00224-021-10041-0OpenAlexW3158741236MaRDI QIDQ825972

Jan-Hendrik Lorenz

Publication date: 18 December 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-021-10041-0

zbMATH Keywords

randomized algorithmrestartsuniversal strategy

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (2)

Comparing the roles of time overhead and spatial dimensions on optimal resetting rate vanishing transitions, in Brownian processes with potential bias and stochastic resetting ⋮ The inspection paradox in stochastic resetting

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• On the complexity of restarting
• Handbook of Probability
• Diffusion under time-dependent resetting
• Promise Problems on Probability Distributions
• Runtime Distributions and Criteria for Restarts
• Stochastic Models for Fault Tolerance

This page was built for publication: Restart strategies in a continuous setting