( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Pareto Optimality in Social Distance Games.

, , и . AAAI, стр. 349-355. AAAI Press, (2017)

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.

Musard Balliu

 

Другие публикации лиц с тем же именем

On Non-Cooperativeness in Social Distance Games., , , и . J. Artif. Intell. Res., (2019)Certification of Compact Low-Stretch Routing Schemes., и . Comput. J., 62 (5): 730-746 (2019)Distributed Lower Bounds for Ruling Sets., , и . FOCS, стр. 365-376. IEEE, (2020)Efficient Classification of Locally Checkable Problems in Regular Trees., , , , , и . DISC, том 246 из LIPIcs, стр. 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Sinkless Orientation Made Simple., , , , , , , , , и 2 other автор(ы). SOSA, стр. 175-191. SIAM, (2023)Local Mending., , , , , и . SIROCCO, том 13298 из Lecture Notes in Computer Science, стр. 1-20. Springer, (2022)Locality of Not-so-Weak Coloring., , , , и . SIROCCO, том 11639 из Lecture Notes in Computer Science, стр. 37-51. Springer, (2019)The Distributed Complexity of Locally Checkable Problems on Paths is Decidable., , , , , и . PODC, стр. 262-271. ACM, (2019)Exponential Speedup over Locality in MPC with Optimal Memory., , , , , , и . DISC, том 246 из LIPIcs, стр. 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Pareto Optimality in Social Distance Games., , и . AAAI, стр. 349-355. AAAI Press, (2017)