Towards a Complexity Theory for the Congested Clique-Reference-Cited by-同舟云学术

Towards a Complexity Theory for the Congested Clique

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Korhonen Janne H.¹,Suomela Jukka¹

Affiliation:

1. Aalto University, Helsinki, Finland

Funder

Academy of Finland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3210377.3210391

Reference51 articles.

1. Clique Here: On the Distributed Complexity in Fully-Connected Networks

2. New classes of distributed time complexity

3. Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen . 2016. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016). arXiv:1607.05127 {cs.DC}. Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen . 2016. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. (2016). arXiv:1607.05127 {cs.DC}.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mind the O˜: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms;Algorithms;2023-07-11

2. Fault-Tolerant Graph Realizations in the Congested Clique, Revisited;Lecture Notes in Computer Science;2023

3. Exponentially Faster Shortest Paths in the Congested Clique;Journal of the ACM;2022-08-31

4. Distributed Graph Realizations;IEEE Transactions on Parallel and Distributed Systems;2022-06-01

5. Equivalence classes and conditional hardness in massively parallel computations;Distributed Computing;2022-01-20