Local-on-average distributed tasks

DOI10.1137/1.9781611974331.CH17zbMATH Open1410.68386OpenAlexW4249294792MaRDI QIDQ4575593FDOQ4575593

Authors: Shay Solomon, M. Parter, David Peleg 

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch17

Recommendations

• Distributed computation and reconfiguration in actively dynamic networks
• New classes of distributed time complexity
• Almost global problems in the LOCAL model
• Dynamic routing schemes for graphs with low local density
• What Can be Computed Locally?

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (7)

• On Local Distributed Sampling and Counting
• Title not available (Why is that?)
• Distributed computation and reconfiguration in actively dynamic networks
• Local algorithms for bounded degree sparsifiers in sparse graphs
• Title not available (Why is that?)
• Improved dynamic graph coloring
• Deterministic dynamic matching in \(O(1)\) update time

This page was built for publication: Local-on-average distributed tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575593)