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.
| Original language | English |
|---|---|
| Title of host publication | 31st International Symposium on Distributed Computing, DISC 2017 |
| Publisher | Schloss Dagstuhl-Leibniz-Zentrum für Informatik |
| Pages | 1-3 |
| ISBN (Electronic) | 9783959770538 |
| DOIs | |
| Publication status | Published - 1 Oct 2017 |
| MoE publication type | A4 Article in a conference publication |
| Event | International Symposium on Distributed Computing - Vienna, Austria Duration: 16 Oct 2017 → 20 Oct 2017 Conference number: 31 |
Publication series
| Name | Leibniz International Proceedings in Informatics |
|---|---|
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Volume | 91 |
| ISSN (Electronic) | 1868-8969 |
Conference
| Conference | International Symposium on Distributed Computing |
|---|---|
| Abbreviated title | DISC |
| Country/Territory | Austria |
| City | Vienna |
| Period | 16/10/2017 → 20/10/2017 |
Keywords
- Complexity theory
- Congested clique
- Distributed computing