The complexity of end-to-end communication in memoryless networks

DOI10.1145/301308.301364zbMATH Open1321.68292OpenAlexW2135409814MaRDI QIDQ2942767FDOQ2942767

Authors: Micah Adler, Faith E. Fich 

Publication date: 11 September 2015

Published in: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (1)

• Hundreds of impossibility results for distributed computing

This page was built for publication: The complexity of end-to-end communication in memoryless networks

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