Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari. On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). In Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa, editors, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings. Volume 8327 of Lecture Notes in Computer Science, pages 235-245, Springer, 2014. [doi]
@inproceedings{FontaineMRZ14,
title = {On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract)},
author = {Allyx Fontaine and Yves Métivier and John Michael Robson and Akka Zemmari},
year = {2014},
doi = {10.1007/978-3-319-04298-5_21},
url = {http://dx.doi.org/10.1007/978-3-319-04298-5_21},
researchr = {https://researchr.org/publication/FontaineMRZ14},
cites = {0},
citedby = {0},
pages = {235-245},
booktitle = {SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings},
editor = {Viliam Geffert and Bart Preneel and Branislav Rovan and Julius Stuller and A Min Tjoa},
volume = {8327},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-04297-8},
}