Towards a topological characterization of asynchronous complexity

DOI10.1145/259380.259440MaRDI QIDQ5361483zbMATH OpenOpenAlexFDO

Authors Gunnar Hoest, Nir Shavit

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Classifying rendezvous tasks of arbitrary dimension
• Collapsibility of read/write models using discrete Morse theory
• A classification of wait-free loop agreement tasks
• The evolution of non-degenerate and degenerate rendezvous tasks
• Hundreds of impossibility results for distributed computing

This page was built for publication: Towards a topological characterization of asynchronous complexity

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