Publications ANR DESCARTES

[ journals | books | conferences | talks | workshops | tech. reports ]

Journal Articles


    2021
  1. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca: Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021)
  2. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in distributed proofs. Distributed Computing 34(2): 113-132 (2021)
  3. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: A topological perspective on distributed network algorithms. Theoretical Computer Science 849: 121-137 (2021)
  4. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen: A hierarchy of local decision. Theoretical Computer Science 856: 51-67 (2021)
  5. Laurent Feuilloley, Pierre Fraigniaud: Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings. ACM Transactions on Parallel Computing 8(4): 18:1-18:25 (2021)
  6. Michel Raynal: On the Versatility of Bracha's Byzantine Reliable Broadcast Algorithm. Parallel Processing Letters 31(3): 2150006:1-2150006:9 (2021)
  7. Michel Raynal: Distributed Computability: A Few Results Masters Students Should Know. SIGACT News 52(2): 92-110 (2021)
  8. Brice Nédelec, Pascal Molli, Achour Mostéfaoui: A scalable sequence encoding for collaborative editing. Concurrency and Computation: Practice and Experience 33(8) (2021)
  9. David Ilcinkas, Ahmed Mouhamadou Wade: Exploration of Dynamic Cactuses with Sub-logarithmic Overhead. Theory of Computing Systems 65(2): 257-273 (2021)
  10. Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin: Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021)
  11. Louis Esperet, Cyril Gavoille, Carla Groenland: Isometric Universal Graphs. SIAM J. Discrete Mathematics 35(2): 1224-1237 (2021)
  12. Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal: On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems. J. Parallel Distributed Computing 153: 110-118 (2021)
  13. Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa: The assignment problem. Theoretical Computer Science 886: 13-26 (2021)
  14. Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot: On computing Pareto optimal paths in weighted time-dependent networks. Information Processing Letters 168: 106086 (2021)
  15. Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil: Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Computer J. 64(1): 132-154 (2021)
    2020
  16. Emmanuel Godard, Eloi Perdereau: Back to the Coordinated Attack Problem. Mathematical Structures in Computer Science 30(10): 1089-1113 (2020)
  17. Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore: Election in unidirectional rings with homonyms. J. Parallel Distributed Computing 146: 79-95 (2020)
  18. Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot: Decomposing a graph into shortest paths with bounded eccentricity. Discrete Applied Mathematics 284: 353-374 (2020)
  19. Mohammed Haddad, Colette Johnen, Sven Köhler: Polynomial Silent Self-Stabilizing p-Star Decomposition. Computer J. 63(2): 253-266 (2020)
  20. Evangelos Bampas, Jurek Czyzowicz, David Ilcinkas, Ralf Klasing: Beachcombing on strips and islands. Theoretical Computer Science 806: 236-255 (2020)
  21. David Ilcinkas, Ahmed Mouhamadou Wade: Exploration of carrier-based time-varying networks: The power of waiting. Theoretical Computer Science 841: 50-61 (2020)
  22. Sergio Rajsbaum, Michel Raynal: Mastering concurrent computing through sequential thinking. Commun. ACM 63(1): 78-87 (2020)
  23. Michel Raynal, Gadi Taubenfeld: Mutual exclusion in fully anonymous shared memory systems. Information Processing Letters 158: 105938 (2020)
  24. Karla Vargas, Sergio Rajsbaum, Michel Raynal: An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values. Parallel Processing Letters 30(2): 2050006:1-2050006:23 (2020)
  25. Sergio Rajsbaum, Michel Raynal: 60 Years of Mastering Concurrent Computing through Sequential Thinking. SIGACT News 51(2): 59-88 (2020)
  26. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: Leader-based de-anonymization of an anonymous read/write memory. Theoretical Computer Science 836: 110-123 (2020)
  27. Weiping Zhu, Xing Meng, Xiaolei Peng, Jiannong Cao, Michel Raynal: Collisions Are Preferred: RFID-Based Stocktaking with a High Missing Rate. IEEE Transactions on Mobile Computing 19(7): 1544-1554 (2020)
  28. Alex Auvolat, Davide Frey, Michel Raynal, François Taïani: Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof. Bulletin of the EATCS 132 (2020)
  29. Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu, Andrzej Pelc: Deciding and verifying network properties locally with few output bits. Distributed Computing 33(2): 169-187 (2020)
  30. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord: Perfect failure detection with very few bits. Information and Computation 275: 104604 (2020)
  31. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers: A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. J. Applied and Computational Topology 4(1): 141-179 (2020)
    2019
  32. Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory of Computing Systems 63(2): 344-365 (2019)
  33. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar: Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Computing 48(3): 1120-1145 (2019)
  34. Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari: Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81(5): 1901-1920 (2019)
  35. Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil: Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019)
  36. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore: A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theoretical Computer Science 753: 35-63 (2019)
  37. Achour Mostéfaoui, Michel Raynal, Matthieu Roy: Time-efficient read/write register in crash-prone asynchronous message-passing systems. Computing 101(1): 3-17 (2019)
  38. Tyler Crain, Vincent Gramoli, Michel Raynal: A speculation-friendly binary search tree. Concurrency and Computation: Practice and Experience 31(4) (2019)
  39. Hicham Lakhlef, Michel Raynal, François Taïani: Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks. IEEE Transactions on Parallel and Distributed Systems 30(7): 1672-1686 (2019)
  40. K. Altisen, S. Devismes, A. Durand, F. Petit: Gradual stabilization. J. Parallel Distributed Computing 123, 26-45, 2019
  41. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. Computer J. 62(5): 730-746 (2019)
  42. Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry: Randomized proof-labeling schemes. Distributed Computing 32(3): 217-234 (2019)
  43. Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz: Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. Computer J. 62(2): 231-246, 2019
  44. Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari: Design patterns in beeping algorithms: Examples, emulation, and analysis. Information and Computation 264: 32-51 (2019)
  45. Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari: Counting in one-hop beeping networks. Theoretical Computer Science 780: 20-28 (2019)
  46. C. Glacet, N. Hanusse, D. Ilcinkas, C. Johnen: Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Computing 132: 299-309, 2019.
  47. E. Bampas, J. Czyzowicz, D. Ilcinkas, R. Klasing: Beachcombing on strips and islands. Theoretical Computer Science, 2019 (in press).
  48. E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop-Butucaru, S. Tixeuil: On Asynchronous Rendezvous in General Graphs. Theoretical Computer Science 753: 80-90, 2019.
  49. E. Bampas, J. Czyzowicz, L. Gąsieniec, D. Ilcinkas, R. Klasing, T. Kociumaka, D. Pająk: Linear Search by a Pair of Distinct-Speed Robots. Algorithmica 81(1): 317-342, 2019.
  50. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao: Crash-tolerant causal broadcast in O(n) messages. Information Processing Letters 151: 105837 (2019)
    2018
  51. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems. IEEE Transactions on Parallel and Distributed Systems 29(9): 2033-2045 (2018)
  52. Evangelos Bampas, David Ilcinkas: On mobile agent verifiable problems. Information and Computation 260: 51-71, 2018
  53. Claire Capdevielle, Colette Johnen, Alessia Milani: On the complexity of basic abstractions to implement consensus. Theoretical Computer Science 715: 86-96 (2018)
  54. Hicham Lakhlef, Abdelmadjid Bouabdallah, Michel Raynal, Julien Bourgeois: Agent-based broadcast protocols for wireless heterogeneous node networks. Computer Communications 115: 51-63 (2018)
  55. Zohir Bouzid, Michel Raynal, Pierre Sutra: Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers. Distributed Computing 31(2): 99-117 (2018)
  56. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Extending Causal Consistency to any Object Defined by a Sequential Specification. Bulletin of the EATCS 125: 81-92 (2018)
  57. Weiping Zhu, Jiannong Cao, Michel Raynal: Energy-Efficient Composite Event Detection in Wireless Sensor Networks. IEEE Communications Letters 22(1): 177-180 (2018)
  58. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM 65(6): 45:1-45:42 (2018)
  59. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Processing Letters 28(2): 1850006 (2018)
  60. Achour Mostéfaoui, Hamouma Moumen, Michel Raynal: Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theoretical Computer Science 709: 80-97 (2018)
  61. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in Distributed Proofs. In 32nd International Symposium on Distributed Computing (DISC), 24:1-24:18, 2018
  62. Pierre Fraigniaud, Amos Korman, Yoav Rodeh: Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019)
  63. Simon Collet, Pierre Fraigniaud, Paolo Penna: Equilibria of Games in Networks for Local Tasks. In 22nd International Conference on Principles of Distributed Systems (OPODIS), 6:1-6:16, 2018
  64. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti: What can be verified locally? J. Computer and System Sciences 97: 106-120 (2018)
  65. Pierre Fraigniaud, Emanuele Natale: Noisy rumor spreading and plurality consensus. Distributed Computing 32(4): 257-276 (2019)
  66. Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela: Node labels in local decision. Theoretical Computer Science 751: 61-73 (2018)
  67. D. Ilcinkas and A. Wade: Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. Theory of Computing Systems 62(5): 1144-1160, 2018
  68. Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro: A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80(11): 3023-3049 (2018)
  69. Leonid Barenboim, Michael Elkin, Cyril Gavoille: A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theoretical Computer Science 751: 2-23 (2018)
    2017
  70. E. Bampas, L. Gąsieniec, N. Hanusse, D. Ilcinkas, R. Klasing, A. Kosowski, T. Radzik: Robustness of the Rotor-Router Mechanism. Algorithmica 78(3): 869-895, 2017
  71. Stéphane Devismes, David Ilcinkas, Colette Johnen: Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Step. Discrete Mathematics & Theoretical Computer Science 19(3), 2017
  72. Achour Mostéfaoui, Michel Raynal: Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with $t< n/3$, $O(n^2)$ messages, and constant time. Acta Informatica 54(5): 501-520 (2017)
  73. Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit: Self-stabilizing leader election in polynomial steps. Information and Computation 254: 330-366 (2017)
  74. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain: Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Processing Letters 27(2): 1-18 (2017)
  75. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore: Self-stabilizing silent disjunction in an anonymous network. Theoretical Computer Science 665: 51-72 (2017)
  76. Karine Altisen, Stéphane Devismes:: On probabilistic snap-stabilization. Theoretical Computer Science 688: 49-76 (2017)
  77. K. Altisen, S. Devismes, A. Durand: Concurrency in snap-stabilizing local resource allocation. J. Parallel Distributed Computing 102: 42-56, 2017
  78. Michel Raynal: Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS 121: 65-96 (2017)
  79. Christian Fernández-Campusano, Mikel Larrea, Roberto Cortiñas, Michel Raynal: A distributed leader election algorithm in crash-recovery and omissive systems. Information Processing Letters 118: 100-104 (2017)
  80. Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard: Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. Theory of Computing Systems 60(4): 677-694 (2017)
  81. Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theoretical Computer Science 683: 1-21 (2017)
  82. Pierre Fraigniaud, Andrzej Pelc: Decidability classes for mobile agents computing. J. Parallel Distributed Computing 109: 117-128 (2017)
  83. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. DISC 2017: 6:1-6:16
  84. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Which Broadcast Abstraction Captures k-Set Agreement? DISC 2017: 27:1-27:16
  85. Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani: On the uncontended complexity of anonymous agreement. Distributed Computing 30(6): 459-468, 2017
  86. Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid: Towards plane spanners of degree 3. JoCG 8(1): 11-31 (2017)
  87. K. Altisen, P. Corbineau, S. Devismes: A Framework for Certified Self-Stabilization. Logical Methods in Computer Science 13(4), 2017

