EN FR
EN FR




Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 1M. Soto.

    Quelques propriétés topologiques des graphes et applications à Internet et aux réseaux, Paris Diderot, Dec 2011.

Articles in International Peer-Reviewed Journal

  • 2H. Baumann, P. Crescenzi, P. Fraigniaud.

    Parsimonious flooding in dynamic graphs, in: Distributed Computing, 2011, vol. 24, no 1, p. 31-44.
  • 3R. Birke, E. Leonardi, M. Mellia, A. Bakay, T. Szemethy, C. Kiraly, R. Lo Cigno, F. Mathieu, L. Muscariello, S. Niccolini, J. Seedorf, G. Tropea.

    Architecture of a Network-Aware P2P-TV Application: The NAPA-WINE Approach, in: IEEE Communications Magazine, 2011, vol. 49, no 6, p. 154-163.
  • 4Y. Boufkhad, T. Hugel.

    Estimating satisfiability, in: Discrete Applied Mathematics, 2012, vol. 160, no 1-2, p. 61 - 80, à paraitre. [ DOI : 10.1016/j.dam.2011.10.005 ]

    http://www.sciencedirect.com/science/article/pii/S0166218X11003647
  • 5V. Chepoi, F. Dragan, B. Estrellon, M. Habib, Y. Vaxes, Y. Xiang.

    Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs, in: Algorithmica, 2011, vol. on line first.
  • 6C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, A. Tielmann.

    The disagreement power of an adversary, in: Distributed Computing, 2011, vol. 24, no 3-4, p. 137-147.
  • 7C. Delporte-Gallet, H. Fauconnier, S. Toueg.

    The Minimum Information about Failures for Solving non-local Tasks in Message-Passing Systems, in: Distributed Computing, 2011, vol. On line first.
  • 8A. Durand, M. Habib.

    Complexity issues for the sandwich homogeneous set problem, in: Discrete Applied Mathematics, 2011, vol. 159, no 7, p. 574-580.
  • 9Y. Emek, P. Fraigniaud, A. Korman, A. Rosén.

    Online computation with advice, in: Theor. Comput. Sci, 2011, vol. 412, no 24, p. 2642-2656.
  • 10Y. Emek, A. Korman.

    New bounds for the controller problem, in: Journal of Distributed Computing, 2011, vol. 24, no 3-4, p. 177-186.
  • 11D. Fortin.

    Eigenvectors of three term recurrence Toeplitz matrices and Riordan group, in: Int. J. Pure Appl. Math., 2011, vol. 67, no 1, p. 97–105.
  • 12D. Fortin, I. Tseveendorj.

    Attractive force search algorithm for piecewise convex maximization problems, in: Opt. lett. Online First, 15 September 2011, no 145.

    http://www.springerlink.com/content/1862-4472/preprint/?sort=p_OnlineDate&sortorder=asc&o=140
  • 13D. Fortin, I. Tseveendorj.

    Piecewise Convex formulations of binary and permutation problem, in: Siberian Journal of Numerical Mathematics, 2011, vol. 14, no 4, p. 409–423.
  • 14D. Fortin, I. Tseveendorj.

    Piecewise convex maximization problems: piece adding technique, in: J. Optim. Theory Appl., 2011, vol. 148, no 3, p. 471–487.

    http://dx.doi.org/10.1007/s10957-010-9763-5

