Major publications by the team in recent years
  • 1F. André, A.-M. Kermarrec, E. Le Merrer, N. Le Scouarnec, G. Straub, A. Van Kempen.

    Archiving Cold Data in Warehouses with Clustered Network Coding, in: EuroSys 2014, Amsterdam, Netherlands, ACM New York, NY, USA, April 2014. [ DOI : 10.1145/2592798.2592816 ]

  • 2M. Bertier, D. Frey, R. Guerraoui, A.-M. Kermarrec, V. Leroy.

    The Gossple Anonymous Social Network, in: ACM/IFIP/USENIX 11th International Middleware Conference, India Bangalore, November 2010.
  • 3S. Bouget, A.-M. Kermarrec, H. Kervadec, F. Taïani.

    Polystyrene: the Decentralized Data Shape That Never Dies, in: The 2014 IEEE 34th International Conference on Distributed Computing Systems (ICDCS 2014), Madrid, Spain, June 2014, pp. 288 - 297. [ DOI : 10.1109/ICDCS.2014.37 ]

  • 4J. Cao, M. Raynal, X. Yang, W. Wu.

    Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks, in: IEEE Transactions on Computers, 2007, vol. 56, no 8, pp. 1055–1070.
  • 5K. Censor-Hillel, M. Ghaffari, G. Giakkoupis, B. Haeupler, F. Kuhn.

    Tight Bounds on Vertex Connectivity Under Vertex Sampling, in: 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, United States, January 2015, pp. 2006-1018. [ DOI : 10.1137/1.9781611973730.133 ]

  • 6G. Giakkoupis, P. Woelfel.

    Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM, in: 55th IEEE Symposium on Foundations of Computer Science (FOCS), Philadelphia, PA, United States, October 2014.

  • 7M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, M. van Steen.

    Gossip-Based Peer Sampling, in: ACM Transactions on Computer Systems, August 2007, vol. 41, no 5.
  • 8A.-M. Kermarrec, F. Taïani, J. M. Tirado Martin.

    Scaling Out Link Prediction with SNAPLE, in: 16th Annual ACM/IFIP/USENIX Middleware Conference, Vancouver, Canada, December 2015, 12 p. [ DOI : 10.1145/2814576.2814810 ]

  • 9A. Mostefaoui, H. Moumen, M. Raynal.

    Signature-Free Asynchronous Binary Byzantine Consensus with t<n/3, O(n2) Messages, and O(1) Expected Time, in: Journal of the ACM (JACM), December 2015, vol. 62, pp. 1000-1020. [ DOI : 10.1145/2785953 ]

  • 10F. Taïani, S. Lin, G. S. Blair.

    GOSSIPKIT: A Unified Component Framework for Gossip, in: IEEE Transactions on Software Engineering, March 2014, vol. 40, no 2, pp. 123-136. [ DOI : 10.1109/TSE.2013.50 ]

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 13Z. Bouzid, M. Raynal, P. Sutra.

    Anonymous obstruction-free (n,k)-set agreement with n−k+1 atomic read/write registers, in: Distributed Computing, May 2017, pp. 1 - 19. [ DOI : 10.1007/s00446-017-0301-7 ]

  • 14A. Castañeda, C. Delporte-Gallet, ·. Hugues Fauconnier, S. Rajsbaum, M. Raynal.

    Making Local Algorithms Wait-Free: the Case of Ring Coloring, in: Theory of Computing Systems, May 2017, pp. 1-22. [ DOI : 10.1007/s00224-017-9772-y ]

  • 15K. Censor-Hillel, M. Ghaffari, G. Giakkoupis, B. Haeupler, F. Kuhn.

    Tight Bounds on Vertex Connectivity Under Sampling, in: ACM Transactions on Algorithms, May 2017, vol. 13, no 2, pp. 19:1 - 19:26. [ DOI : 10.1145/3086465 ]

  • 16C. Fernández-Campusano, M. Larrea, R. Cortiñas, M. Raynal.

    A distributed leader election algorithm in crash-recovery and omissive systems, in: Information Processing Letters, February 2017, vol. 118, pp. 100 - 104. [ DOI : 10.1016/j.ipl.2016.10.007 ]

  • 17R. Guerraoui, A.-M. Kermarrec, T. Lin, R. Patra.

    Heterogeneous Recommendations: What You Might Like To Read After Watching Interstellar, in: Proceedings of the VLDB Endowment (PVLDB), June 2017, vol. 10, no 10, pp. 1070 - 1081. [ DOI : 10.14778/3115404.3115412 ]

  • 18M. Herlihy, S. Rajsbaum, M. Raynal, J. Stainer.

    From wait-free to arbitrary concurrent solo executions in colorless distributed computing, in: Theoretical Computer Science, June 2017, vol. 683, pp. 1 - 21. [ DOI : 10.1016/j.tcs.2017.04.007 ]

  • 19A. Mostefaoui, M. Petrolia, M. Raynal, C. Jard.

    Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems, in: Theory of Computing Systems, May 2017, vol. 60, no 4, pp. 677 - 694. [ DOI : 10.1007/s00224-016-9699-8 ]

  • 20A. Mostefaoui, M. Raynal.

    Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n/3, O(n 2 ) messages, and constant time, in: Acta Informatica, August 2017, vol. 54, no 5, pp. 501 - 520. [ DOI : 10.1007/s00236-016-0269-y ]

  • 21B. Nédelec, J. Tanke, P. Molli, A. Mostefaoui, D. Frey.

    An Adaptive Peer-Sampling Protocol for Building Networks of Browsers, in: World Wide Web, 2017, vol. 25, 1678 p. [ DOI : 10.1007/s11280-017-0478-5 ]

  • 22M. Raynal.

    Distributed Universal Constructions: a Guided Tour, in: Bulletin of the EATCS, 2017, vol. 121, pp. 1-34.


International Conferences with Proceedings

  • 23F. André, A.-M. Kermarrec, N. Le Scouarnec.

    Accelerated Nearest Neighbor Search with Quick ADC, in: ICMR 2017 - ACM International Conference on Multimedia Retrieval, Bucarest, Romania, Proceedings of the 2017 ACM on International Conference on Multimedia Retrieval, June 2017, pp. 159-166, https://arxiv.org/abs/1704.07355. [ DOI : 10.1145/3078971.3078992 ]

  • 24R. Ariyattu, F. Taïani.

    Filament: A Cohort Construction Service for Decentralized Collaborative Editing Platforms, in: DAIS 2017 - 7th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems, Neuchâtel, Switzerland, June 2017, pp. 146-16. [ DOI : 10.1007/978-3-319-59665-5_11 ]

  • 25P. Berenbrink, G. Giakkoupis, P. Kling.

    Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs, in: SODA 2018 - Proceedings of the 29th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, January 2018.

  • 26A. Bouabdallah, H. LAKHLEF, M. Raynal, F. Taïani.

    Providing Collision-Free and Conflict-Free Communication in General Synchronous Broadcast/Receive Networks, in: AINA 2017 - 31st IEEE International Conference on Advanced Information Networking and Applications, Taipei, Taiwan, March 2017, pp. 399 - 406. [ DOI : 10.1109/AINA.2017.39 ]

  • 27S. Bouget, D. Bromberg, F. Taïani, A. Ventresque.

    Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFN, in: DAIS 2017 - 17th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems, Neuchâtel, Switzerland, L. Y. Chen, H. Reiser (editors), Springer, June 2017, pp. 101-114. [ DOI : 10.1007/978-3-319-59665-5_7 ]

  • 28A. Boutet, A.-M. Kermarrec, N. Mittal, F. Taïani.

    KIFF: un algorithme de construction de graphe KNN générique, rapide et évolutif, in: ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France, May 2017.

  • 29A. Castañeda, Y. Moses, M. Raynal, M. Roy.

    Early Decision and Stopping in Synchronous Consensus: A Predicate-Based Guided Tour, in: International Conference on Networked Systems (NETYS), Marrakech, Morocco, Proceedings of NETYS 2017: the 5th International Conference on Networked Systems, May 2017, vol. 96, pp. 167 - 221. [ DOI : 10.1007/978-3-319-59647-1_16 ]

  • 30G. Giakkoupis, P. Woelfel.

    Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model, in: PODC 2017 - Proceedings of the 36th ACM Symposium on Principles of Distributed Computing, Washington, DC, United States, July 2017. [ DOI : 10.1145/3087801.3087837 ]

  • 31R. Guerraoui, A.-M. Kermarrec, M. Taziki.

    The Utility and Privacy Effects of a Click, in: SIGIR 2017 - Thr 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, Tokyo, Japan, Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM, August 2017, pp. 665-674. [ DOI : 10.1145/3077136.3080783 ]

  • 32R. Halalai, P. Felber, A.-M. Kermarrec, F. Taïani.

    Agar: A Caching System for Erasure-Coded Data, in: ICDCS 2017 - 37th IEEE International Conference on Distributed Computing Systems, Atlanta, GA, United States, June 2017, pp. 1-11. [ DOI : 10.1109/ICDCS.2017.97 ]

  • 33D. Lima, H. Miranda, F. Taïani.

    Simulation of Partial Replication in Distributed Transactional Memory, in: 2017 Wireless Days Conference, Porto, Portugal, March 2017, pp. 54 - 59. [ DOI : 10.1109/WD.2017.7918115 ]

  • 34G. Tato, M. Bertier, C. Tedeschi.

    Designing Overlay Networks for Decentralized Clouds, in: FutureCloud 2017 - International Workshop on the Future of Cloud Computing and Cloud Services, Hong-Kong, China, December 2017.


