A method for obtaining randomized algorithms with small tail probabilities

DOI10.1007/BF01940879zbMath0857.68057OpenAlexW2167573750WikidataQ103822054 ScholiaQ103822054MaRDI QIDQ1923864

Avi Wigderson, Kurt Mehlhorn, Helmut Alt, Leonidas J. Guibas, Richard M. Karp

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item