%0 Conference Paper %1 conf/latin/MeinelW95 %A Meinel, Christoph %A Waack, Stephan %B LATIN %D 1995 %E Baeza-Yates, Ricardo A. %E Ch., Eric Goles %E Poblete, Patricio V. %I Springer %K dblp %P 427-435 %T Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. %U http://dblp.uni-trier.de/db/conf/latin/latin95.html#MeinelW95 %V 911 %@ 3-540-59175-3

@inproceedings{conf/latin/MeinelW95, added-at = {2017-05-20T00:00:00.000+0200}, author = {Meinel, Christoph and Waack, Stephan}, biburl = {https://www.bibsonomy.org/bibtex/22fb63ca25c222978d2a6370473fa7e37/dblp}, booktitle = {LATIN}, crossref = {conf/latin/1995}, editor = {Baeza-Yates, Ricardo A. and Ch., Eric Goles and Poblete, Patricio V.}, ee = {https://doi.org/10.1007/3-540-59175-3_107}, interhash = {17ee7868910a38dc5dac1d9e6e72562d}, intrahash = {2fb63ca25c222978d2a6370473fa7e37}, isbn = {3-540-59175-3}, keywords = {dblp}, pages = {427-435}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T20:17:33.000+0200}, title = {Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.}, url = {http://dblp.uni-trier.de/db/conf/latin/latin95.html#MeinelW95}, volume = 911, year = 1995 }