The choice coordination problem-Reference-Cited by-同舟云学术

The choice coordination problem

Published:1982-06 Issue:2 Volume:17 Page:121-134
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Rabin Michael O.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00288965.pdf

Reference6 articles.

1. Ben-Or, M.: Private communication

2. Fischer, M., Rabin, M.O.: Concurrent search of a large data-structure. In preparation

3. Lehmann, D., Rabin, M.O.: On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. Submitted for publication

4. Rabin, M.O.: N-process synchronization by 4 · log2 N-valued shared variables. Proceedings of the 21st IEEE Annual Symp. on Foundations of Computer Science (1980). To appear JCSS

5. Probabilistic algorithms: Algorithms and complexity, New Directions and Recent Trends (J.F. Traub Ed.) Academic Press: New York (1976), pp. 21?39

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

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

2. Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions;Synthesis Lectures on Distributed Computing Theory;2022-03-21

3. Leader-based de-anonymization of an anonymous read/write memory;Theoretical Computer Science;2020-10

4. Mutual exclusion in fully anonymous shared memory systems;Information Processing Letters;2020-06

5. Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16