Author:
Censor-Hillel Keren,Chang Yi-Jun,Gall François Le,Leitersdorf Dean
Publisher
Society for Industrial and Applied Mathematics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic near-optimal distributed listing of cliques;Distributed Computing;2024-06-20
2. Deterministic Expander Routing: Faster and More Versatile;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
3. All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
5. Lightning Fast and Space Efficient k-clique Counting;Proceedings of the ACM Web Conference 2022;2022-04-25