1. Background Randomized divide and conquer algorithms have several manifestations. In particular, leader election problems are an interesting class, because randomized elections have a rich mathematical and algorithmic history. Prodinger (1993) precisely analyzed the average behavior of several characteristic properties for a certain leader election algorithm that flips unbiased coins. He coin...
