@InProceedings{ghaffari_et_al:LIPIcs.DISC.2018.30,
  author =	{Ghaffari, Mohsen and Kuhn, Fabian},
  title =	{{Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping}},
  booktitle =	{32nd International Symposium on Distributed Computing (DISC 2018)},
  pages =	{30:1--30:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-092-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{121},
  editor =	{Schmid, Ulrich and Widder, Josef},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.30},
  URN =		{urn:nbn:de:0030-drops-98194},
  doi =		{10.4230/LIPIcs.DISC.2018.30},
  annote =	{Keywords: Distributed Algorithms, Minimum Spanning Tree, Round Complexity, Message Complexity, Gossiping, Broadcast}
}