Distributed Computing 1. Lower bound for leader election on a complete graph Shmuel Zaks [email protected] ©