Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing

DOI10.1145/2933575.2934567zbMath1401.68230OpenAlexW2531598787MaRDI QIDQ4635891

Tuomo Lempiäinen

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933575.2934567

zbMATH Keywords

lower boundsbisimulationdistributed computinglocal algorithmsport-numbering model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

This page was built for publication: Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing