Author:
Assadi Sepehr,Chen Yu,Khanna Sanjeev
Publisher
Society for Industrial and Applied Mathematics
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. (Δ+1) Vertex Coloring in
O
(
n
) Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. 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. Recent Advances in Multi-Pass Graph Streaming Lower Bounds;ACM SIGACT News;2023-09-07
5. Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18