A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, Ephraim Korach, Doron Rotem

Browse the full STOC paper archive.