Author:
Raynal Michel,Stainer Julien,Taubenfeld Gadi
Publisher
Springer International Publishing
Reference27 articles.
1. Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: The k-simultaneous consensus problem. Distributed Computing 22(3), 185–195 (2010)
2. Anderson, J.H., Moir, M.: Universal constructions for large objects. IEEE Transactions of Parallel and Distributed Systems 10(12), 1317–1332 (1999)
3. Attiya, H., Guerraoui, R., Hendler, D., Kutnetsov, P.: The complexity of obstruction-free implementations. Journal of the ACM 56(4), Article 24, 33 (2009)
4. Attiya, H., Welch, J.L.: Distributed computing: Fundamentals, simulations and advanced topics, 2nd edn., p. 414. Wiley Interscience (2004) ISBN 0-471-45324-2
5. Borowsky, E., Gafni, E., Generalized, F.L.P.: impossibility results for t-resilient asynchronous computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91–100. ACM Press (1993)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Modular randomized byzantine k-set agreement in asynchronous message-passing systems;Proceedings of the 17th International Conference on Distributed Computing and Networking;2016-01-04
2. Distributed Universality;Algorithmica;2015-08-19
3. Concurrent Systems: Hybrid Object Implementations and Abortable Objects;Lecture Notes in Computer Science;2015
4. Distributed Universality;Lecture Notes in Computer Science;2014