EN FR
EN FR


Bibliography

Major publications by the team in recent years
  • 1M. 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.

    http://hal.inria.fr/inria-00515693/en
  • 2J. 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, p. 1055–1070.
  • 3A. Carneiro Viana, S. Maag, F. Zaidi.

    One step forward: Linking Wireless Self-Organising Networks Validation Techniques with Formal Testing approaches, in: ACM Computing Surveys, 2009.

    http://hal.inria.fr/inria-00429444/en/
  • 4D. Frey, R. Guerraoui, A.-M. Kermarrec, M. Monod, K. Boris, M. Martin, V. Quéma.

    Heterogeneous Gossip, in: Middleware 2009, Urbana-Champaign, IL, USA, 2009.

    http://hal.inria.fr/inria-00436125/en/
  • 5R. Friedman, A. Mostefaoui, S. Rajsbaum, M. Raynal.

    Distributed agreement problems and their connection with error-correcting codes, in: IEEE Transactions on Computers, 2007, vol. 56, no 7, p. 865–875.
  • 6A. J. Ganesh, A.-M. Kermarrec, E. Le Merrer, L. Massoulié.

    Peer counting and sampling in overlay networks based on random walks, in: Distributed Computing, 2007, vol. 20, no 4, p. 267-278.
  • 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.
  • 8B. Maniymaran, M. Bertier, A.-M. Kermarrec.

    Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks., in: Proceedings of ICDCS 2007, Toronto, Canada, June 2007.
  • 9A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers.

    From Diamond W to Omega: a simple bounded quiescent reliable broadcast-based transformation, in: Journal of Parallel and Distributed Computing, 2007, vol. 61, no 1, p. 125–129.
  • 10J. Patel, É. Rivière, I. Gupta, A.-M. Kermarrec.

    Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems., in: Computer Networks, 2009, vol. 53, no 13.

    http://hal.inria.fr/inria-00436057/en/
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11F. Taïani.

    Programmation des grands systèmes distribués: quelques mécanismes, abstractions, et outils, Université Rennes 1, November 2011, Habilitation à Diriger des Recherches.

    http://hal.inria.fr/tel-00643729/en

Articles in International Peer-Reviewed Journal

  • 12X. Bai, R. Guerraoui, A.-M. Kermarrec, V. Leroy.

    Collaborative Personalized Top-k Processing, in: ACM Transactions on Database Systems (TODS), 2011, vol. 36, no 4.

    http://hal.inria.fr/hal-00652036/en
  • 13Y. Busnel, L. Querzoni, R. Baldoni, M. Bertier, A.-M. Kermarrec.

    Analysis of Deterministic Tracking of Multiple Objects using a Binary Sensor Network, in: ACM Transactions on Sensor Networks, 2011, vol. 8.

    http://hal.inria.fr/inria-00590873/en
  • 14P. Felber, A.-M. Kermarrec, L. Leonini, É. Rivière, S. Voulgaris.

    PULP: an Adaptive Gossip-Based Dissemination Protocol for Multi-Source Message Streams., in: Peer-to-Peer Networking and Applications, Springer, 2011.

    http://hal.inria.fr/hal-00646616/en
  • 15R. Guerraoui, K. Huguenin, A.-M. Kermarrec, M. Monod, Ý. Vigfússon.

    Decentralized Polling with Respectable Participants, in: Journal of Parallel and Distributed Computing, January 2012, vol. 72, no 1. [ DOI : 10.1016/j.jpdc.2011.09.003 ]

    http://hal.inria.fr/inria-00629455/en
  • 16D. Imbs, M. Raynal.

    A liveness condition for concurrent objects: x-wait-freedom, in: Concurrency and Computation: Practice and Experience, 2011, vol. 23, no 17, p. 2154-2166.

    http://hal.inria.fr/hal-00646908/en
  • 17D. Imbs, M. Raynal.

    Software transactional memories: an approach for multicore programming, in: Journal of Supercomputing, 2011, vol. 57, no 2, p. 203-215.

    http://hal.inria.fr/hal-00646909/en
  • 18D. Imbs, M. Raynal.

    Help when needed, but no more: Efficient read/write partial snapshot, in: Journal of Parallel and Distributed Computing, 2012, vol. 72, no 1, p. 1-12.

    http://hal.inria.fr/hal-00646906/en
  • 19A.-M. Kermarrec, E. Le Merrer, B. Sericola, G. Trédan.

    Second order centrality: Distributed assessment of nodes criticity in complex networks, in: Computer Communications, 2011, vol. 34, no 5. [ DOI : 10.1016/j.comcom.2010.06.007 ]

    http://hal.inria.fr/inria-00506385/en
  • 20A.-M. Kermarrec, G. Tan.

    Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach., in: IEEE/ACM Transactions on Networking, 2011, To appear.

    http://hal.inria.fr/inria-00619038/en
  • 21M. Raynal, R. Baldoni, S. Bonomi.

    Implementing a Regular Register in an Eventually Synchronous Distributed System prone to Continuous Churn, in: IEEE Transactions on Parallel and Distributed Systems, 2011.

    http://hal.inria.fr/hal-00649322/en
  • 22M. Raynal, F. Bonnet.

    On the road to the Weakest Failure Detector for k-Set Agreement in Message-passing Systems, in: Theoretical Computer Science, June 2011, vol. 412, no 33, p. 4273-4284.

    http://hal.inria.fr/hal-00649311/en
  • 23M. Raynal, F. Bonnet.

    The Price of Anonymity: Optimal Consensus despite Asynchrony, Crash and Anonymity, in: ACM Transactions on Autonomous and Adaptive Systems (TAAS), 2011, vol. 6, no 4.

    http://hal.inria.fr/hal-00652434/en

