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

Christoph Meinel, Stephan Waack

Browse the full MFCS paper archive.