Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Leader Election;Distributed Systems;2023-02-10
2. Leader Election in Well-Connected Graphs;Algorithmica;2022-11-24
3. Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. Mobility-based Individual POI Recommendation to Control the COVID-19 Spread;2021 IEEE International Conference on Big Data (Big Data);2021-12-15
5. Distributed Edge Counting for Wireless Sensor Networks;2021 55th Asilomar Conference on Signals, Systems, and Computers;2021-10-31