Deterministic Near-Optimal Distributed Listing of Cliques
Main Authors: | Censor-Hillel, Keren, Leitersdorf, Dean, Vulakh, David |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/146465 |
Similar Items
-
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2024) -
A Near-Optimal Deterministic Distributed Synchronizer
by: Ghaffari, Mohsen, et al.
Published: (2023) -
Lower Bounds for Randomized Consensus under a Weak Adversary
by: Attiya, Hagit, et al.
Published: (2011) -
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
by: Ghaffari, Mohsen, et al.
Published: (2024) -
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
by: Barak, Boaz, et al.
Published: (2022)