Revisionist Simulations
From MaRDI portal
Publication:5197668
DOI10.1145/3212734.3212749zbMath1428.68065arXiv1711.02455OpenAlexW2963930234MaRDI QIDQ5197668
Faith Ellen, Rati Gelashvili, Leqi Zhu
Publication date: 19 September 2019
Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.02455
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (2)
Why Extension-Based Proofs Fail ⋮ A complexity-based classification for multiprocessor synchronization
This page was built for publication: Revisionist Simulations
