Brief announcement

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
Date
2017-10-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
1-3
Series
31st International Symposium on Distributed Computing, DISC 2017, Leibniz International Proceedings in Informatics, Volume 91
Abstract
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for the congested clique; indeed, it is now know that proving explicit congested clique lower bounds is as difficult as proving circuit lower bounds. In this work, we use traditional complexity-theoretic tools to build a clearer picture of the complexity landscape of the congested clique, proving non-constructive lower bounds and studying the relationships between natural problems.
Description
Keywords
Complexity theory, Congested clique, Distributed computing
Other note
Citation
Korhonen , J H & Suomela , J 2017 , Brief announcement : Towards a complexity theory for the congested clique . in 31st International Symposium on Distributed Computing, DISC 2017 . , 55 , Leibniz International Proceedings in Informatics , vol. 91 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , pp. 1-3 , International Symposium on Distributed Computing , Vienna , Austria , 16/10/2017 . https://doi.org/10.4230/LIPIcs.DISC.2017.55