Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems

Christoph Meinel, Stephan Waack. Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. In Jirí Wiedermann, Petr Hájek, editors, Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS 95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings. Volume 969 of Lecture Notes in Computer Science, pages 299-308, Springer, 1995.

Abstract

Abstract is missing.