Yefim Dinitz, Noam Solomon. Two Absolute Bounds for Distributed Bit Complexity. In Andrzej Pelc, Michel Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Volume 3499 of Lecture Notes in Computer Science, pages 115-126, Springer, 2005. [doi]
Abstract is missing.