Author:
Hajnal András,Maass Wolfgang,Turán György
Cited by
27 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. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Nearly Optimal Communication and Query Complexity of Bipartite Matching;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Cut Query Algorithms with Star Contraction;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Connectivity Lower Bounds in Broadcast Congested Clique;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16