default search action
3. WSS 1997: Santa Barbara, California, USA
- Sukumar Ghosh, Ted Herman:
3rd Workshop on Self-stabilizing Systems, Santa Barbara, California, USA, August, 1997, Proceedings. Carleton University Press 1997, ISBN 0-88629-333-2 - Sandeep S. Kulkarni, Anish Arora:
Compositional design of multitolerant repetitive byzantine agreement. WSS 1997: 1-15 - Hirotsugu Kakugawa, Masaaki Mizuno, Mikhail Nesterenko:
Development of self-stabilizing distributed algorithms using transformation: case studies. WSS 1997: 16-30 - Mohamed G. Gouda, F. Furman Haddix:
The linear alternator. WSS 1997: 31-47 - Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll:
Self-stabilizing L-exclusion. WSS 1997: 48-63 - Joffroy Beauquier, Synnöve Kekkonen-Moneta:
On FTSS-solvable distributed problems. WSS 1997: 64-79 - George Varghese:
Compositional proofs of self-stabilizing protocols. WSS 1997: 80-94 - Anish Arora, Mohamed G. Gouda:
Delay-insensitive stabilization. WSS 1997: 95-109 - Eiichiro Ueda, Yoshiaki Katayama, Toshimitsu Masuzawa, Hideo Fujiwara:
A latency-optimal superstabilizing mutual exclusion protocol. WSS 1997: 110-124 - Colette Johnen:
Memory-efficient self-stabilizing algorithm to construct BFS spanning trees. WSS 1997: 125-140 - Paolo Boldi, Sebastiano Vigna:
Self-stabilizing universal algorithms. WSS 1997: 141-156 - Sukumar Ghosh, Sriram V. Pemmaraju:
Tradeoffs in fault-containing self-stabilization. WSS 1997: 157-169 - Karlo Burket, Ruppert Koch:
Self-stabilizing multiple-sender/single-receiver protocol. WSS 1997: 170-184 - Jorge Arturo Cobb, Mohamed Waris:
Propagated timestamps: a scheme for the stabilization of maximum-flow routing protocols. WSS 1997: 185-200 - Yassine Lakhnech, Michael Siegel:
Deductive verification of stabilizing systems. WSS 1997: 201-216
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.