Performing work with asynchronous processors
From MaRDI portal
Publication:2943763
DOI10.1145/872035.872076zbMath1321.68086OpenAlexW2037087469MaRDI QIDQ2943763
Dariusz R. Kowalski, Alexander A. Schwarzmann
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872076
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
Ordered and delayed adversaries and how to work against them on a shared channel ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ Randomization helps to perform independent tasks reliably
Cites Work