%0 Conference Paper %1 conf/mfcs/MeinelW95 %A Meinel, Christoph %A Waack, Stephan %B MFCS %D 1995 %E Wiedermann, Jirí %E Hájek, Petr %I Springer %K dblp %P 299-308 %T Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MeinelW95 %V 969 %@ 3-540-60246-1

@inproceedings{conf/mfcs/MeinelW95, added-at = {2017-05-20T00:00:00.000+0200}, author = {Meinel, Christoph and Waack, Stephan}, biburl = {https://www.bibsonomy.org/bibtex/25ce75a37a957ca697742397e7851f81d/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/1995}, editor = {Wiedermann, Jirí and Hájek, Petr}, ee = {https://doi.org/10.1007/3-540-60246-1_136}, interhash = {ea4bfffe307c6075f8046f4b8849900d}, intrahash = {5ce75a37a957ca697742397e7851f81d}, isbn = {3-540-60246-1}, keywords = {dblp}, pages = {299-308}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:12:46.000+0200}, title = {Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MeinelW95}, volume = 969, year = 1995 }