From wait-free to arbitrary concurrent solo executions in colorless distributed computing-Reference-Cited by-同舟云学术

From wait-free to arbitrary concurrent solo executions in colorless distributed computing

Published:2017-06 Issue: Volume:683 Page:1-21
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Herlihy Maurice,Rajsbaum Sergio^ORCID,Raynal Michel,Stainer Julien

Funder

Franco-German DFG-ANR

ANR

INRIA-UNAM

UNAM-PAPIIT

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference48 articles.

1. Atomic snapshots of shared memory;Afek;J. ACM,1993

2. M. Alcántara, A. Castañeda, D. Flores, S. Rajsbaum, Fault-tolerant robot gathering problems on graphs with arbitrary waking times, in: Proc. 31st IEEE International Parallel & Distributed Processing Symposium, Orlando, FL, USA,, May 29–June 2, 2017, in press.

3. Sharing memory robustly in message passing systems;Attiya;J. ACM,1995

4. Renaming in an asynchronous environment;Attiya;J. ACM,1990

5. The complexity of obstruction-free implementations;Attiya;J. ACM,2009

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algebraic topology and distributed computing;Foundations of Data Science;2024

2. Non-negotiating Distributed Computing;Lecture Notes in Computer Science;2024

3. Brief Announcement: The MBroadcast Abstraction;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. Anonymous Shared Memory;Journal of the ACM;2022-08-16

5. A Topological Characterization to Arbitrary Resilient Asynchronous Complexity;Mathematics;2022-08-01