Local-on-average distributed tasks

DOI10.1137/1.9781611974331.CH17MaRDI QIDQ4575593zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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?

Cited in

(8)

• Distributed computation and reconfiguration in actively dynamic networks
• Deterministic dynamic matching in \(O(1)\) update time
• scientific article; zbMATH DE number 2156277 (Why is no real title available?)
• Local algorithms for bounded degree sparsifiers in sparse graphs
• Improved dynamic graph coloring
• Distributed detection of cliques in dynamic networks
• On Local Distributed Sampling and Counting
• Fast deterministic algorithms for highly-dynamic networks

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)