Publications ANR DESCARTES

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

Journal Articles


    2019
  1. Armando Castañeda, Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: Making Local Algorithms Wait-Free: the Case of Ring Coloring. Theory Comput. Syst. 63(2): 344-365 (2019)
  2. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers: A Lower Bound on the Number of Opinions Needed for Fault-Tolerant Decentralized Run-Time Monitoring. Journal of Applied Topology, to appear.
  3. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar: Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48(3): 1120-1145 (2019)
  4. 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)
  5. Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil: Optimal torus exploration by oblivious robots. Computing 101(9): 1241-1264 (2019)
  6. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore: A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theor. Comput. Sci. 753: 35-63 (2019)
  7. 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)
  8. Tyler Crain, Vincent Gramoli, Michel Raynal: A speculation-friendly binary search tree. Concurrency and Computation: Practice and Experience 31(4) (2019)
  9. Hicham Lakhlef, Michel Raynal, François Taïani: Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks. IEEE Trans. Parallel Distrib. Syst. 30(7): 1672-1686 (2019)
  10. K. Altisen, S. Devismes, A. Durand, F. Petit: Gradual stabilization. J. Parallel Distributed Computing 123, pp. 26-45, 2019
  11. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. Computer J. 62(5): 730-746 (2019)
  12. Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry: Randomized proof-labeling schemes. Distributed Computing 32(3): 217-234 (2019)
  13. Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz: Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. Computer J. 62(2): pp. 231-246, 2019
  14. 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)
  15. Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari: Counting in one-hop beeping networks. Theor. Comput. Sci. 780: 20-28 (2019)
  16. 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.
  17. E. Bampas, J. Czyzowicz, D. Ilcinkas, R. Klasing: Beachcombing on strips and islands. Theor. Comput. Sci., 2019 (in press).
  18. E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop-Butucaru, S. Tixeuil: On Asynchronous Rendezvous in General Graphs. Theor. Comput. Sci. 753: 80-90, 2019.
  19. 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.
  20. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao: Crash-tolerant causal broadcast in O(n) messages. Information Processing Letters 151 (2019), 105837
    2018
  21. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal: Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems. IEEE Trans. Parallel Distrib. Syst. 29(9): 2033-2045 (2018)
  22. E. Bampas, D. Ilcinkas: On mobile agent verifiable problems. Information and Computation 260: 51-71, 2018.
  23. Claire Capdevielle, Colette Johnen, Alessia Milani: On the complexity of basic abstractions to implement consensus. Theor. Comput. Sci. 715: 86-96 (2018)
  24. Hicham Lakhlef, Abdelmadjid Bouabdallah, Michel Raynal, Julien Bourgeois: Agent-based broadcast protocols for wireless heterogeneous node networks. Computer Communications 115: 51-63 (2018)
  25. 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)
  26. 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)
  27. Weiping Zhu, Jiannong Cao, Michel Raynal: Energy-Efficient Composite Event Detection in Wireless Sensor Networks. IEEE Communications Letters 22(1): 177-180 (2018)
  28. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. J. ACM 65(6): 45:1-45:42 (2018)
  29. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Processing Letters 28(2): 1850006 (2018)
  30. Achour Mostéfaoui, Hamouma Moumen, Michel Raynal: Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709: 80-97 (2018)
  31. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in Distributed Proofs. In 32nd International Symposium on Distributed Computing (DISC), pp. 24:1-24:18, 2018.
  32. Pierre Fraigniaud, Amos Korman, Yoav Rodeh: Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019)
  33. Simon Collet, Pierre Fraigniaud, Paolo Penna: Equilibria of Games in Networks for Local Tasks. In 22nd International Conference on Principles of Distributed Systems (OPODIS), pp. 6:1-6:16, 2018.
  34. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti: What can be verified locally? J. Comput. Syst. Sci. 97: 106-120 (2018)
  35. Pierre Fraigniaud, Emanuele Natale: Noisy rumor spreading and plurality consensus. Distributed Computing 32(4): 257-276 (2019)
  36. Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela: Node labels in local decision. Theor. Comput. Sci. 751: 61-73 (2018)
  37. D. Ilcinkas and A. Wade: Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring. Theory Comput. Syst. 62(5): 1144-1160, 2018.
  38. Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro: A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. Algorithmica 80(11): 3023-3049 (2018)
  39. Leonid Barenboim, Michael Elkin, Cyril Gavoille: A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751: 2-23 (2018)
    2017
  40. 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.
  41. 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
  42. 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 Inf. 54(5): 501-520 (2017)
  43. Karine Altisen, Alain Cournier, Stéphane Devismes, Anaïs Durand, Franck Petit: Self-stabilizing leader election in polynomial steps. Inf. Comput. 254: 330-366 (2017)
  44. 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)
  45. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore: Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. 665: 51-72 (2017)
  46. Karine Altisen, Stéphane Devismes:: On probabilistic snap-stabilization. Theor. Comput. Sci. 688: 49-76 (2017)
  47. K. Altisen, S. Devismes, A. Durand: Concurrency in snap-stabilizing local resource allocation. J. Parallel Distributed Computing 102: 42-56, 2017
  48. Michel Raynal: Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS 121: 65-96 (2017)
  49. 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)
  50. Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard: Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. Theory Comput. Syst. 60(4): 677-694 (2017)
  51. Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683: 1-21 (2017)
  52. Pierre Fraigniaud, Andrzej Pelc: Decidability classes for mobile agents computing. J. Parallel Distributed Computing 109: 117-128 (2017)
  53. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. DISC 2017: 6:1-6:16
  54. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Which Broadcast Abstraction Captures k-Set Agreement? DISC 2017: 27:1-27:16
  55. Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani: On the uncontended complexity of anonymous agreement. Distributed Computing 30(6): 459-468, 2017
  56. 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)
  57. K. Altisen, P. Corbineau, S. Devismes: A Framework for Certified Self-Stabilization. Logical Methods in Computer Science 13(4), 2017

