2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DC2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Alkida Balliu, Sebastian Brandt, Fabian Kuhn +1
Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first lower bound for the maximal independent set (MIS) problem in trees. In this work we prove lower bou…
cs.DC2014★ 2 cited
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…