Conferences without Proceedings

  • 35A. Castañeda, M. Raynal, S. Rajsbaum.

    Long-Lived Tasks, in: NETYS 2017 - 5th International Conference on NETworked sYStems, Marrakech, Morocco, Springer, May 2017, vol. 10299, pp. 439-454. [ DOI : 10.1007/978-3-319-59647-1_32 ]


Internal Reports

Other Publications

References in notes
  • 40M. Aguilera.

    A Pleasant Stroll Through the Land of Infinitely Many Creatures, in: ACM SIGACT News, Distributed Computing Column, 2004, vol. 35, no 2.
  • 41D. Angluin.

    Local and Global Properties in Networks of Processes, in: Proc. 12th ACM Symposium on Theory of Computing (STOC'80), 1980.
  • 42H. Attiya, A. Bar-Noy, D. Dolev.

    Sharing Memory Robustly in Message-passing Systems, in: J. ACM, January 1995, vol. 42, no 1, pp. 124–142.

  • 43K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, Y. Minsky.

    Bimodal Multicast, in: ACM Transactions on Computer Systems, May 1999, vol. 17, no 2, pp. 41-88.
  • 44A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry.

    Epidemic algorithms for replicated database maintenance, in: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'87), August 1987.
  • 45P. Eugster, S. Handurukande, R. Guerraoui, A.-M. Kermarrec, P. Kouznetsov.

    Lightweight Probabilistic Broadcast, in: ACM Transaction on Computer Systems, November 2003, vol. 21, no 4.
  • 46M. Merritt, G. Taubenfeld.

    Computing Using Infinitely Many Processes, in: Proc. 14th Int'l Symposium on Distributed Computing (DISC'00), 2000.
  • 47S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker.

    A Scalable Content-Addressable Network, in: Conference of the Special Interest Group on Data Communication (SIGCOMM'01), 2001.
  • 48A. Rowstron, P. Druschel.

    Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware), 2001.
  • 49I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan.

    Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, in: SIGCOMM'01, 2001.
  • 50S. Voulgaris, D. Gavidia, M. van Steen.

    CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, in: Journal of Network and Systems Management, 2005, vol. 13, no 2.