Book | Book Chapters


    2021
  1. Colette Johnen, Elad Michael Schiller, Stefan Schmid: Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Virtual Event, November 17-20, 2021, Proceedings. Lecture Notes in Computer Science 13046, Springer 2021, ISBN 978-3-030-91080-8
    2020
  2. Stéphane Devismes, Neeraj Mittal: Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18-21, 2020, Proceedings. Lecture Notes in Computer Science 12514, Springer 2020, ISBN 978-3-030-64347-8
    2019
  3. K. Altisen, S. Devismes, S. Dubois, F. Petit: Introduction to Distributed Self-Stabilizing Algorithms. Morgan & Claypool Publishers, Synthesis Lectures on Distributed Computing Theory series (2019)
  4. D. Ilcinkas: Oblivious Robots on Graphs: Exploration. Distributed Computing by Mobile Entities, LNCS 11340, 218-233, 2019
  5. Parosh Aziz Abdulla and Carole Delporte: Special Issue on NETYS'2016. Computing 101:1, 1-2, 2019
  6. Ahmed Bouajjani and Hugues Fauconnier: Editorial, special Issue on NETYS 2015. Computing 101:9, 1225-1226, 2019
    2018
  7. Michel Raynal: Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer 2018, ISBN 978-3-319-94140-0, 1-459