International Conferences with Proceedings

  • 24M. Alaggan, S. Gambs, A.-M. Kermarrec.

    Private Similarity Computation in Distributed Systems: from Cryptography to Differential Privacy, in: OPODIS, Toulouse, France, LNCS, Springer-Verlag Berlin Heidelberg, December 2011, vol. 7109, p. 357 - 377.

    http://hal.inria.fr/hal-00646831/en
  • 25K. Aslan, P. Molli, H. Skaf-Molli, S. Weiss.

    C-Set : a Commutative Replicated Data Type for Semantic Stores, in: RED: Fourth International Workshop on REsource Discovery, Heraklion, Greece, May 2011.

    http://hal.inria.fr/inria-00594590/en
  • 26O. Baldellon, A. Mostefaoui, M. Raynal.

    A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks, in: 12th International Conference on Distributed Computing and Networking (ICDCN'11), Bangalore, India, M. Aguilera, et al. (editors), Lecture Notes in Computer Science, Springer Verlag, January 2011, vol. 6522, p. 215-226.

    http://hal.inria.fr/hal-00647764/en
  • 27O. Baldellon, A. Mostefaoui, M. Raynal.

    A Symmetric Synchrony Condition for Solving Byzantine Consensus, in: 12th International Conference on Distributed Computing and Networking (ICDCN 2011), Bangalore, India, M. Aguilera, et al. (editors), LNCS, Springer Verlag, January 2011, vol. 6522, p. 215–226.

    http://hal.inria.fr/inria-00544666/en
  • 28M. Bertier, M. Obrovac, C. Tedeschi.

    A Protocol for the Atomic Capture of Multiple Molecules at Large Scale, in: 13th International Conference on Distributed Computing and Networking, Hong-Kong, China, January 2012.

    http://hal.inria.fr/hal-00644262/en
  • 29T. Crain, D. Imbs, M. Raynal.

    Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible, in: 11th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP'11), Melbourne, Australia, Springer-Verlag LNCS, 2011, p. 244-257.

    http://hal.inria.fr/hal-00646902/en
  • 30T. Crain, D. Imbs, M. Raynal.

    Towards a universal construction for transaction-based multiprocess programs, in: 13th International Conference on Distributed Computing and Networking (ICDCN'12), Hong Kong, Hong Kong, Springer-Verlag LNCS, 2012.

    http://hal.inria.fr/hal-00646911/en
  • 31S. Defrance, A.-M. Kermarrec, E. Le Merrer, N. Le Scouarnec, G. Straub, A. Van Kempen.

    Efficient peer-to-peer backup services through buffering at the edge, in: Peer-to-Peer Computing (P2P), 2011 IEEE International Conference on P2P systems, Kyoto, Japan, August 2011, p. 142 - 151. [ DOI : 10.1109/P2P.2011.6038671 ]

    http://hal.inria.fr/hal-00646768/en
  • 32C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, A.-M. Kermarrec, E. Ruppert, T.-T. Hung.

    Byzantine Agreement with Homonyms, in: 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), San Jose, United States, 2011.

    http://hal.inria.fr/inria-00590866/en
  • 33D. Frey, A. Jégou, A.-M. Kermarrec.

    Social Market: Combining Explicit and Implicit Social Networks, in: International Symposium on Stabilization, Safety, and Security of Distributed Systems, Grenoble, France, LNCS, October 2011.

    http://hal.inria.fr/inria-00624129/en
  • 34A. Hagit, A. Castañeda.

    A non-topological proof for the impossibility of k-set agreement, in: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Grenoble, France, October 2011.

    http://hal.inria.fr/hal-00650623/en
  • 35K. Huguenin, A. Yahyavi, B. Kemme.

    Short paper: Cheat Detection and Prevention in P2P MOGs, in: ACM/IEEE 10th International Workshop on Network and Systems Support for Games (NETGAMES), Ottawa, Canada, October 2011.

    http://hal.inria.fr/inria-00616878/en
  • 36D. Imbs, S. Rajsbaum, M. Raynal.

    The Universe of Symmetry Breaking Tasks, in: 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO'11), Gdansk, Poland, Springer-Verlag LNCS, 2011, p. 66-77.

    http://hal.inria.fr/hal-00646904/en
  • 37D. Imbs, M. Raynal.

    A Simple Snapshot Algorithm for Multicore Systems, in: 5th Latin-American Symposium on Dependable Computing (LADC'11), São José dos Campos, Brazil, 2011, p. 17-24.

    http://hal.inria.fr/hal-00646903/en
  • 39A.-M. Kermarrec, N. Le Scouarnec, G. Straub.

    Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes, in: The 2011 International Symposium on Network Coding, Beijing, China, 2011.

    http://hal.inria.fr/inria-00590869/en
  • 40A.-M. Kermarrec, V. Leroy, C. Thraves.

    Converging Quickly to Independent Uniform Random Topologies, in: 19th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP), 2011., Ayia Napa, Cyprus, February 2011.

    http://hal.inria.fr/inria-00543249/en
  • 41A.-M. Kermarrec, V. Leroy, G. Trédan.

    Distributed social graph embedding, in: Conference on Information and Knowledge Management (CIKM), Glasgow, United Kingdom, ACM, 2011.

    http://hal.inria.fr/hal-00646611/en
  • 42A.-M. Kermarrec, C. Thraves.

    Can everybody sit closer to their friends than their enemies?, in: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS), Warsow, Poland, 2011.

    http://hal.inria.fr/inria-00599701/en
  • 43S. Lin, F. Taïani, M. Bertier, A.-M. Kermarrec.

    Transparent Componentisation: High-level (Re)configurable Programming for Evolving Distributed Systems, in: 26th ACM Symposium on Applied Computing, Taichung, Taiwan, Province Of China, March 2011.

    http://hal.inria.fr/inria-00544510/en
  • 44A. Mostefaoui, M. Raynal.

    Looking for Efficient Implementations of Concurrent Objects, in: 11th International Conference on Parallel Computing Technologies (PaCT'11), Kazan, Russian Federation, V. Malyshkin (editor), Lecture Notes in Computer Science, Springer Verlag, September 2011, vol. 6873, p. 74-87.

    http://hal.inria.fr/hal-00647775/en
  • 45A. Mostefaoui, M. Raynal, J. Stainer.

    Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems, in: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), Grenoble, France, X. Défago, et al. (editors), Lecture Notes in Computer Science, Springer Verlag, October 2011, vol. 6976, p. 341-355.

    http://hal.inria.fr/hal-00648465/en
  • 46M. Raynal, M. Gradinariu Potop-Butucaru, S. Tixeuil.

    Distributed Computing with Mobile Robots: an Introductory Survey, in: Proc. 14th Int'l Conference on Network-Based Information Systems (NBiS'11), Tirana, Albania, September 2011.

    http://hal.inria.fr/hal-00649294/en
  • 47M. Raynal, S. Rajsbaum.

    A Survey on Some Recent Advances in Shared Memory Models, in: Proc. 18th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'11), Gdansk, Poland, June 2011.

    http://hal.inria.fr/hal-00649297/en
  • 48M. Raynal, S. Rajsbaum.

    A Theory-Oriented Introduction to Wait-free Synchronization Based on the adaptive Renaming Problem, in: IEEE 25th Int'l Conference on Advanced Information Networking and Applications (AINA'11), Singapour, Singapore, March 2011.

    http://hal.inria.fr/hal-00649266/en
  • 49A. Yahyavi, K. Huguenin, B. Kemme.

    AntReckoning: A Pheromone-Based Dead Reckoning Algorithm for Games, in: ACM/IEEE 10th International Workshop on Network and Systems Support for Games (NETGAMES), Ottawa, Canada, October 2011.

    http://hal.inria.fr/inria-00616877/en

