@InProceedings{ghaffari_et_al:LIPIcs.ICALP.2019.142,
  author =	{Ghaffari, Mohsen and Sayyadi, Ali},
  title =	{{Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{142:1--142:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.142},
  URN =		{urn:nbn:de:0030-drops-107187},
  doi =		{10.4230/LIPIcs.ICALP.2019.142},
  annote =	{Keywords: Distributed Computing, Message Passing Algorithms, Graph Coloring, Arboricity, Congested Clique Model, Randomized Algorithms}
}