18 citations · 27 across the 26 of their papers we have counts for
Showing 2026 · cs.DCShow all
2 papers · 2 filters
cs.DC2026
Distributed Lower Bounds via Automatic Self-Reduction
Alkida Balliu, Francesco d'Amore, Dennis Olivetti
The development of round elimination into a general-purpose technique [PODC 2019] marked a turning point in our understanding of the hardness of many graph problems in the distribu…
cs.DC2026
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
Alkida Balliu, Sebastian Brandt, Fabian Kuhn +3
One of the central models in distributed computing is Linial's LOCAL model [SIAM J. Comp. 1992]. Over time, researchers have studied distributed graph problems in the LOCAL model u…