2 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
Alkida Balliu, Pierre Fraigniaud, Dennis Olivetti +1
We study the awake complexity of graph problems that belong to the class O-LOCAL, which includes a subset of problems solvable by sequential greedy algorithms, such as -colo…
Node and Edge Averaged Complexities of Local Graph Problems
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn +1
The node-averaged complexity of a distributed algorithm running on a graph is the average over the times at which the nodes of finish their computation and commit…
Improved Distributed Fractional Coloring Algorithms
Alkida Balliu, Fabian Kuhn, Dennis Olivetti
We prove new bounds on the distributed fractional coloring problem in the LOCAL model. Fractional -colorings can be understood as multicolorings as follows. For some natural num…
BiDAl: Big Data Analyzer for Cluster Traces
Alkida Balliu, Dennis Olivetti, Ozalp Babaoglu +2
Modern data centers that provide Internet-scale services are stadium-size structures housing tens of thousands of heterogeneous devices (server clusters, networking equipment, powe…