Author of the publication

Locally Checkable Labelings with Small Messages.

, , , , and . DISC, volume 209 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Big Data Analyzer for Large Trace Logs., , , , and . CoRR, (2015)How much does randomness help with locally checkable problems?, , , and . PODC, page 299-308. ACM, (2020)Locally Checkable Problems in Rooted Trees., , , , , and . PODC, page 263-272. ACM, (2021)On the Node-Averaged Complexity of Locally Checkable Problems on Trees., , , , and . DISC, volume 281 of LIPIcs, page 7:1-7:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)BiDAl: Big Data Analyzer for Cluster Traces., , , , and . GI-Jahrestagung, volume P-232 of LNI, page 1781-1795. GI, (2014)Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs., , , , and . DISC, volume 319 of LIPIcs, page 5:1-5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The distributed complexity of locally checkable problems on paths is decidable., , , , , and . CoRR, (2018)Distributed Edge Coloring in Time Polylogarithmic in Δ., , , and . PODC, page 15-25. ACM, (2022)Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees., , , and . PODC, page 283-293. ACM, (2021)On Pareto Optimality in Social Distance Games., , and . AAAI, page 349-355. AAAI Press, (2017)