Brief Announcement
From MaRDI portal
Publication:5361934
DOI10.1145/2933057.2933079zbMath1373.68258arXiv1602.08166OpenAlexW2480829993MaRDI QIDQ5361934
Tsvi Kopelowitz, Seth Pettie, Yi-Jun Chang
Publication date: 29 September 2017
Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08166
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (15)
Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ What can be sampled locally? ⋮ Improved deterministic distributed matching via rounding ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Node and edge averaged complexities of local graph problems ⋮ Computing large independent sets in a single round ⋮ Optimal distributed covering algorithms ⋮ Improved distributed \(\Delta\)-coloring ⋮ A Time Hierarchy Theorem for the LOCAL Model ⋮ How long it takes for an ordinary node with an ordinary ID to output? ⋮ Local approximation of the maximum cut in regular graphs ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ Distributed Recoloring ⋮ Almost global problems in the LOCAL model ⋮ Local mending
This page was built for publication: Brief Announcement
