Author:
Bournat Marjorie,Dubois Swan,Petit Franck
Publisher
Springer International Publishing
Reference19 articles.
1. Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Generating fast indulgent algorithms. TCS 51(4), 404–424 (2012)
2. Biely, M., Robinson, P., Schmid, U., Schwarz, M., Winkler, K.: Gracefully degrading consensus and k-set agreement in directed dynamic networks. TCS 726, 41–77 (2018)
3. Lecture Notes in Computer Science;M Bournat,2016
4. Bournat, M., Dubois, S., Petit, F.: Computability of perpetual exploration in highly dynamic rings. In: ICDCS, pp. 794–804 (2017)
5. Bournat, M., Dubois, S., Petit, F.: Gracefully degrading gathering in dynamic rings. Technical report, arXiv:1805.05137 (2018)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献