Leonid Barenboim, Michael Elkin. Combinatorial Algorithms for Distributed Graph Coloring. In David Peleg, editor, Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings. Volume 6950 of Lecture Notes in Computer Science, pages 66-81, Springer, 2011. [doi]
@inproceedings{BarenboimE11-1, title = {Combinatorial Algorithms for Distributed Graph Coloring}, author = {Leonid Barenboim and Michael Elkin}, year = {2011}, doi = {10.1007/978-3-642-24100-0_5}, url = {http://dx.doi.org/10.1007/978-3-642-24100-0_5}, researchr = {https://researchr.org/publication/BarenboimE11-1}, cites = {0}, citedby = {0}, pages = {66-81}, booktitle = {Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings}, editor = {David Peleg}, volume = {6950}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-24099-7}, }