Funder
ISF
Open University of Israel’s Research Fund
Lynn and William Frankel Center for Computer Science
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference37 articles.
1. Assadi, S., Solomon, S.: When algorithms for maximal independent set and maximal matching run in sublinear time. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)
2. Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash–Williams decomposition. Distrib. Comput. 22(5–6), 363–379 (2010)
3. Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. JACM 58(5), 23 (2011)
4. Barenboim, L., Elkin, M.: Distributed graph coloring: fundamentals and recent developments. Synth. Lect. Distrib. Comput. Theory 4(1), 1–171 (2013)
5. Barenboim, L., Elkin, M., Maimon, T.: Deterministic distributed ($$\text{Delta}$$ + $$o(\text{ Delta})$$)-edge-coloring, and vertex-coloring of graphs with bounded diversity. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM, pp. 175–184 (2017)