A generalized asynchronous computability theorem

DOI10.1145/2611462.2611477zbMath1321.68266arXiv1304.1220OpenAlexW2000372088MaRDI QIDQ2943623

Petr Kuznetsov, Ciprian Manolescu, Eli Gafni

Publication date: 3 September 2015

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

Full work available at URL: https://arxiv.org/abs/1304.1220

zbMATH Keywords

characterizationtopologyasynchronous computabilityiterated models

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

An algorithmic approach to the asynchronous computability theorem ⋮ Schlegel Diagram and Optimizable Immediate Snapshot Protocol ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ Back to the Coordinated Attack Problem

This page was built for publication: A generalized asynchronous computability theorem