( en | de | ru )

 

Disambiguation of "Balliu, Alkida"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Musard Balliu

 

Other publications of authors with the same name

BiDAl: Big Data Analyzer for Cluster Traces., , , , and . GI-Jahrestagung, volume P-232 of LNI, page 1781-1795. GI, (2014)How much does randomness help with locally checkable problems?, , , and . PODC, page 299-308. ACM, (2020)A Big Data Analyzer for Large Trace Logs., , , , and . CoRR, (2015)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)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)Distributed ∆-coloring plays hide-and-seek., , , and . STOC, page 464-477. ACM, (2022)On Pareto Optimality in Social Distance Games., , and . AAAI, page 349-355. AAAI Press, (2017)