Optimal speedup of Las Vegas algorithms

@article{Luby1993OptimalSO,
  title={Optimal speedup of Las Vegas algorithms},
  author={M. Luby and A. Sinclair and David Zuckerman},
  journal={[1993] The 2nd Israel Symposium on Theory and Computing Systems},
  year={1993},
  pages={128-133}
}
  • M. Luby, A. Sinclair, David Zuckerman
  • Published 1993
  • Mathematics, Computer Science
  • [1993] The 2nd Israel Symposium on Theory and Computing Systems
  • Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when its stops but whose running time is a random variable. The authors consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follows: run A for a fixed amount of time t/sub 1/, then run A independent for a fixed amount of time t/sub 2/, etc. The simulation stops if A completes its execution during any of the runs. Let… CONTINUE READING
    304 Citations
    An Empirical Study of a New Restart Strategy for Randomized Backtrack Search
    • 1
    • PDF
    An Online Algorithm for Maximizing Submodular Functions
    • 185
    • PDF
    Characterization of a New Restart Strategy for Randomized Backtrack Search
    • 4
    • PDF
    Runtime Distributions and Criteria for Restarts
    • 6
    • PDF
    LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration
    • 16
    • PDF
    Theoretical results on bet-and-run as an initialisation strategy
    • 6
    • PDF
    Strategies for Solving SAT in Grids by Randomized Search
    • 18
    • Highly Influenced
    • PDF

    References

    SHOWING 1-2 OF 2 REFERENCES
    Optimal Speedup of Las Vegas Algorithms
    • 199
    OR-Parallel Theorem Proving with Random Competition
    • 38