International Conferences with Proceedings

  • 15J. Clément, C. Delporte-Gallet, H. Fauconnier, M. Sighireanu.

    Guidelines for the Verification of Population Protocols, in: ICDCS, IEEE Computer Society, 2011, p. 215-224.
  • 16P. Crescenzi, R. Grossi, M. Habib, L. Lanzi, A. Marino.

    On Computing the Diameter of Real-World Undirected Graphs, in: Workshop ESA in honor of Giorgio Ausiello, submitted to TCS, 2011.
  • 17C. Delporte-Gallet, H. Fauconnier, E. Gafni, P. Kuznetsov.

    Brief Announcement: On the Meaning of Solving a Task with a Failure Detector, in: DISC, D. Peleg (editor), Lecture Notes in Computer Science, Springer, 2011, vol. 6950, p. 145-146.
  • 18C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, A.-M. Kermarrec, E. Ruppert, H. Tran-The.

    Byzantine agreement with homonyms, in: PODC, San Jose, CA, USA, C. Gavoille, P. Fraigniaud (editors), ACM, June 2011, p. 21-30.
  • 19Y. Emek, A. Korman, Y. Shavitt.

    Approximating the Statistics of various Properties in Randomly Weighted Graphs, in: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), San Francisco, 2011, p. 1455-1467.
  • 20P. Fraigniaud, A. Korman, D. Peleg.

    Local Distributed Decision, in: 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), Palm Springs, 2011.
  • 21P. Fraigniaud, A. Pelc.

    Delays Induce an Exponential Memory Gap for Rendezvous in Trees, in: 10th Latin American Theoretical Informatics Symposium (LATIN), Springer, 2012, à paraitre.
  • 22P. Fraigniaud, S. Rajsbaum, C. Travers.

    Locality and Checkability in Wait-Free Computing, in: 25th International Symposium on Distributed Computing (DISC), LNCS, Springer, 2011, vol. 6950, p. 333-347.
  • 23C. Gavoille, Q. Godfroy, L. Viennot.

    Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners, in: 15th International Conference on Principles of Distributed Systems (OPODIS), Toulouse, 2011, p. 1-16.
  • 24M. Habib, J. Stacho.

    Unique Perfect Phylogeny Is NP-Hard, in: CPM, 2011, p. 132-146.
  • 25M. Habib, T.-H. To.

    On a Conjecture about Compatibility of Multi-states Characters, in: WABI, 2011, p. 116-127.
  • 26L. Kor, A. Korman, D. Peleg.

    Tight Bounds For Distributed MST Verification, in: 28th International Symposium on Theoretical Aspects of Computer Science, (STACS), Dortmund, 2011, p. 69-80.
  • 27A. Korman, S. Kutten, T. Masuzawa.

    Fast and compact self stabilizing verification, computation, and fault detection of an MST, in: 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), San Jose, ACM Press, 2011, p. 311-320.
  • 28A. Korman, J.-S. Sereni, L. Viennot.

    Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge, in: 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), San Jose, 2011, p. 49-58.
  • 29F. Mathieu.

    Live Seeding: Performance Bounds of Seeders for P2P Live Streaming, in: P2P '11: Proceedings of the 2011 Eleventh International Conference on Peer-to-Peer Computing, IEEE Computer Society, 2011, p. 172–181.
  • 30A. D. Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, R. Wattenhofer.

    Distributed verification and hardness of distributed approximation, in: 43rd ACM Symposium on Theory of Computing, (STOC), San Jose, ACM Press, 2011, p. 363-372.
  • 31F. de Montgolfier, M. Soto, L. Viennot.

    Asymptotic Modularity of some Graph Classes, in: 22nd International Symposium on Algorithms and Computation (ISAAC), Yokohama, 2011, p. 435–444.
  • 32F. de Montgolfier, M. Soto, L. Viennot.

    Clustering de métrique et clustering de graphe, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, P. Ducourthial (editor), 2011, Equipe-projet GANG (inria).

    http://hal.inria.fr/inria-00583844/en/
  • 33F. de Montgolfier, M. Soto, L. Viennot.

    Treewidth and Hyperbolicity of the Internet, in: 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA), Boston, 2011, p. 1–8.

National Conferences with Proceeding

  • 34J. Clément, C. Delporte-Gallet, H. Fauconnier, M. Sighireanu.

    Mode d'emploi pour la vérification des protocoles de population, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, P. Ducourthial (editor), 2011.

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

Scientific Books (or Scientific Book chapters)

  • 352011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011.
  • 36D. Peleg (editor)

    Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings, Lecture Notes in Computer Science, Springer, 2011, vol. 6950.

Books or Proceedings Editing

  • 37C. Gavoille, P. Fraigniaud (editors)

    Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, ACM, San Jose, CA, USA, June 2011.

Internal Reports

Scientific Popularization

  • 41C. Delporte-Gallet, H. Fauconnier.

    Objets partagés et détecteurs de défaillances, in: Technique et Science Informatiques, 2011, vol. 30/7, p. 841-871.