 | 2011 |
|---|
| 24 |       | François Bonnet,
Xavier Défago:
Exploration and Surveillance in Multi-robots Networks.
ICNC 2011: 342-344 |
| 23 | | François Bonnet,
Alessia Milani,
Maria Potop-Butucaru,
Sébastien Tixeuil:
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction.
OPODIS 2011: 251-265 |
| 22 | | François Bonnet,
Michel Raynal:
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity.
TAAS 6(4): 23 (2011) |
| 21 | | François Bonnet,
Michel Raynal:
On the road to the weakest failure detector for k-set agreement in message-passing systems.
Theor. Comput. Sci. 412(33): 4273-4284 (2011) |
| 2010 |
|---|
| 20 | | François Bonnet,
Michel Raynal:
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?.
AINA 2010: 206-213 |
| 19 | | François Bonnet,
Michel Raynal:
Anonymous Asynchronous Systems: The Case of Failure Detectors.
DISC 2010: 206-220 |
| 18 | | François Bonnet,
Michel Raynal:
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model.
EDCC 2010: 107-116 |
| 17 | | Marin Bertier,
François Bonnet,
Anne-Marie Kermarrec,
Vincent Leroy,
Sathya Peri,
Michel Raynal:
D2HT: The Best of Both Worlds, Integrating RPS and DHT.
EDCC 2010: 135-144 |
| 16 | | François Bonnet,
Michel Raynal:
A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems.
Inf. Process. Lett. 110(4): 153-157 (2010) |
| 15 | | François Bonnet:
Review of DISC 2010.
SIGACT News 41(4): 106-108 (2010) |
| 2009 |
|---|
| 14 | | François Bonnet,
Michel Raynal:
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity.
DISC 2009: 341-355 |
| 13 | | François Bonnet,
Michel Raynal:
Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity.
PODC 2009: 294-295 |
| 12 | | François Bonnet,
Michel Raynal:
Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road?
SSS 2009: 149-164 |
| 11 | | François Bonnet,
Michel Raynal:
Conditions for Set Agreement with an Application to Synchronous Systems.
J. Comput. Sci. Technol. 24(3): 418-433 (2009) |
| 2008 |
|---|
| 10 | | Roberto Baldoni,
François Bonnet,
Alessia Milani,
Michel Raynal:
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
DISC 2008: 496-497 |
| 9 | | François Bonnet,
Michel Raynal:
Conditions for Set Agreement with an Application to Synchronous Systems.
ICDCS 2008: 663-672 |
| 8 | | Roberto Baldoni,
François Bonnet,
Alessia Milani,
Michel Raynal:
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots.
OPODIS 2008: 428-445 |
| 7 | | Matthieu Roy,
François Bonnet,
Leonardo Querzoni,
Silvia Bonomi,
Marc-Olivier Killijian,
David Powell:
Geo-registers: An Abstraction for Spatial-Based Distributed Computing.
OPODIS 2008: 534-537 |
| 6 | | François Bonnet,
Michel Raynal:
Looking for the optimal conditions for solving set agreement.
PODC 2008: 446 |
| 5 | | Roberto Baldoni,
François Bonnet,
Alessia Milani,
Michel Raynal:
Anonymous graph exploration without collision by mobile robots.
Inf. Process. Lett. 109(2): 98-103 (2008) |
| 2007 |
|---|
| 4 | | François Bonnet,
Anne-Marie Kermarrec,
Michel Raynal:
Small-World Networks: From Theoretical Bounds to Practical Systems.
OPODIS 2007: 372-385 |
| 3 | | Rena Bakhshi,
François Bonnet,
Wan Fokkink,
Boudewijn R. Haverkort:
Formal analysis techniques for gossiping protocols.
Operating Systems Review 41(5): 28-36 (2007) |
| 2006 |
|---|
| 2 | | François Bonnet,
Frederic Tronel,
Spyros Voulgaris:
Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays.
DISC 2006: 560-562 |
| 1 | | François Bonnet,
Paul D. Ezhilchelvan,
Einar Vollset:
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts.
SAC 2006: 670-674 |
Data released under the ODC-BY 1.0 license — See also our legal information page