International Conferences | Workshops with Proceedings


    2021
  1. Michel Raynal, Jiannong Cao: From Incomplete to Complete Networks in Asynchronous Byzantine Systems. AINA 2021: 102-112
  2. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems. EDCC 2021: 111-118
  3. Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, Antonio Russo: Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications. FAB 2021: 2:1-2:19
  4. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-Stabilizing Indulgent Zero-degrading Binary Consensus. ICDCN 2021: 106-115
  5. Chryssis Georgiou, Ioannis Marcoullis, Michel Raynal, Elad Michael Schiller: Loosely-self-stabilizing Byzantine-Tolerant Binary Consensus for Signature-Free Message-Passing Systems. NETYS 2021: 36-53
  6. Carlos López, Sergio Rajsbaum, Michel Raynal, Karla Vargas: Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability. NETYS 2021: 54-70
  7. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach: Present-Biased Optimization. AAAI 2021: 5415-5422
  8. Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz: Distributed Quantum Proofs for Replicated Data. ITCS 2021: 28:1-28:20
  9. Pierre Fraigniaud, Ran Gelles, Zvi Lotker: The Topology of Randomized Symmetry-Breaking Distributed Computing. PODC 2021: 415-425
  10. Pierre Fraigniaud: How Do Mobile Agents Benefit from Randomness? SSS 2021: 90-107
  11. Paul Bastide, Pierre Fraigniaud: Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. DISC 2021: 47:1-47:4
  12. Denis Bédin, François Lépine, Achour Mostéfaoui, Damien Perez, Matthieu Perrin: Wait-Free CAS-Based Algorithms: The Burden of the Past. DISC 2021: 11:1-11:15
  13. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit: Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165
  14. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit: On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics. PODC 2021: 21-31
  15. Colette Johnen, Luciana Arantes, Pierre Sens: FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems. SRDS 2021: 277-287
  16. Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, David Peleg: 2021 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2021: 1
  17. Yassine Faize, Jérémie Crenne, Nicolas Hanusse, Christophe Jégo: An Energy Efficient and Scalable Node Architecture for Sensor Network. NEWCAS 2021: 1-4
  18. Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers: Upper and Lower Bounds for Deterministic Approximate Objects. ICDCS 2021: 438-448
  19. Quentin Bramas, Pascal Lafourcade, Stéphane Devismes: Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. FUN 2021: 6:1-6:19
  20. Karine Altisen, Pierre Corbineau, Stéphane Devismes: Certification of an Exact Worst-Case Self-Stabilization Time. ICDCN 2021: 46-55
  21. Quentin Bramas, Pascal Lafourcade, Stéphane Devismes: Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. ICDCN 2021: 76-85
  22. Arthur Rauch, Quentin Bramas, Stéphane Devismes, Pascal Lafourcade, Anissa Lamani: Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. NETYS 2021: 95-110
    2020
  23. Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Infinite Grid Exploration by Disoriented Robots. NETYS 2020: 129-145
  24. Karine Altisen, Stéphane Devismes, Erwan Jahier: sasa: A SimulAtor of Self-stabilizing Algorithms. TAP@STAF 2020: 143-154
  25. Guillaume Ducoffe, Michel Habib, Laurent Viennot: Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. SODA 2020: 1905-1922
  26. Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: k-Immediate Snapshot and x-Set Agreement: How Are They Related? SSS 2020: 97-112
  27. Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers: Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. PODC 2020: 31-40
  28. Nicolas Hanusse, David Ilcinkas, Antonin Lentz: Framing Algorithms for Approximate Multicriteria Shortest Paths. ATMOS 2020: 11:1-11:19
  29. Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers: Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par 2020: 359-375
  30. Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin: Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588
  31. Youssou Dieng, Cyril Gavoille: On the Treewidth of Planar Minor Free Graphs. InterSol 2020: 238-250
  32. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk: Shorter Labeling Schemes for Planar Graphs. SODA 2020: 446-462
  33. Carole Delporte-Gallet, Hugues Fauconnier, Mouna Safir: Byzantine k-Set Agreement. NETYS 2020: 183-191
  34. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum: Communication Complexity of Wait-Free Computability in Dynamic Networks. SIROCCO 2020: 291-309
  35. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit: Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229
  36. Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal: Atomic Appends in Asynchronous Byzantine Distributed Ledgers. EDCC 2020: 77-84
  37. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-Stabilizing Set-Constrained Delivery Broadcast (extended abstract). ICDCS 2020: 617-627
  38. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-stabilizing Uniform Reliable Broadcast. NETYS 2020: 296-313
  39. Michel Raynal, Gadi Taubenfeld: Fully Anonymous Consensus and Set Agreement Algorithms. NETYS 2020: 314-328
  40. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: Relaxed Queues and Stacks from Read/Write Operations. OPODIS 2020: 13:1-13:19
  41. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC 2020: 41-50
  42. Sergio Rajsbaum, Michel Raynal, Karla Vargas: Brief Announcement: Leader Election in the ADD Communication Model. SSS 2020: 229-234
  43. Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin: Extending the Wait-free Hierarchy to Multi-Threaded Systems. PODC 2020: 21-30
  44. Pierre Fraigniaud, Ami Paz: The Topology of Local Computing in Networks. ICALP 2020: 128:1-128:18
  45. Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz: Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM 2020: 337-346
  46. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca: Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328
  47. Pierre Fraigniaud, Magnús M. Halldórsson, Alexandre Nolin: Distributed Testing of Distance-k Colorings. SIROCCO 2020: 275-290
  48. Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz: Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3
    2019
  49. Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal: On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion. AINA 2019: 272-285
  50. Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal: Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector. PaCT 2019: 419-430
  51. Stéphane Devismes, David Ilcinkas, Colette Johnen: Silent self-stabilizing scheme for spanning-tree-like constructions. 20th International Conference on Distributed Computing and Networking (ICDCN), 158-167, 2019
  52. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019: 53-68
  53. A. Datta, S. Devismes, C. Johnen, L.L. Larmore, Lawrence: Brief Announcement: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction. SSS 2019: 99-104
  54. Stéphane Devismes, Colette Johnen: Self-Stabilizing Distributed Cooperative Reset. In 39th Int'l Conference on Distributed Computing Systems (ICDCS), 379-389, 2019
  55. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel: Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166
  56. Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot: Hardness of exact distance queries in sparse graphs through hub labeling. PODC 2019: 272-279
  57. Siddharth Gupta, Adrian Kosowski, Laurent Viennot: Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019
  58. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261
  59. Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Infinite Grid Exploration by Disoriented Robots. SIROCCO 2019: 340-344
  60. Michel Raynal, Jiannong Cao: One for All and All for One: Scalable Consensus in a Hybrid Communication Model. In 39th Int'l Conference on Distributed Computing Systems (ICDCS), 464-471, 2019
  61. Ahad Baig, Danny Hendler, Alessia Milani and Corentin Travers: Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC 2019
  62. Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca: On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245
  63. Cyril Gavoille, Ghazal Kachigar, Gilles Zémor: Localisation-Resistant Random Words with Small Alphabets. WORDS 2019: 193-206
  64. K. Altisen, P. Corbineau, S. Devismes: Squeezing Streams and Composition of Self-Stabilizing Algorithms. FORTE 2019: LNCS 11535, 21-38, Lyngby, Danemark
    2018
  65. Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela: New classes of distributed time complexity. STOC 2018: 1307-1318 Presentation funded by ANR DESCARTES
  66. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. ICDCN 2018: 7:1-7:10
  67. Weiping Zhu, Xing Meng, Xiaolei Peng, Jiannong Cao, Michel Raynal: Time-Efficient RFID-Based Stocktaking with a Coarse-Grained Inventory List. IWQoS 2018: 1-6
  68. Michel Raynal, Jiannong Cao: A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality. MCU 2018: LNCS 10881, 34-50
  69. Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal: DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA 2018: 1-8
  70. Michel Raynal, Jiannong Cao: Anonymity in Distributed Read/Write Systems: An Introductory Survey. NETYS 2018: 122-140
  71. K. Altisen, S. Devismes, A. Durand: Acyclic Strategy for Silent Self-stabilization in Spanning Forests. SSS 2018: LNCS 11201, 186-202, Tokyo
  72. Amitay Shaer, Shlomi Dolev, Silvia Bonomi, Michel Raynal, Roberto Baldoni: Bee's Strategy Against Byzantines Replacing Byzantine Participants. SSS 2018: LNCS 11201, 139-153, Tokyo
  73. Anaïs Durand, Michel Raynal, Gadi Taubenfeld: Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS 2018: LNCS 11201, 269-283, Tokyo
  74. Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa: The Assignment Problem. ICDCN 2018: 14:1-14:9
  75. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa: An Anonymous Wait-Free Weak-Set Object Implementation. NETYS 2018: 141-156
  76. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa: A Characterization of t-Resilient Colorless Task Anonymous Solvability. SIROCCO 2018: 178-192
  77. Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg: Preferential Attachment as a Unique Equilibrium. WWW 2018: 559-568
    2017
  78. S. Devismes, D. Ilcinkas, C. Johnen: Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. In 20th International Conference On Principles Of Distributed Systems (OPODIS'16), LIPIcs 70, 10:1-10:16, 2017
  79. Abdelmadjid Bouabdallah, Hicham Lakhlef, Michel Raynal, François Taïani: Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks. AINA 2017: 399-406
  80. Armando Castañeda, Yoram Moses, Michel Raynal, Matthieu Roy: Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour. NETYS 2017: 206-221
  81. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: Long-Lived Tasks. NETYS 2017: 439-454
  82. Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca: Three Notes on Distributed Property Testing. In 31st International Symposium on Distributed Computing (DISC), 15:1-15:30, 2017
  83. Laurent Feuilloley, Pierre Fraigniaud: Error-Sensitive Proof-Labeling Schemes. In 31st International Symposium on Distributed Computing (DISC), 16:1-16:15, 2017
  84. Pierre Fraigniaud, Dennis Olivetti: Distributed Detection of Cycles. In 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 153-162, 2017
  85. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti: What Can Be Verified Locally? STACS 2017: 8:1-8:13
  86. Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore: Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS 2017: 182-191

Invited Talks | Tutorials | Keynotes


    2021
  1. Stéphane Devismes: Self-Stabilizing Leader Election in Highly Dynamic Networks. 13th International Workshop on Parallel and Distributed Algorithms and Applications (PDAA), Online event, November 26, 2021
  2. Stéphane Devismes: Exploring an Infinite Space using a few Weak Robots. 2nd Workshop on Distributed Algorithms for Low-Functional (WDALFR), Online event, January 8, 2021
  3. Pierre Fraigniaud: Distributed Consensus. 4th Automata Factory Workshop, Online event, December 9-10, 2021
  4. Cyril Gavoille: Universal Graphs. Journées de Combinatoire de Bordeaux, Bordeaux, Virtual Conference, February 2021
    2020
  5. Cyril Gavoille: Consequences for adjacency labelling schemes. Journées Combinatoire Rhône-Alples, Auvergne, Littoral Méditerranéen et Athlantique (JCRAALMA), Virtual Conference, May 2020
    2019
  6. Pierre Fraigniaud: Distributed Network Computing. CIMPA School on Graphs, Algorithms and Randomness, Tabriz, Iran, June 15-22, 2019
  7. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18
  8. Michel Raynal: Thoughts on Informatics and Distributed Computing. Séminaire au Collège de France, 12 avril 2019
  9. Pierre Fraigniaud: Distributed Network Computing. Séminaire au Collège de France, 12 avril 2019
  10. Cyril Gavoille: Distributed computing with quantum resources and beyond. In Complexity, Algorithms, Automata and Logic Meet (CAALM), Chennai Mathematical Institute, Inde, January 2019
    2018
  11. Hugues Fauconnier: Détecteurs de défaillances. Séminaire au Collège de France, 21 décembre 2018
  12. Achour Mostéfaoui: Accord et Malice. Séminaire au Collège de France, 18 janvier 2018
  13. Carole Delporte-Gallet: Protocoles de Population. Séminaire au Collège de France, 18 janvier 2018
    2017
  14. Pierre Fraigniaud: Algorithmes distribués. Séminaire au Collège de France, 28 novembre 2017
  15. Stéphane Devismes: Systèmes distribués et autostabilisation, une introduction. Cycles de conférences "Midi-Sciences", 21 Mars, 2017, Centre Drôme-Ardèche, Valence
  16. David Ilcinkas: Graph Exploration by Oblivious Agents (Tutorial). MAC 2017, La Maddalena, Italie, June 2017
  17. David Ilcinkas: Graph Exploration by Oblivious Agents. MoRoVer 2017, Villeurbanne, France, November 2017
  18. Michel Raynal: Constructions Universelles distribuées : un aperçu. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  19. Pierre Fraigniaud: Calcul distribué local. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  20. Cyril Gavoille: Compact and distributed data structures. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  21. Cyril Gavoille: Beyond classical local models in distributed computing. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles

National Conferences | Workshops without Proceedings


    2021
  1. Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin: Extension de la Hiérarchie de Herlihy aux Systèmes Multi-threads. 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2021, La Rochelle
  2. Stéphane Devismes and Pascal Lafourcade: Un jour sans fin. 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2021, La Rochelle
    2020
  3. Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen and Franck Petit: Élection Autostabilisante dans les Réseaux à Haute Dynamicité. 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2020, Lyon
  4. Pierluigi Crescenzi, Pierre Fraigniaud and Ami Paz: Calcul distribué simple et efficace de la betweenness. 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2020, Lyon
    2019
  5. Stéphane Devismes, Colette Johnen: Soyez efficace rembobinez. 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2019, Narbonne
  6. K. Altisen, S. Devismes, A. Durand: Silence dans la forêt ! 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2019, Narbonne
  7. Cyril Gavoille: Shorter implicit representation for planar graphs. In S. Cabello and B. Mohar, editors, 9th Slovenian International Conference on Graph Theory (SICGT), page 63. Institute of Mathematics, Physics and Mechanics (IMFM), June 2019
    2018
  8. Stéphane Devismes, David Ilcinkas, Colette Johnen: Schéma général auto-stabilisant et silencieux de constructions de type arbres couvrants. 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2018, Roscoff
  9. K. Altisen, S. Devismes, A. Durand, F. Petit: Stabilisation progressive. 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2018, Roscoff
  10. F. Carrier, A. Datta, S. Devismes, L.L. Larmore: L-Exclusion autostabilisante revisitée. 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2018, Roscoff
    2017
  11. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: t-résilient snapshot immédiat. 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2017, Quiberon
  12. Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal: Blockchain Consensus. 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2017, Quiberon
  13. Mohammed Haddad, Colette Johnen, Sven Kohler: Polynomial Silent Self-Stabilizing Maximal p-Star Decomposition. 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2017, Quiberon

Manuscripts | Technical Reports


    2021
  1. Emmanuel Godard, Eloi Perdereau: Back to the Coordinated Attack Problem. CoRR abs/2103.10816 (2021)
  2. Arnaud Casteigts, Yves Métivier, John Michael Robson: Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR abs/2101.01409 (2021)
  3. Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, Antonio Russo: Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications. CoRR abs/2103.08936 (2021)
  4. Chryssis Georgiou, Ioannis Marcoullis, Michel Raynal, Elad Michael Schiller: Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems. CoRR abs/2103.14649 (2021)
  5. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems. CoRR abs/2104.03129 (2021)
  6. Carlos López, Sergio Rajsbaum, Michel Raynal, Karla Vargas: Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability. CoRR abs/2105.02972 (2021)
  7. Romaric Duvignau, Michel Raynal, Elad Michael Schiller: Self-stabilizing Byzantine- and Intrusion-tolerant Consensus. CoRR abs/2110.08592 (2021)
  8. Pierre Fraigniaud, Ran Gelles, Zvi Lotker: The Topology of Randomized Symmetry-Breaking Distributed Computing. CoRR abs/2105.11713 (2021)
  9. Paul Bastide, Pierre Fraigniaud: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models. CoRR abs/2108.01989 (2021)
  10. Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca: A Meta-Theorem for Distributed Certification. CoRR abs/2112.03195 (2021)
  11. Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers: Upper and Lower Bounds for Deterministic Approximate Objects. CoRR abs/2104.09902 (2021)
  12. Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot: On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR abs/2101.02086 (2021)
  13. David Coudert, André Nusser, Laurent Viennot: Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. CoRR abs/2104.12523 (2021)
  14. Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot: On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR abs/2111.08328 (2021)
  15. David Coudert, André Nusser, Laurent Viennot: Hyperbolicity Computation through Dominating Sets. CoRR abs/2111.08520 (2021)
    2020
  16. Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems. CoRR abs/2010.00096 (2020)
  17. Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin: Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020)
  18. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-stabilizing Uniform Reliable Broadcast. CoRR abs/2001.03244 (2020)
  19. Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas C. Nicolaou, Michel Raynal: Appending Atomically in Byzantine Distributed Ledgers. CoRR abs/2002.11593 (2020)
  20. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: What Can Be Done with Consensus Number One: Relaxed Queues and Stacks. CoRR abs/2005.05427 (2020)
  21. Alex Auvolat, Davide Frey, Michel Raynal, François Taïani: Money Transfer Made Simple. CoRR abs/2006.12276 (2020)
  22. Oskar Lundström, Michel Raynal, Elad Michael Schiller: Self-Stabilizing Indulgent Zero-degrading Binary Consensus. CoRR abs/2010.05489 (2020)
  23. Daniel Bosk, Yérom-David Bromberg, Sonja Buchegger, Adrien Luxey, François Taïani: Spores: Stateless Predictive Onion Routing for E-Squads. CoRR abs/2007.04766 (2020)
  24. George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani: Cluster-and-Conquer: When Randomness Meets Graph Locality. CoRR abs/2010.11497 (2020)
  25. Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz: Simple and Fast Distributed Computation of Betweenness Centrality. CoRR abs/2001.08108 (2020)
  26. Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz: Distributed Quantum Proofs for Replicated Data. CoRR abs/2002.10018 (2020)
  27. Pierre Fraigniaud, Ami Paz: The Topology of Local Computing in Networks. CoRR abs/2003.03255 (2020)
  28. Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca: Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020)
  29. Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca: Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020)
  30. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach: Present-Biased Optimization. CoRR abs/2012.14736 (2020)
    2019
  31. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565 (2019)
  32. Stéphane Devismes, Colette Johnen: Self-Stabilizing Distributed Cooperative Reset. CoRR abs/1901.03587 (2019)
  33. Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR abs/1907.07944 (2019)
  34. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019)
  35. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie: Distributed Computing in the Asynchronous LOCAL model. CoRR abs/1904.07664 (2019)
  36. Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz: Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019)
  37. Hardness of exact distance queries in sparse graphs through hub labeling: Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot. CoRR abs/1902.07055 (2019)
  38. Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Infinite Grid Exploration by Disoriented Robots. CoRR abs/1905.09271 (2019)
  39. Siddharth Gupta, Adrian Kosowski, Laurent Viennot: Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. HAL 01737210 (2019)
  40. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk: Shorter Labeling Schemes for Planar Graphs. CoRR abs/1908.03341 (2019)
    2018
  41. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: A Simple Object that Spans the Whole Consensus Hierarchy. CoRR abs/1802.00678 (2018)
  42. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Extending Causal Consistency to any Object Defined by a Sequential Specification. CoRR abs/1802.00706 (2018)
  43. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel: Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018)
  44. Sergio Rajsbaum, Michel Raynal: Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution. CoRR abs/1812.06011 (2018)
  45. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in Distributed Proofs. CoRR abs/1803.03031 (2018)
    2017
  46. Stéphane Devismes, David Ilcinkas, Colette Johnen: Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR abs/1703.03315 (2017)
  47. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). CoRR abs/1702.08176 (2017)
  48. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Which Broadcast Abstraction Captures k-Set Agreement? CoRR abs/1705.04835 (2017)
  49. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267 (2017)
  50. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. CoRR abs/1704.06070 (2017)
  51. Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca: Distributed Subgraph Detection. CoRR abs/1706.03996 (2017)
  52. Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal: (Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains. CoRR abs/1702.03068 (2017)

    Bordeaux        Paris        Rennes        Multiple partners