Christoph Meinel, Stephan Waack. Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. Theory Comput. Syst., 29(6):649-659, 1996.
@article{MeinelW96:0,
title = {Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems},
author = {Christoph Meinel and Stephan Waack},
year = {1996},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MeinelW96%3A0},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {29},
number = {6},
pages = {649-659},
}