Author:
Awerbuch B.,Luby M.,Goldberg A.V.,Plotkin S.A.
Cited by
155 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. No Distributed Quantum Advantage for Approximate Graph Coloring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Towards the Erdős-Gallai cycle decomposition conjecture;Advances in Mathematics;2024-02
3. Distributed Graph Coloring Made Easy;ACM Transactions on Parallel Computing;2023-12-14
4. Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Node and edge averaged complexities of local graph problems;Distributed Computing;2023-07-05