Author:
Mostéfaoui A.,Rajsbaum S.,Raynal M.,Roy M.
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Attiya H. and Avidor Z., Wait-Free n-Consensus When Inputs are Restricted. Proc. 16th Symposium on Distributed Computing (DISC’02), These proceedings.
2. Attiya H. and Rachman O., Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing, 27(2):319–340, 1998.
3. Attiya H. and Rajsbaum S., The Combinatorial Structure of Wait-free Solvable Tasks. To appear in SIAM Journal on Computing, 2002.
4. Lect Notes Comput Sci;P. Berman,1998
5. Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420–440, 1990.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献