EN FR
EN FR


Bibliography

Publications of the year

Articles in International Peer-Reviewed Journals

  • 1M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, S. Toueg.

    Partial synchrony based on set timeliness, in: Distributed Computing, 2012, vol. 25, no 3, p. 249-260.
  • 2L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. M. Thilikos.

    Connected graph searching, in: Inf. Comput., 2012, vol. 219, p. 1-16.
  • 3Y. Boufkhad, T. Hugel.

    Estimating satisfiability, in: Discrete Applied Mathematics, 2012, vol. 160, no 1-2, p. 61-80.
  • 4P. Charbit, M. Habib, N. Trotignon, K. Vušković.

    Detecting 2-joins faster, in: J. Discrete Algorithms, 2012, vol. 17, p. 60–66.

    http://dx.doi.org/10.1016/j.jda.2012.11.003
  • 5V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, Y. Vaxès, Y. Xiang.

    Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs, in: Algorithmica, 2012, vol. 62, no 3-4, p. 713-732.
  • 6C. Delporte-Gallet, H. Fauconnier, H. Tran-The.

    Byzantine agreement with homonyms in synchronous systems, in: Theoretical Computer Science, 2012, no 9129.
  • 7D. Fortin.

    B-spline Toeplitz inverse under corner perturbations, in: IJPAM, 2012, vol. 77, no 1, p. 107–118.
  • 8D. Fortin, I. Tseveendorj.

    Attractive force search algorithm for piecewise convex maximization problems, in: Optim. Lett., 2012, vol. 6, no 7, p. 1317–1333.

    http://dx.doi.org/10.1007/s11590-011-0395-y
  • 9M. Habib, T.-H. To.

    Constructing a Minimum phylogenetic Network from a Dense triplet Set, in: J. Bioinformatics and Computational Biology, 2012, vol. 10, no 5.

International Conferences with Proceedings

  • 10H. Arfaoui, P. Fraigniaud.

    Brief announcement: what can be computed without communication?, in: PODC, 2012, p. 87-88.
  • 11H. Baumann, P. Fraigniaud, H. A. Harutyunyan, R. de Verclos.

    The Worst Case Behavior of Randomized Gossip, in: TAMC, 2012, p. 330-345.
  • 12O. Bournez, P. Fraigniaud, X. Koegler.

    Computing with Large Populations Using Interactions, in: MFCS, 2012, p. 234-246.
  • 13Y. Carlinet, T. D. Huynh, B. Kauffmann, F. Mathieu, L. Noirie, S. Tixeuil.

    Four Months in DailyMotion: Dissecting User Video Requests, in: TRAC 2012 - 3rd International Workshop on TRaffic Analysis and Classification, Limassol, Cyprus, August 2012.

    http://hal.inria.fr/hal-00692095
  • 14C. Delporte-Gallet, H. Fauconnier, E. Gafni, P. Kuznetsov.

    Wait-Freedom with Advice., in: Proceedings of the Thirty First Annual ACM Symposium on Principles of Distributed Computing, PODC 2012, Madeira, Portugal, ACM, July 16-18 2012.
  • 15C. Delporte-Gallet, H. Fauconnier, H. Tran-The.

    Byzantine Agreement with Homonyms in Synchronous Systems, in: Distributed Computing and Networking - 13th International Conference, ICDCN 2012, Hong Kong, China, L. Bononi, A. K. Datta, S. Devismes, A. Misra (editors), Lecture Notes in Computer Science, Springer, January 3-6 2012, vol. 7129, p. 76-90.
  • 16C. Delporte-Gallet, H. Fauconnier, H. Tran-The.

    Homonyms with forgeable identifiers, in: 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer, LNCS, 2012.
  • 17Y. Emek, P. Fraigniaud, A. Korman, S. Kutten, D. Peleg.

    Notions of Connectivity in Overlay Networks, in: Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), 2012, p. 25–35.

    http://dx.doi.org/10.1007/978-3-642-31104-8_3
  • 18O. Feinerman, A. Korman.

    Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012), 2012, p. 61–75.

    http://dx.doi.org/10.1007/978-3-642-33651-5_5
  • 19O. Feinerman, A. Korman, Z. Lotker, J. S. Sereni.

    Collaborative search on the plane without communication, in: Proceedings of the 31st ACM symposium on Principles of distributed computing (PODC 2012), 2012, p. 77–86.

    http://doi.acm.org/10.1145/2332432.2332444
  • 20P. Fraigniaud, A. Korman, M. Parter, D. Peleg.

    Randomized Distributed Decision, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012), 2012, p. 371–385.

    http://dx.doi.org/10.1007/978-3-642-33651-5_26
  • 21P. Fraigniaud, A. Pelc.

    Decidability Classes for Mobile Agents Computing, in: LATIN, 2012, p. 362-374.
  • 22M. Habib, A. Mamcarz, F. de Montgolfier.

    Algorithms for Some H-Join Decompositions, in: LATIN, 2012, p. 446-457.

National Conferences with Proceeding

  • 23F. de Montgolfier, M. Soto, L. Viennot.

    Modularité asymptotique de quelques classes de graphes, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL), La Grande Motte, 2012, p. 1-4.

Internal Reports

  • 24F. Baccelli, F. Mathieu, I. Norros.

    Spatial Interactions of Peers and Performance of File Sharing Systems, Inria, May 2012, no RR-7713, 17 p, Accepted to Infocom 2013.

    http://hal.inria.fr/inria-00615523
  • 25F. Durand, F. Mathieu, L. Noirie.

    On the Manipulability of Voting Systems: Application to Multi-Carrier Networks, LINCS, April 2012, no 2012-04-001, 17 p.

    http://hal.inria.fr/hal-00692096
  • 26N. Hegde, L. Massoulié, L. Viennot.

    Self-Organizing Flows in Social Networks, Inria, 2012, p. 1-17.