Publications

See boilerplate information at the bottom.

Journals

1. Offline Time-Independent Multiagent Path Planning. K. Okumura, F. Bonnet, Y. Tamura, X. Défago. IEEE Trans. Robotics 39(4):2720-2737 (2023). doi: 10.1109/TRO.2023.3258690
2. Solving simultaneous target assignment and path planning efficiently with time-independent execution. K. Okumura, X. Défago. Artif. Intell., 2023. doi: 10.1016/j.artint.2023.103946
3. Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space. X. Défago, A. Heriban, S. Tixeuil, K. Wada. Robotics Auton. Syst., 2023. doi: 10.1016/j.robot.2023.104378
4. Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights. T. Okumura, K. Wada, X. Défago. Theor. Comput. Sci., 2023. doi: 10.1016/j.tcs.2023.114198
5. Priority inheritance with backtracking for iterative multi-agent path finding. K. Okumura, M. Machida, X. Défago, Y. Tamura. Artif. Intell., 2022. doi: 10.1016/j.artint.2022.103752
6. Resilient Consensus for Multi-Agent Systems Under Adversarial Spreading Processes. Y. Wang, H. Ishii, F. Bonnet, X. Défago. IEEE Trans. Netw. Sci. Eng. 9(5):3316-3331 (2022). doi: 10.1109/TNSE.2022.3176214
7. Resilient real-valued consensus in spite of mobile malicious agents on directed graphs. Y. Wang, H. Ishii, F. Bonnet, X. Défago. IEEE Trans. Parallel Distributed Syst. 33(3):586-603 (2022). doi: 10.1109/TPDS.2021.3096074
8. Self-stabilizing gathering of mobile robots under crash or Byzantine faults. X. Défago, M. Potop-Butucaru, P. Raipin-Parvédy. Distrib. Comput., pp. 393-421, 2020. doi: 10.1007/s00446-019-00359-x online
9. Tight bound on mobile Byzantine Agreement. F. Bonnet, X. Défago, T.-D. Nguyen, M. Potop-Butucaru. Theor. Comput. Sci. 609:361-373 (2016). doi: 10.1016/j.tcs.2015.10.019
10. Reliability Prediction for Component-based Software Dealing with Concurrent Propagating Errors. T.-T. Pham, X. Défago, Q.-T. Huynh. Science of Computer Programming 97:426-457 (2015). doi: 10.1016/j.scico.2014.03.016
11. Reliability Prediction for Component-based Software Systems with Architectural level Fault-tolerance Mechanisms (extended version). T.-T. Pham, F. Bonnet, X. Défago. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications 5(1):4-36 (2014). online
12. The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. T. Izumi, S. Souissi, Y. Katayama, N. Inuzuka, X. Défago, K. Wada, M. Yamashita. SIAM Journal on Computing 41(1):26-46 (2012). doi: 10.1137/100797916
13. Fault-tolerant flocking for a group of autonomous mobile robots. Y. Yang, S. Souissi, X. Défago, M. Takizawa. Journal of Systems and Software 84(1):29-36 (2011). doi: 10.1016/j.jss.2010.08.026
14. The cost of probabilistic agreement in oblivious robot networks. J. Clement, X. Défago, M. Gradinariu Potop-Butucaru, T. Izumi, S. Messika. Inf. Process. Lett. 110(11):431-438 (2010). doi: 10.1016/j.ipl.2010.04.006
15. Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. S. Souissi, X. Défago, M. Yamashita. ACM Trans. on Autonomous and Adaptive Systems, 2009. doi: 10.1145/1462187.1462196
16. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. X. Défago, S. Souissi. Theor. Comput. Sci. 396(1-3):97-112 (2008). doi: 10.1016/j.tcs.2008.01.050
17. Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems. W. Sun, C. Yu, X. Défago, Y. Inoguchi. IEICE Trans. on Information & Systems 91-D(3):796-806 (2008). doi: 10.1093/ietisy/e91-d.3.796
18. A novel numerical algorithm based on self-tuning controller to support TCP flows. N. Xiong, L. T. Yang, Y. Yang, X. Défago, Y. He. Mathematics and Computers in Simulation 79(4):1178-1188 (2008). doi: 10.1016/j.matcom.2007.10.001
19. Collision Prevention Platform for a Dynamic Group of Asynchronous Cooperative Mobile Robots. R. Yared, X. Défago, J. Iguchi-Cartigny, M. Wiesmann. Journal of Networks 2(4):28-39 (2007). doi: 10.4304/jnw.2.4.28-39 [PDF]
20. Total order broadcast and multicast algorithms: Taxonomy and survey. X. Défago, A. Schiper, and P. Urbán. ACM Computing Surveys 36(4):372-421 (2004). doi: 10.1145/1041680.1041682
21. Semi-passive replication and Lazy Consensus. X. Défago and A. Schiper. Journal of Parallel and Distributed Computing 64(12):1380-1398 (2004). doi: 10.1016/j.jpdc.2004.08.006
22. Comparative performance analysis of ordering strategies in atomic broadcast algorithms. X. Défago, A. Schiper, and P. Urbán. IEICE Trans. on Information and Systems E86-D(12):2698-2709 (2003). online
23. Neko: A single environment to simulate and prototype distributed algorithms. P. Urbán, X. Défago, and A. Schiper. Journal of Information Science and Engineering 18(6):981-997 (2002). online
24. Abstractions pour la programmation concurrente dans GARF. B. Garbinato, X. Défago, R. Guerraoui, and K. R. Mazouni. Calculateurs parallèles 6(2):85-98 (1994).