Books or Proceedings Editing

  • 50A.-M. Kermarrec, F. Kon (editors)

    ACM/IFIP/USENIX 12th International Middleware Conference, Lecture Notes in Computer Science, Springer, 2011, vol. 7049.

    http://hal.inria.fr/hal-00646605/en

Internal Reports

Other Publications

  • 53A. Boutet, E. Yoneki.

    Member Classification and Party Characteristics in Twitter during UK Election, December 2011, The 1st international workshop on dynamic systems (DYNAM).

    http://hal.inria.fr/hal-00645428/en
  • 54A.-M. Kermarrec, F. Taïani.

    Constellation: Programming decentralised social networks, 2011, 2 pages, to be presented at the 1st International Workshop for Languages for Distributed Algorithms (LADA-2012), Philadelphia, USA, 23-24 January 2012, co-located with POPL 2012: 39th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages.

    http://hal.inria.fr/hal-00646730/en
References in notes
  • 55M. Aguilera.

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

    Local and Global Properties in Networks of Processes., in: Proc. 12th ACM Symposium on Theory of Computing (STOC'80), 1980.
  • 57K. 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, p. 41-88.
  • 58A. 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.
  • 59P. 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.
  • 60L. Lamport.

    Time, clocks, and the ordering of events in distributed systems, in: Communications of the ACM, 1978, vol. 21, no 7.
  • 61M. Merritt, G. Taubenfeld.

    Computing Using Infinitely Many Processes., in: Proc. 14th Int'l Symposium on Distributed Computing (DISC'00), 2000.
  • 62S. 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.
  • 63A. 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.
  • 64I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan.

    Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, in: SIGCOMM'01, 2001.
  • 65S. 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.