Christoph Meinel, Stephan Waack. The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem. Electronic Colloquium on Computational Complexity (ECCC), 1(22), 1994. [doi]
Abstract is missing.