Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization. Wiley (2011)
2. Alon, N., Krivelevich, M., Sudakov, B.: Coloring graphs with sparse neighborhoods. Journal of Combinatorial Theory, Series B 77(1), 73–82 (1999)
3. Barenboim, L., Elkin, M.: Distributed (Δ + 1)-coloring in linear (in Δ) time. In: STOC 2009, pp. 111–120. ACM, New York (2009)
4. Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22, 363–379 (2010)
5. Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: FOCS 2012, pp. 321–330 (October 2012)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic near-optimal distributed listing of cliques;Distributed Computing;2024-06-20
2. On Distributed Computation of the Minimum Triangle Edge Transversal;Lecture Notes in Computer Science;2024
3. Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
4. Deterministic Near-Optimal Distributed Listing of Cliques;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20
5. Efficient Deterministic Distributed Coloring with Small Bandwidth;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31