Probability Spaces for Random Algorithms

Lasha Epremidze, George Nadareishvili, Jonas Oberhauser +1

Standard analyses of expected runtimes for randomized algorithms typically bypass the explicit construction of an underlying probability space. In this paper, we provide a formal,…