A method for obtaining randomized algorithms with small tail probabilities

DOI10.1007/BF01940879MaRDI QIDQ1923864zbMATH OpenOpenAlexWikidataFDO

Authors Helmut Alt, Leonidas Guibas, K. Mehlhorn, Richard Karp, A. Wigderson

Publication date 3 March 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01940879

zbMATH Keywords

randomized algorithmslas Vegas algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• A Band and Bound Technique for Simple Random Algorithms
• scientific article; zbMATH DE number 1182927
• scientific article; zbMATH DE number 819814
• scientific article; zbMATH DE number 3930719
• An introduction to randomized algorithms
• scientific article; zbMATH DE number 1566488
• scientific article; zbMATH DE number 1946759

Cited in

(7)

• Hitting times in Markov chains with restart and their application to network centrality
• Algorithm portfolios
• Optimal speedup of Las Vegas algorithms
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
• Markov processes with restart
• Preface: stochastic resetting—theory and applications
• A tail estimate for Mulmuley's segment intersection algorithm

This page was built for publication: A method for obtaining randomized algorithms with small tail probabilities

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