Towards a topological characterization of asynchronous complexity
From MaRDI portal
Publication:5361483
DOI10.1145/259380.259440zbMath1373.68272OpenAlexW2094221403MaRDI QIDQ5361483
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/259380.259440
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (5)
Collapsibility of read/write models using discrete Morse theory ⋮ Hundreds of impossibility results for distributed computing ⋮ Classifying rendezvous tasks of arbitrary dimension ⋮ The evolution of non-degenerate and degenerate rendezvous tasks ⋮ A classification of wait-free loop agreement tasks
This page was built for publication: Towards a topological characterization of asynchronous complexity
