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

Christoph Meinel, Stephan Waack

Browse the full LATIN paper archive.