Rounds vs Communication Tradeoffs for Maximal Independent Sets-Reference-Cited by-同舟云学术

Rounds vs Communication Tradeoffs for Maximal Independent Sets

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Assadi Sepehr¹,Kol Gillat²,Zhang Zhijun²

Affiliation:

1. Rutgers University,Department of Computer Science,New Brunswick,USA

2. Princeton University,Department of Computer Science,Princeton,USA

Funder

National Science Foundation

Publisher

IEEE

Link

Reference47 articles.

2. Independent sets in vertex-arrival streams;cormode;46th International Colloquium on Automata Languages and Programming ICALP 2019,2019

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

1. Distributed Thresholded Counting with Limited Interaction;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

5. Rounds vs Communication Tradeoffs for Maximal Independent Sets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10