Cross-Over Composition - Enforcement of Fairness under Unfair Adversary-Reference-Cited by-同舟云学术

Cross-Over Composition - Enforcement of Fairness under Unfair Adversary

Published:2001 Issue: Volume: Page:19-34
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Beauquier Joffroy,Gradinariu Maria,Johnen Colette

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45438-1_2

Reference13 articles.

1. Lect Notes Comput Sci;J. Beauquier,2000

2. Beauquier J., Durand-Lose J., Gradinariu M., Johnen C.: Token based selfstabilizing uniform algorithms. tech. Rep. no. 1250, LRI, Université Paris-Sud; to appear in The Chicago Journal of Theoretical Computer Science (2000)

3. Beauquier J., Gradinariu M., Johnen C.: Memory Space Requirements for Selfstabilizing Leader Election Protocols. PODC’99, 18th Annual ACM Symposium on Principles of Distributed Computing (1999) 199–208

4. Beauquier J., Gradinariu M., Johnen C.: Randomized self-stabilizing optimal leader election under arbitrary scheduler on rings. Tech. Rep. no. 1225, LRI, Université Paris-Sud (1999)

5. Dolev S., Herman T.: Parallel composition of stabilizing algorithms. WSS’99, fourth Workshop on Self-Stabilizing Systems (1999) 25–32

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

1. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions;Algorithmica;2021-11-05

2. Introduction to Distributed Self-Stabilizing Algorithms;Synthesis Lectures on Distributed Computing Theory;2019-04-15

3. Squeezing Streams and Composition of Self-stabilizing Algorithms;Formal Techniques for Distributed Objects, Components, and Systems;2019

4. A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon;Journal of Parallel and Distributed Computing;2018-07

5. Self-Stabilizing Small k-Dominating Sets;International Journal of Networking and Computing;2013