Conferences

25. Quick Multi-Robot Motion Planning by Combining Sampling and Search. K. Okumura, X. Défago. In Proc. 32nd Intel. Joint Conf. on Artificial Intelligence (IJCAI), pp. 252-261, Aug. 2023. doi: 10.24963/ijcai.2023/29
26. Mixed-traffic Intersection Management using Traffic-load-responsive Reservation and V2X-enabled Speed Coordination. N. D. Yosodipuro, E. Javanmardi, J. Nakazato, Y. Tamura, X. Défago, M. Tsukada. In 26th IEEE Intl. Conf. on Intelligent Transportation Systems (ITSC), pp. 1927-1934, Sep. 2023. doi: 10.1109/ITSC57777.2023.10422248
27. ToST: Tokyo SUMO Traffic Scenario. Y. Yamazaki, Y. Tamura, X. Défago, E. Javanmardi, M. Tsukada. In 26th IEEE Intl. Conf. on Intelligent Transportation Systems (ITSC), pp. 3597-3604, Sep. 2023. doi: 10.1109/ITSC57777.2023.10422517
28. Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution. K. Okumura, X. Défago. In Proc. 32nd Intl. Conf. Automated Planning and Scheduling (ICAPS), pp. 270-278, June 2022. doi: 10.1609/icaps.v32i1.19810
29. Self-Triggered Ternary Control for Resilient Consensus against Mobile Adversarial Agents. H. Matsume, Y. Wang, H. Ishii, X. Défago. In Proc. 61st IEEE Conf. on Decision and Control (CDC), pp. 2387-2392, Dec. 2022. doi: 10.1109/CDC51059.2022.9992614
30. Offline Time-Independent Multi-Agent Path Planning. K. Okumura, F. Bonnet, Y. Tamura, X. Défago. In Proc. 31st Intel. Joint Conf. on Artificial Intelligence (IJCAI), pp. 4649-4656, July 2022. doi: 10.1109/CDC51059.2022.9992614
31. Resilient Consensus Against Epidemic Malicious Attacks. Y. Wang, H. Ishii, F. Bonnet, X. Défago. In Proc. European Control Conference (ECC), pp. 1393-1398, June 2021. doi: 10.23919/ECC54610.2021.9654845
32. Roadside-Assisted Cooperative Planning using Future Path Sharing for Autonomous Driving. M. Hirata, M. Tsukada, K. Okumura, Y. Tamura, H. Ochiai, X. Défago. In Proc. IEEE Vehicular Technology Conference (VTC Fall), pp. 1-7, Sep. 2021. doi: 10.1109/VTC2021-Fall52928.2021.9625324
33. Iterative Refinement for Real-Time Multi-Robot Path Planning. K. Okumura, Y. Tamura, X. Défago.. In Proc. IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), Sep. 2021.
34. Active Modular Environment for Robot Navigation. S. Kameyama, K. Okumura, Y. Tamura, X. Défago. In Proc. IEEE Intl. Conf. on Robotics and Automation (ICRA), June 2021. [PDF]
35. Time-Independent Planning for Multiple Moving Agents. K. Okumura, Y. Tamura, X. Défago. In Proc. AAAI Conf. on Artificial Intelligence (AAAI), 35(13):11299-11307, Feb. 2021. link
36. Communication Efficient Self-Stabilizing Leader Election. X. Défago, Y. Emek, S. Kutten, T. Masuzawa, Y. Tamura. In Proc. 33rd Intl. Symp. on Distributed Computing (DISC), LIPIcs, Volume 179, pp. 11:1-11:19, Oct. 2020. doi: 10.4230/LIPIcs.DISC.2020.11
37. Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space. X. Défago, A. Heriban, S. Tixeuil, K. Wada. In Proc. 39th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 113-122, Sep. 2020. doi: 10.1109/SRDS51746.2020.00019
38. Stateless Distributed Ledgers. F. Bonnet, Q. Bramas, X. Défago. In Proc. 7th Intl. Conf. on Networked Systems (NETYS), pp. 349-354, Jun. 2020. doi: 10.1007/978-3-030-67087-0_22
39. Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding. K. Okumura, M. Machida, X. Défago, Y. Tamura. In Proc. 28th Intl. Joint Conf. on Artificial Intelligence (IJCAI), pp. 535-542, Aug. 2019. doi: 10.24963/ijcai.2019/76
40. Approximate QoS Rule Derivation Based on Root Cause Analysis for Cloud Computing. S. Konno, X. Défago. In Proc. 24th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 33-42, Dec. 2019. doi: 10.1109/PRDC47002.2019.00020
41. Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. X. Défago, A. Heriban, S. Tixeuil, K. Wada. In 33rd Intl. Symp. on Distributed Computing (DISC), pp. 41:1-3, Oct. 2019. doi: 10.4230/LIPIcs.DISC.2019.41
42. Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights. T. Okumura, K. Wada, X. Défago. In Proc. 22nd Intl. Conf. on Principles of Distributed Systems (OPODIS), pp. 24:1-16, Dec. 2018. doi: 10.4230/LIPIcs.OPODIS.2018.24
43. Optimally Gathering Two Robots. A. Heriban, X. Défago, S. Tixeuil. In Proc. 19th Intl. Conf. on Distributed Computing and Networking (ICDCN), pp. 3:1-10, Jan. 2018. doi: 10.1145/3154273.3154323
44. Amoeba Exploration: Coordinated Exploration with Distributed Robots. K. Okumura, Y. Tamura, X. Défago. In 9th Intl. Conf. on Awareness Science and Technology (iCAST), pp. 191-195, Sep. 2018. doi: 10.1109/ICAwST.2018.8517225
45. Killing Nodes as a Countermeasure to Virus Expansion. F. Bonnet, Q. Bramas, X. Défago, Thanh Dang Nguyen. In Proc. 24th Intl. Coll. Structural Information and Communication Complexity (SIROCCO), LNCS 10641, pp. 227-243, Jun. 2017. doi: 10.1007/978-3-319-72050-0_14
46. Flocking with Oblivious Robots. D. Canepa, X. Défago, T. Izumi, M. Potop-Butucaru. In Proc. 18th Intl. Symp. Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10083, pp. 94-108, Nov. 2016. doi: 10.1007/978-3-319-49259-9_8
47. Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures. A. Maurer, S. Tixeuil, X. Défago. In Proc. 34th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 238-245, Oct. 2015. doi: 10.1109/SRDS.2015.10
48. Tight Bound on Mobile Byzantine Agreement. F. Bonnet, X. Défago, T.D. Nguyen, M. Potop-Butucaru. In Proc. 28th Intl. Symp. on Distributed Computing (DISC), LNCS 8784, pp. 76-90, Oct. 2014. doi: 10.1007/978-3-662-45174-8_6
49. Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. G. D'Angelo, X. Défago, N. Nisse. In Proc. 2nd Intl. Symp. on Computing and Networking (CANDAR), pp. 50-59, Dec. 2014. doi: 10.1109/CANDAR.2014.95
50. Mitigating the Spread of a Virus in the Internet. T.D. Nguyen, F. Bonnet, X. Défago. In Proc. SRDS Workshops, 2nd Workshop on Planetary-Scale Distributed Systems (W-PSDS), pp. 14-19, Oct. 2014. doi: 10.1109/SRDSW.2014.26
51. Discovering and Assessing Fine-grained Metrics in Robot Networks Protocols. F. Bonnet, X. Défago, F. Petit, M. Potop-Butucaru, S. Tixeuil. In Proc. SRDS Workshops, Workshop on Self-organization in Swarm of Robots (WSSR), pp. 50-59, Oct. 2014. doi: 10.1109/SRDSW.2014.34
52. A Taxonomy of Congestion Control Techniques for TCP in Wired and Wireless Networks. L.C. Kho, X. Défago, A.O. Lim, Y. Tan. In IEEE Symp. Wireless Technology & Applications (ISWTA), pp. 147-152, 2013. doi: 10.1109/ISWTA.2013.6688758
53. Reliability Prediction for Component-Based Software Systems with Architectural-Level Fault Tolerance Mechanisms. T.T. Pham, X. Défago. In Proc. 8th Intl. Conf. on Availability, Reliability and Security (ARES), pp. 11-20, 2013. doi: 10.1109/ARES.2013.8
54. Reliability Prediction for Component-based Systems: Incorporating Error Propagation Analysis and Different Execution Models. T.T. Pham, X. Défago. In Proc. 12th Intl. Conf. on Quality Software (QSIC'12), pp. 106-115, Aug. 2012. doi: 10.1109/QSIC.2012.20
55. A Fast and Robust Optimistic Total Order Broadcast for Online Video Games. S. Bernard, X. Défago, S. Tixeuil. In Proc. 8th Intl. Symp. on Frontiers of Information Systems and Network Applications (FINA), pp. 189-196, Mar. 2012. doi: 10.1109/WAINA.2012.105
56. Fault-Tolerant Flocking of Mobile Robots with Whole Formation Rotation. Y. Yang, S. Souissi, X. Défago, M. Takizawa. In Proc. 23rd Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 830-837, 2009. doi: 10.1109/AINA.2009.104
57. Self-stabilized Flocking of a Group of Mobile Robots under Memory Corruption. Y. Yang, X. Défago, M. Takizawa. In Proc. 12th Intl. Conf. on Network-Based Information Systems (NBiS), pp. 532-538, 2009. doi: 10.1109/NBiS.2009.60
58. Fault-Tolerant Flocking in a k-Bounded Asynchronous System. S. Souissi, Y. Yang, X. Défago. In Proc. 12th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 145-163, 2008. doi: 10.1007/978-3-540-92221-6_11
59. An Energy Efficient Routing Scheme for Mobile Wireless Sensor Networks. L.T. Nguyen, X. Défago, R. Beuran, Y. Shinoda. In Proc. IEEE Intl. Symp. on Wireless Communication Systems. (ISWCS), pp. 568-572, 2008. doi: 10.1109/ISWCS.2008.4726120
60. Collision prevention using group communication for asynchronous cooperative mobile robots. R. Yared, X. Défago, M. Wiesmann. In Proc. 21st Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 244-249, 2007. doi: 10.1109/AINA.2007.44
61. Anonymous Stabilizing Leader Election using a Network Sequencer. M. Wiesmann, X. Défago. In Proc. 21st Intl. Conf. on Advanced Information Networking and Applications (AINA), pp. 673-678, 2007. doi: 10.1109/AINA.2007.38
62. Comparative Analysis of QoS and Memory Usage of Adaptive Failure Detectors. N. Xiong, Y. Yang, X. Défago. In Proc. 13th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 27-34, 2007. doi: 10.1109/PRDC.2007.60
63. Robust Self-Deployment for a Swarm of Autonomous Mobile Robots with Limited Visibility Range. G. Lee, N.Y. Chong, X. Défago. In Proc. 16th IEEE Intl. Symp. on Robot & Human Interactive Communication (RO-MAN), pp. 925-930, 2007. doi: 10.1109/ROMAN.2007.4415216
64. Gathering two stateless mobile robots using very inaccurate compasses in finite time. M. Yamashita, S. Souissi, X. Défago. In Proc. 1st Intl. Conf. on Robot Communication and Coordination (ROBOCOMM), pp. 48:1-4, 2007. doi: 10.4108/icst.robocomm2007.2199
65. Hybrid Overloading and Stochastic Analysis for Redundant Real-time Multiprocessor Systems. W. Sun, Y. Zhang, C. Yu, X. Défago, Y. Inoguchi. In Proc. 26th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 265-274, 2007. doi: 10.1109/DS-RT.2007.12
66. Fault-Tolerant and Self-stabilizing Mobile Robots Gathering. X. Défago, M. Gradinariu, S. Messika, P. Raipin Parvédy. In Proc. 20th Intl. Symp. Distributed Computing (DISC), pp. 46-60, 2006. doi: 10.1007/11864219_4
67. Design and Analysis of a Self-Tuning Proportional and Integral Controller for Active Queue Management Routers to Support TCP Flows. N. Xiong, X. Défago, X. Jia, Y. Yang, Y. He. In Proc. 25th IEEE Intl. Conf. on Computer Communications (INFOCOM), pp. 1-12, 2006. doi: 10.1109/INFOCOM.2006.189
68. Gathering Asynchronous Mobile Robots with Inaccurate Compasses. S. Souissi, X. Défago, M. Yamashita. In Proc. 10th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 333-349, 2006. doi: 10.1007/11945529_24
69. End-to-end consensus using end-to-end channels. M. Wiesmann, X. Défago. In Proc. 12th IEEE Pacific Rim Intl. Symp. on Dependable Computing (PRDC), pp. 341-350, 2006. doi: 10.1109/PRDC.2006.32
70. An SNMP based failure detection service. M. Wiesmann, P. Urbán, X. Défago. In Proc. 25th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 365-376, 2006. doi: 10.1109/SRDS.2006.9
71. Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. S. Souissi, X. Défago, M. Yamashita. In Proc. 8th Intl. Symp. Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 484-500, 2006. doi: 10.1007/978-3-540-49823-0_34
72. Fault-Tolerant Group Membership Protocols Using Physical Robot Messengers. R. Yared, X. Défago, T. Katayama. In Proc. 19th Intl. Conf. on Adv. Inform. Networking and Applications (AINA), pp. 921-926, 2005. doi: 10.1007/11864219_4
73. Towards a Theory of Self-organization. E. Anceaume, X. Défago, M. Gradinariu, M. Roy. In Proc. 9th Intl. Conf. Principles of Distributed Systems (OPODIS), pp. 191-205, 2005. doi: 10.1007/11795490_16
74. Definition and specification of accrual failure detectors. X. Défago, P. Urbán, N. Hayashibara, T. Katayama. In Proc. IEEE/IFIP Intl. Conf. on Dependable Systems and Networks (DSN), pp. 206-215, 2005. doi: 10.1109/DSN.2005.37
75. Fault-tolerant group membership protocols using physical robot messengers. R. Yared, X. Défago, T. Katayama. In Proc. 19th IEEE Intl. Conf. on Advanced Information Networking and Applications (AINA), Vol. 1, pp. 921-926, 2005. doi: 10.1109/AINA.2005.187
76. The φ accrual failure detector. N. Hayashibara, X. Défago, R. Yared, T. Katayama. In Proc. 23rd IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 66-78, 2004. doi: 10.1109/RELDIS.2004.1353004
77. Agent-based approach to dynamic meeting scheduling problems. A. Ben Hassine, X. Défago, T. B. Ho. In Proc. 3rd Intl. Joint Conf. on Autonomous Agents and Multi Agent Systems (AAMAS), pp. 1130-1137, 2004. doi: 10.1109/AAMAS.2004.49
78. An integrated system for distributed bioinformatics environment on grids. K. Satou, Y. Nakajima, S. Tsuji, X. Défago, A. Konagaya. In Grid Computing in Life Science: First Intl. Life Science Grid Workshop (LSGRID), LNCS 3370/2005, 2004. doi: 10.1007/978-3-540-32251-1_2
79. Decomposition of fundamental problems for cooperative autonomous mobile systems. S. Souissi, X. Défago, T. Katayama. In Proc. 24th IEEE Intl. Conf. on Distributed Computing Systems Workshops (ICDCSW); 2nd Intl. Workshop on Mobile Distributed Computing (MDC), pp. 554-560, 2004. doi: 10.1109/ICDCSW.2004.1284087
80. Asynchronous peer-to-peer communication for failure resilient distributed genetic algorithms. J. C. Clemente Litrán, X. Défago, K. Satou. In Proc. 15th IASTED Intl. Conf. on Parallel and Distributed Computing and Systems (PDCS), Vol. II, pp. 769-773, 2003.
81. Two-ways adaptive failure detection with the φ-failure detector. N. Hayashibara, X. Défago, T. Katayama. In Proc. Workshop on Adaptive Distributed Systems (WADiS), pp. 22-27, 2003.
82. On the design of a failure detection service for large scale distributed systems. X. Défago, N. Hayashibara, T. Katayama. In Proc. Intl. Symp. Towards Peta-Bit Ultra-Networks (PBit), pp. 88-95, 2003.
83. Group communication based on standard interfaces. M. Wiesmann, X. Défago, A. Schiper. In Proc. 2nd IEEE Intl. Symp. on Network Computing and Applications (NCA), pp. 140-147, 2003. doi: 10.1109/NCA.2003.1201148
84. Circle formation for oblivious anonymous mobile robots with no common sense of orientation. X. Défago, A. Konagaya. In Proc. 2nd ACM Annual Workshop on Principles of Mobile Computing (POMC), pp. 97-104, 2002. doi: 10.1145/584490.584509
85. Broadcasting messages in fault-tolerant distributed systems: the benefit of handling input-triggered and output-triggered suspicions differently. B. Charron-Bost, X. Défago, A. Schiper. In Proc. 21st IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 244-249, 2002. doi: 10.1109/RELDIS.2002.1180193
86. Impact of a failure detector on the performance of Consensus. N. Sergent, X. Défago, A. Schiper. In Proc. 8th IEEE Pacific Rim Symp. on Dependable Computing (PRDC), pp. 137-145, 2001. doi: 10.1109/PRDC.2001.992690
87. Chasing the FLP impossibility result in a LAN or how robust can a fault-tolerant server be?. P. Urbán, X. Défago, A. Schiper. In Proc. 20th IEEE Intl. Symp. on Reliable Distributed Systems (SRDS), pp. 190-193, 2001. doi: 10.1109/RELDIS.2001.970767
88. Distributed computing on the move: From mobile computing to cooperative robotics and nanorobotics (a position paper). X. Défago. In Proc. 1st ACM Annual Workshop on Principles of Mobile Computing (POMC), pp. 49-55, 2001.
89. Neko: A single environment to simulate and prototype distributed algorithms. P. Urbán, X. Défago, A. Schiper. In Proc. 15th IEEE Intl. Conf. on Information Networking (ICOIN), pp. 503-511, 2001. doi: 10.1109/ICOIN.2001.905471
90. Time vs space in fault-tolerant distributed systems. B. Charron-Bost, X. Défago, A. Schiper. In Proc. 6th IEEE Intl. Workshop on Object-oriented Real-time Dependable Systems (WORDS), pp. 21-27, 2001. doi: 10.1109/WORDS.2001.945109
91. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. P. Urbán, X. Défago, A. Schiper. In Proc. 9th IEEE Intl. Conf. on Computer Communications and Networks (ICCCN), pp. 582-589, 2000. doi: 10.1109/ICCCN.2000.885548
92. Failure detectors as first class objects. P. Felber, X. Défago, R. Guerraoui, P. Oser. In Proc. Intl. Symp. on Distributed Objects and Applications (DOA), pp. 132-141, 1999. doi: 10.1109/DOA.1999.794001
93. Replicating CORBA objects: a marriage between active and passive replication. P. Felber, X. Défago, P. Eugster, A. Schiper. In Proc. 2nd IFIP Intl. Working Conf. on Distributed Applications and Interoperable Systems (DAIS), pp. 375-387, 1999. doi: 10.1007/978-0-387-35565-8_30
94. Optimization techniques for replicating CORBA objects. X. Défago, P. Felber, A. Schiper. In Proc. 4th IEEE Intl Workshop on Object-oriented Real-time Dependable Systems (WORDS), pp. 2-8, 1999. doi: 10.1109/WORDS.1999.806554
95. Semi-passive replication. X. Défago, A. Schiper, N. Sergent. In Proc. 17th IEEE Symp. on Reliable Distributed Systems (SRDS), pp. 43-50, 1998. doi: 10.1109/RELDIS.1998.740473
96. Highly available trading system: Experiments with CORBA. X. Défago, K. R. Mazouni, A. Schiper. In Middleware'98: IFIP Intl. Conf. on Distributed Systems Platforms and Open Distributed Processing, pp. 91-104, 1998. doi: 10.1007/978-1-4471-1283-9_6
97. Reliability with CORBA event channels. X. Défago, P Felber, B. Garbinato, R. Guerraoui. In Proc. 3rd USENIX Conf. on Object-Oriented Technologies and Systems (COOTS), pp. 237-240, 1997.
98. Objets protégés cryptographiquement. U. G. Wilhelm, X. Défago. In Actes RenPar'9, 1997.
99. Issues in building a parallel Java virtual machine on Cenju-3/DE. X. Défago, A. Konagaya. In First Cenju Workshop; with High Performance Computing Asia (HPC Asia), pp. 50-59, 1997. [PDF]
100. Reliability issues with CORBA event channels. X. Défago. In Proc. 2nd European Research Seminar on Advances in Distributed Systems (ERSADS), pp. 153-158, 1997.

Book chapters

101. Fault-Tolerant Mobile Robots. X. Défago, M. Potop-Butucaru, S. Tixeuil. In Distributed Computing by Mobile Entities, LNCS 11340, pp. 234-251, 2019. doi: 10.1007/978-3-030-11072-7_10
102. Atomic Broadcast. X. Défago. In Encyclopedia of Algorithms, 2nd ed., pp. 155-160, 2016. doi: 10.1007/978-1-4939-2864-4_37
103. Causal Order, Logical Clocks, State Machine Replication. X. Défago. In Encyclopedia of Algorithms, 2nd ed., pp. 283-286, 2016. doi: 10.1007/978-1-4939-2864-4_65
104. 「合意問題」. T. Izumi, X. Défago, N. Hayashibara, C. Fetzer. In 電子情報通信学会「知識ベース」, Book6, Vol.7, Chap.2-2, pp. 7-20, 2009. online
105. Atomic Broadcast. X. Défago. In Encyclopedia of Algorithms, Part 1, 2008. doi: 10.1007/978-0-387-30162-4_37
106. Causal Order, Logical Clocks, State Machine Replication. X. Défago. In Encyclopedia of Algorithms, Part 3, 2008. doi: 10.1007/978-0-387-30162-4_65