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. Theory Comput. Syst., 29(6):649-659, 1996.

No reviews for this publication, yet.