Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Christoph Meinel, Stephan Waack. Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Theory Comput. Syst., 29(6):649-659, 1996.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility ProblemsChristoph Meinel, Stephan Waack. mfcs 1995: 299-308 Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility ProblemsChristoph Meinel. eccc, 2(34), 1995. [doi] Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility ProblemsChristoph Meinel, Stephan Waack. latin 1995: 427-435
The following publications are possibly variants of this publication: