Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Balliu, Alkida
106  Ergebnisse:
Personensuche X
?
1

Brief Announcement: Local Advice and Local Decompression:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Brandt, Sebastian ; Kuhn, Fabian... - p. 117-120 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Completing the Node-Averaged Complexity Landscape of LCLs o..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Brandt, Sebastian ; Kuhn, Fabian.. - p. 369-379 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Tight Lower Bounds in the Supported LOCAL Model:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Boudier, Thomas ; Brandt, Sebastian. - p. 95-105 , 2024
Link: https://dl.acm.org/doi/1..
 
?
4

A Brief Summary of PODC 2022:

Alistarh, Dan ; Balliu, Alkida ; Los, Dimitrios.
ACM SIGACT News.  54 (2023)  1 - p. 106-112 , 2023
Link: https://doi.org/10.1145/..
 
?
5

Node and edge averaged complexities of local graph problems:

Balliu, Alkida ; Ghaffari, Mohsen ; Kuhn, Fabian.
Distributed Computing.  36 (2023)  4 - p. 451-473 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Structural Information and Communication Complexity: 30th I.. 

Lecture Notes in Computer Science, 13892
Rajsbaum, Sergio ; Balliu, Alkida ; Daymude, Joshua J. - 1st ed. 2023 . , 2023
Link: https://doi.org/10.1007/..
 
?
7

Proceedings of the 2023 ACM Symposium on Principles of Dist..:

Oshman, Rotem ; Nolin, Alexandre ; Halldorsson, Magnus Mar. , 2023
Link: https://dl.acm.org/doi/1..
 
?
8

Distributed Lower Bounds for Ruling Sets:

Balliu, Alkida ; Brandt, Sebastian ; Olivetti, Dennis
SIAM Journal on Computing.  51 (2022)  1 - p. 70-115 , 2022
Link: https://doi.org/10.1137/..
 
?
9

On Pareto optimality in social distance games:

Balliu, Alkida ; Flammini, Michele ; Melideo, Giovanna.
Artificial Intelligence.  312 (2022)  - p. 103768 , 2022
Link: https://doi.org/10.1016/..
 
?
10

Distributed ∆-coloring plays hide-and-seek:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Balliu, Alkida ; Brandt, Sebastian ; Kuhn, Fabian. - p. 464-477 , 2022
Link: https://dl.acm.org/doi/1..
 
?
11

Locally checkable problems in rooted trees:

Balliu, Alkida ; Brandt, Sebastian ; Chang, Yi-Jun...
Distributed Computing.  36 (2022)  3 - p. 277-311 , 2022
Link: https://doi.org/10.1007/..
 
?
12

Local Mending:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Balliu, Alkida ; Hirvonen, Juho ; Melnyk, Darya... - p. 1-20 , 2022
Link: https://doi.org/10.1007/..
 
?
13

Node and Edge Averaged Complexities of Local Graph Problems:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Ghaffari, Mohsen ; Kuhn, Fabian. - p. 4-14 , 2022
Link: https://dl.acm.org/doi/1..
 
?
14

Distributed Edge Coloring in Time Polylogarithmic in Δ:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Brandt, Sebastian ; Kuhn, Fabian. - p. 15-25 , 2022
Link: https://dl.acm.org/doi/1..
 
?
15

Locally Checkable Problems in Rooted Trees:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
Balliu, Alkida ; Brandt, Sebastian ; Olivetti, Dennis... - p. 263-272 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15