Items where Author is "Balliu, Alkida"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 7.

Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis and Schmid, Gustav
(2023) On the Node-Averaged Complexity of Locally Checkable Problems on Trees.
In: DISC 2023.
Conference: DISC International Symposium on Distributed Computing (was WDAG)
(Submitted)

Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis
(2023) Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.
In: SODA 2023.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

Balliu, Alkida and Brandt, Sebastian and Chang, Yi-Jun and Olivetti, Dennis and Studený, Jan and Suomela, Jukka
(2022) Efficient Classification of Locally Checkable Problems in Regular Trees.
In: DISC 2022.
Conference: DISC International Symposium on Distributed Computing (was WDAG)
(Submitted)

Balliu, Alkida and Brandt, Sebastian and Fischer, Manuela and Latypov, Rustam and Maus, Yannic and Olivetti, Dennis and Uitto, Jara
(2022) Exponential Speedup Over Locality in MPC with Optimal Memory.
In: DISC 2022.
Conference: DISC International Symposium on Distributed Computing (was WDAG)
(Submitted)

Balliu, Alkida and Brandt, Sebastian and Chang, Yi-Jun and Olivetti, Dennis and Studený, Jan and Suomela, Jukka and Tereshchenko, Aleksandr
(2022) Locally Checkable Problems in Rooted Trees.
Distributed Computing. ISSN 0178-2770

Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis
(2022) Distributed edge coloring in time polylogarithmic in Δ.
In: PODC 2022.
Conference: PODC ACM Symposium on Principles of Distributed Computing
(Submitted)

Balliu, Alkida and Brandt, Sebastian and Kuhn, Fabian and Olivetti, Dennis
(2022) Distributed ∆-Coloring Plays Hide-and-Seek.
In: STOC 2022.
Conference: STOC ACM Symposium on Theory of Computing
(Submitted)

This list was generated on Thu Nov 21 12:36:32 2024 CET.