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.

Authors

Christoph Meinel

This author has not been identified. Look up 'Christoph Meinel' in Google

Stephan Waack

This author has not been identified. Look up 'Stephan Waack' in Google