Book | Book Chapters


    2019
  1. 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)
  2. D. Ilcinkas: Oblivious Robots on Graphs: Exploration. Distributed Computing by Mobile Entities, LNCS 11340, pp. 218-233, 2019.
    2018
  3. Michel Raynal: Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer 2018, ISBN 978-3-319-94140-0, pp. 1-459

International Conferences | Workshops with Proceedings


    2019
  1. Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal: On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion. AINA 2019: 272-285
  2. 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
  3. 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), pp. 158-167, 2019
  4. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18
  5. Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers: Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019
  6. A. Datta, S. Devismes, C. Johnen, L.L. Larmore, Lawrence: Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree Construction (brief announcement). SSS 2019
  7. Stéphane Devismes, Colette Johnen: Self-Stabilizing Distributed Cooperative Reset. In 39th Int'l Conference on Distributed Computing Systems (ICDCS), pp. 379-389, 2019
  8. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel: Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166
  9. Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot: Hardness of exact distance queries in sparse graphs through hub labeling. PODC 2019: 272-279
  10. Siddharth Gupta, Adrian Kosowski, Laurent Viennot: Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019.
  11. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO 2019: 246-261
  12. Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Infinite Grid Exploration by Disoriented Robots. SIROCCO 2019: 340-344
  13. 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), pp. 464-471, 2019
  14. Ahad Baig, Danny Hendler, Alessia Milani and Corentin Travers: Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC 2019
  15. Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca: On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245
  16. Cyril Gavoille, Ghazal Kachigar, Gilles Zémor: Localisation-Resistant Random Words with Small Alphabets. WORDS 2019: 193-206
  17. K. Altisen, P. Corbineau, S. Devismes: Squeezing Streams and Composition of Self-Stabilizing Algorithms. FORTE 2019: LNCS 11535, pp. 21-38, Lyngby, Danemark
    2018
  18. 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
  19. 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
  20. 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
  21. Michel Raynal, Jiannong Cao: A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality. MCU 2018: LNCS 10881, pp. 34-50
  22. Tyler Crain, Vincent Gramoli, Mikel Larrea, Michel Raynal: DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA 2018: 1-8
  23. Michel Raynal, Jiannong Cao: Anonymity in Distributed Read/Write Systems: An Introductory Survey. NETYS 2018: 122-140
  24. K. Altisen, S. Devismes, A. Durand: Acyclic Strategy for Silent Self-stabilization in Spanning Forests. SSS 2018: LNCS 11201, pp. 186-202, Tokyo
  25. Amitay Shaer, Shlomi Dolev, Silvia Bonomi, Michel Raynal, Roberto Baldoni: Bee's Strategy Against Byzantines Replacing Byzantine Participants. SSS 2018: LNCS 11201, pp. 139-153, Tokyo
  26. Anaïs Durand, Michel Raynal, Gadi Taubenfeld: Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. SSS 2018: LNCS 11201, pp. 269-283, Tokyo
  27. Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa: The Assignment Problem. ICDCN 2018: 14:1-14:9
  28. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa: An Anonymous Wait-Free Weak-Set Object Implementation. NETYS 2018: 141-156
  29. Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa: A Characterization of t-Resilient Colorless Task Anonymous Solvability. SIROCCO 2018: 178-192
  30. Chen Avin, Avi Cohen, Pierre Fraigniaud, Zvi Lotker, David Peleg: Preferential Attachment as a Unique Equilibrium. WWW 2018: 559-568
    2017
  31. 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, pp. 10:1-10:16, 2017.
  32. 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
  33. 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
  34. Armando Castañeda, Sergio Rajsbaum, Michel Raynal: Long-Lived Tasks. NETYS 2017: 439-454
  35. 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), pp. 15:1-15:30, 2017.
  36. Laurent Feuilloley, Pierre Fraigniaud: Error-Sensitive Proof-Labeling Schemes. In 31st International Symposium on Distributed Computing (DISC), pp. 16:1-16:15, 2017.
  37. Pierre Fraigniaud, Dennis Olivetti: Distributed Detection of Cycles. In 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 153-162, 2017.
  38. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti: What Can Be Verified Locally? STACS 2017: 8:1-8:13.
  39. 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


    2019
  1. Michel Raynal: Thoughts on Informatics and Distributed Computing. Séminaire au Collège de France, 12 avril 2019
  2. Pierre Fraigniaud: Distributed Network Computing. Séminaire au Collège de France, 12 avril 2019
  3. Cyril Gavoille: Distributed computing with quantum resources and beyond. In Complexity, Algorithms, Automata and Logic Meet (CAALM), Chennai Mathematical Institute, Inde, January 2019.
    2018
  4. Hugues Fauconnier: Détecteurs de défaillances. Séminaire au Collège de France, 21 décembre 2018
  5. Achour Mostéfaoui: Accord et Malice. Séminaire au Collège de France, 18 janvier 2018
  6. Carole Delporte-Gallet: Protocoles de Population. Séminaire au Collège de France, 18 janvier 2018
    2017
  7. Pierre Fraigniaud: Algorithmes distribués. Séminaire au Collège de France, 28 novembre 2017
  8. 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
  9. David Ilcinkas: Graph Exploration by Oblivious Agents (Tutorial). MAC 2017, La Maddalena, Italie, June 2017
  10. David Ilcinkas: Graph Exploration by Oblivious Agents. MoRoVer 2017, Villeurbanne, France, November 2017
  11. Michel Raynal: Constructions Universelles distribuées : un aperçu. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  12. Pierre Fraigniaud: Calcul distribué local. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  13. Cyril Gavoille: Compact and distributed data structures. 44e École de Printemps en Informatique Théorique (EPIT) - Distributed Computing, 2017, Île de Porquerolles
  14. 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


    2019
  1. Stéphane Devismes, Colette Johnen: Soyez efficace rembobinez. 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), 2019, Narbonne
  2. 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
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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


    2019
  1. 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)
  2. Stéphane Devismes, Colette Johnen: Self-Stabilizing Distributed Cooperative Reset. CoRR abs/1901.03587 (2019)
  3. 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)
  4. Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld: Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR abs/1903.12204 (2019)
  5. Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie: Distributed Computing in the Asynchronous LOCAL model. CoRR abs/1904.07664 (2019)
  6. Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz: Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019)
  7. Hardness of exact distance queries in sparse graphs through hub labeling: Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot. CoRR abs/1902.07055 (2019)
  8. Quentin Bramas, Stéphane Devismes, Pascal Lafourcade: Infinite Grid Exploration by Disoriented Robots. CoRR abs/1905.09271 (2019)
  9. Siddharth Gupta, Adrian Kosowski, Laurent Viennot: Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. HAL 01737210 (2019)
  10. Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk: Shorter Labeling Schemes for Planar Graphs. CoRR abs/1908.03341 (2019)
    2018
  11. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: A Simple Object that Spans the Whole Consensus Hierarchy. CoRR abs/1802.00678 (2018)
  12. Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Extending Causal Consistency to any Object Defined by a Sequential Specification. CoRR abs/1802.00706 (2018)
  13. Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel: Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018)
  14. Sergio Rajsbaum, Michel Raynal: Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution. CoRR abs/1812.06011 (2018)
  15. Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry: Redundancy in Distributed Proofs. CoRR abs/1803.03031 (2018)
    2017
  16. 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)
  17. 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)
  18. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Which Broadcast Abstraction Captures k-Set Agreement? CoRR abs/1705.04835 (2017)
  19. Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal: Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267 (2017)
  20. Alkida Balliu, Pierre Fraigniaud: Certification of Compact Low-Stretch Routing Schemes. CoRR abs/1704.06070 (2017)
  21. Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca: Distributed Subgraph Detection. CoRR abs/1706.03996 (2017)
  22. 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