Result 1 to 20 of 121 total
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering. (English)
Fernández Anta, Antonio (ed.) et al., Principles of distributed systems. 15th international conference, OPODIS 2011, Toulouse, France, December 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25872-5/pbk). Lecture Notes in Computer Science 7109, 235-250 (2011).
1
Computing time complexity of population protocols with cover times ‒ the ZebraNet example. (English)
Défago, Xavier (ed.) et al., Stabilization, safety, and security of distributed systems. 13th international symposium, SSS 2011, Grenoble, France, October 10‒12, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24549-7/pbk). Lecture Notes in Computer Science 6976, 47-61 (2011).
2
A self-stabilizing transformer for population protocols with covering. (English)
Theor. Comput. Sci. 412, No. 33, 4247-4259 (2011).
3
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering (English)
OPODIS, 235-250 (2011).
4
Computing time complexity of population protocols with cover times - the zebranet example (English)
SSS, 47-61 (2011).
5
Self-stabilizing synchronization in mobile sensor networks with covering. (English)
Rajaraman, Rajmohan (ed.) et al., Distributed computing in sensor systems. 6th IEEE international conference, DCOSS 2010, Santa Barbara, CA, USA, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13650-4/pbk). Lecture Notes in Computer Science 6131, 362-378 (2010).
6
Self-stabilizing synchronization in mobile sensor networks with covering (English)
DCOSS, 362-378 (2010).
7
On utilizing speed in networks of mobile agents (English)
PODC, 305-314 (2010).
8
Making population protocols self-stabilizing. (English)
Guerraoui, Rachid (ed.) et al., Stabilization, safety, and security of distributed systems. 11th international symposium, SSS 2009, Lyon, France, November 3‒6, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-05117-3/pbk). Lecture Notes in Computer Science 5873, 90-104 (2009).
9
Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents‒the notion of speed (English)
PODC, 286-287 (2009).
10
Making population protocols self-stabilizing (English)
SSS, 90-104 (2009).
11
Analyze of probabilistic algorithms under indeterministic scheduler (English)
ISPA, 553-558 (2008).
12
Brief announcement: Computing automatically the stabilization time against the worst and the best schedules. (English)
Dolev, Shlomi (ed.), Distributed computing. 20th international symposium, DISC 2006, Stockholm, Sweden, September 18‒20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-44624-8/pbk). Lecture Notes in Computer Science 4167, 543-547 (2007).
13
Self-stabilizing counting in mobile sensor networks with a base station. (English)
Pelc, Andrzej (ed.), Distributed computing. 21st international symposium, DISC 2007, Lemesos, Cyprus, September 24‒26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75141-0/pbk). Lecture Notes in Computer Science 4731, 63-76 (2007).
14
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. (English)
Distrib. Comput. 20, No. 1, 75-93 (2007).
15
Transient fault detectors. (English)
Distrib. Comput. 20, No. 1, 39-51 (2007).
16
A model for large scale self-stabilization (English)
IPDPS, 1-10 (2007).
17
Self-stabilizing counting in mobile sensor networks with a base station (English)
DISC, 63-76 (2007).
18
Self-stabilizing counting in mobile sensor networks (English)
PODC, 396-397 (2007).
19
Necessary and sufficient conditions for 1-adaptivity (English)
IPDPS (2006).
20
Result 1 to 20 of 121 total
Start
Contact
Print
General Help
