Author:
Kentros Sotirios,Kiayias Aggelos
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. A completeness theorem for a class of synchronization objects;Afek,1993
2. D. Alistarh, M. Bender, S. Gilbert, R. Guerraoui, How to allocate tasks asynchronously, in: Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on, Oct. 2012, pp. 331–340.
3. Algorithms for the certified write-all problem;Anderson;SIAM J. Comput.,1997
4. Renaming in an asynchronous environment;Attiya;J. ACM,1990
5. Symmetric binary b-trees: data structure and maintenance algorithms;Bayer;Acta Inform.,1972
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Doing-it-All with bounded work and communication;Information and Computation;2017-06
2. Asynchronous Adaptive Task Allocation;2015 IEEE 35th International Conference on Distributed Computing Systems;2015-06