@InProceedings{pemmaraju_et_al:LIPIcs.FSTTCS.2016.47,
author = {Pemmaraju, Sriram V. and Sardeshmukh, Vivek B.},
title = {{Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages}},
booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-027-9},
ISSN = {1868-8969},
year = {2016},
volume = {65},
editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.47},
URN = {urn:nbn:de:0030-drops-68827},
doi = {10.4230/LIPIcs.FSTTCS.2016.47},
annote = {Keywords: Congested Clique, Minimum Spanning Tree, Linear Graph Sketches, Message Complexity, Sampling}
}