Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets
Author:
Assadi Sepehr1,
Kol Gillat2,
Oshman Rotem3
Affiliation:
1. Rutgers University
2. Princeton University
3. Tel Aviv University
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Rounds vs Communication Tradeoffs for Maximal Independent Sets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs;Lecture Notes in Computer Science;2021