On Assessing the Performance of Randomized Algorithms

DOI10.1006/JAGM.2000.1114MaRDI QIDQ4521520zbMATH OpenOpenAlexFDO

Authors Sorana Froda

Publication date 19 December 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1114

zbMATH Keywords

randomized algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1246227
• A relation between correctness and randomness in the computation of probabilistic algorithms
• An introduction to randomized algorithms
• Probability and Computing
• Design and analysis of randomized algorithms. Introduction to design paradigms.

Cited in

(2)

• Randomized benchmarking with confidence
• On the cost of algorithms for random selection

This page was built for publication: On Assessing the Performance of Randomized Algorithms

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