Project-Team Gang
Members
Overall Objectives
Research Program
Application Domains
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub

previous Previous | up Home

Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 2P. Crescenzi, R. Grossi, H. Michel, L. Lanzi, A. Marino.
    On computing the diameter of real-world undirected graphs, in: Theoretical Computer Science, 2013, vol. 514, pp. 84-95. [ DOI : 10.1016/j.tcs.2012.09.018 ]
    http://hal.inria.fr/hal-00936304
  • 3C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, A.-M. Kermarrec, E. Ruppert, H. Tran-The.
    Byzantine agreement with homonyms, in: Distributed Computing, 2013, vol. 26, no 5-6, pp. 321-340. [ DOI : 10.1007/s00446-013-0190-3 ]
    http://hal.inria.fr/hal-00839625
  • 4C. Delporte-Gallet, H. Fauconnier, H. Tran-The.
    Byzantine agreement with homonyms in synchronous systems, in: Theoretical Computer Science, 2013, vol. 496, pp. 34-49. [ DOI : 10.1016/j.tcs.2012.11.012 ]
    http://hal.inria.fr/hal-00922415
  • 5C. Derek, B. Dalton, H. Michel.
    LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs, in: SIAM Journal on Computing, 2013, vol. 42, no 3, pp. 792-807. [ DOI : 10.1137/11083856X ]
    http://hal.inria.fr/hal-00936300
  • 6P. Fraigniaud.
    Special issue with selected papers from PODC 2011, in: Distributed Computing, 2013, vol. 26, no 5-6, 271 p.
    http://hal.inria.fr/hal-00922692
  • 7P. Fraigniaud, A. Korman, D. Peleg.
    Local Distributed Decision, in: Journal of the ACM, 2013, 35 p.
    http://hal.inria.fr/hal-00912561
  • 8P. Fraigniaud, A. Pelc.
    Delays Induce an Exponential Memory Gap for Rendezvous in Trees, in: ACM Transactions on Algorithms, 2013, vol. 9, no 2, 17 p.
    http://hal.inria.fr/hal-00922693
  • 9P. Fraigniaud, S. Rajsbaum, C. Travers.
    Locality and checkability in wait-free computing, in: Distributed Computing, 2013, vol. 26, no 4, pp. 223-242.
    http://hal.inria.fr/hal-00922691
  • 10M. Habib, A. Mamcarz, F. De Montgolfier.
    Computing H-Joins with Application to 2-Modular Decomposition, in: Algorithmica, September 2013, 22 p. [ DOI : 10.1007/s00453-013-9820-1 ]
    http://hal.inria.fr/hal-00921775
  • 11A. Korman, J.-S. Sereni, L. Viennot.
    Toward more localized local algorithms: removing assumptions concerning global knowledge, in: Distributed Computing, 2013, vol. 26, no 5-6, pp. 289-308.
    http://hal.inria.fr/hal-00909713
  • 12A. Korman, K. Shay.
    Controller and estimator for dynamic networks, in: Information and Computation, 2013, vol. 223, pp. 43-66. [ DOI : 10.1016/j.ic.2012.10.018 ]
    http://hal.inria.fr/hal-00912550

International Conferences with Proceedings

  • 13E. Andrea, P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi, A. Panconesi, F. Pasquale, R. Silvestri.
    Rumor Spreading in Random Evolving Graphs, in: ESA, France, 2013, pp. 325-336.
    http://hal.inria.fr/hal-00922696
  • 14F. Baccelli, F. Mathieu, I. Norros, R. Varloot.
    Can P2P Networks be Super-Scalable?, in: IEEE Infocom 2013 - 32nd IEEE International Conference on Computer Communications, Turin, Italy, 2013.
    http://hal.inria.fr/hal-00817069
  • 15Y. Carlinet, T. D. Huynh, B. Kauffmann, F. Mathieu, L. Noirie, S. Tixeuil.
    Contenu généré par les utilisateurs : une étude sur DailyMotion, in: 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, N. Nisse, F. Rousseau, Y. Busnel (editors), 2013, pp. 1-4.
    http://hal.inria.fr/hal-00818606
  • 16C. Delporte-Gallet, H. Fauconnier, E. Gafni, L. Lamport.
    Adaptive Register Allocation with a Linear Number of Registers, in: DISC 2013 - 27th International Symposium Distributed Computing, Jerusalem, Israel, Y. Afek (editor), Lecture Notes in Computer Science, Springer, 2013, vol. 8205, pp. 269-283. [ DOI : 10.1007/978-3-642-41527-2_19 ]
    http://hal.inria.fr/hal-00922425
  • 17C. Delporte-Gallet, H. Fauconnier, E. Gafni, S. Rajsbaum.
    Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|, in: NETYS 2013 - First International Conference Networked Systems, Marrakech, Morocco, V. Gramoli, R. Guerraoui (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7853, pp. 28-41. [ DOI : 10.1007/978-3-642-40148-0_3 ]
    http://hal.inria.fr/hal-00922423
  • 18C. Delporte-Gallet, H. Fauconnier, E. Gafni, S. Rajsbaum.
    Linear Space Bootstrap Communication Schemes, in: ICDCN 2013 - 14th International Conference Distributed Computing and Networking, Mumbi, India, D. Frey, M. Raynal, S. Sarkar, R. K. Shyamasundar, P. Sinha (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7730, pp. 363-377. [ DOI : 10.1007/978-3-642-35668-1_25 ]
    http://hal.inria.fr/hal-00922420
  • 19C. Delporte-Gallet, H. Fauconnier, H. Tran-The.
    Uniform Consensus with Homonyms and Omission Failures, in: ICDCN 2013 - 14th International Conference Distributed Computing and Networking, Mumbai, India, D. Frey, M. Raynal, S. Sarkar, R. K. Shyamasundar, P. Sinha (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7730, pp. 161-175. [ DOI : 10.1007/978-3-642-35668-1_12 ]
    http://hal.inria.fr/hal-00922428
  • 20F. Durand, F. Mathieu, L. Noirie.
    On the Manipulability of Voting Systems: Application to Multi-Operator Networks, in: 8th International Workshop on Internet Charging and QoS Technologies (ICQT 2013, collocated with the 9th International Conference on Network and Service Management CNSM 2013), Zurich, Switzerland, October 2013, pp. 292-297.
    http://hal.inria.fr/hal-00874096
  • 21P. Fraigniaud, M. Göös, A. Korman, J. Suomela.
    What can be decided locally without identifiers?, in: PODC'13 - ACM Symposium on Principles of Distributed Computing, Montreal, Canada, ACM, 2013, pp. 157-165. [ DOI : 10.1145/2484239.2484264 ]
    http://hal.inria.fr/hal-00912527
  • 22P. Fraigniaud, M. Göös, A. Korman, J. Suomela.
    What can be decided locally without identifiers?, in: PODC, France, 2013, pp. 157-165.
    http://hal.inria.fr/hal-00922698
  • 23P. Fraigniaud, M. Magnús, B. Patt-Shamir, D. Rawitz, A. Rosén.
    Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems, in: APPROX-RANDOM, France, 2013, pp. 158-172.
    http://hal.inria.fr/hal-00922695
  • 24N. Hegde, L. Massoulié, L. Viennot.
    Self-organizing Flows in Social Networks, in: Structural Information AND Communication Complexity - 20th International Colloquium, SIROCCO, Ischia, Italy, Springer, 2013, vol. 8179, pp. 116-128.
    http://hal.inria.fr/hal-00909718

Internal Reports

  • 25D. Hong, F. Mathieu, G. Burnside.
    Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme, January 2013, 9 p.
    http://hal.inria.fr/hal-00776084
  • 26A. Rousseau, A. Darnaud, B. Goglin, C. Acharian, C. Leininger, C. Godin, C. Holik, C. Kirchner, D. Rives, E. Darquie, E. Kerrien, F. Neyret, F. Masseglia, F. Dufour, G. Berry, G. Dowek, H. Robak, H. Xypas, I. Illina, I. Gnaedig, J. Jongwane, J. Ehrel, L. Viennot, L. Guion, L. Calderan, L. Kovacic, M. Collin, M.-A. Enard, M.-H. Comte, M. Quinson, M. Olivi, M. Giraud, M. Dorémus, M. Ogouchi, M. Droin, N. Lacaux, N. Rougier, N. Roussel, P. Guitton, P. Peterlongo, R.-M. Cornus, S. Vandermeersch, S. Maheo, S. Lefebvre, S. Boldo, T. Viéville, V. Poirel, A. Chabreuil, A. Fischer, C. Farge, C. Vadel, I. Astic, J.-P. Dumont, L. Féjoz, P. Rambert, P. Paradinas, S. De Quatrebarbes, S. Laurent.
    Médiation Scientifique : une facette de nos métiers de la recherche, March 2013, 34 p.
    http://hal.inria.fr/hal-00804915

Other Publications

References in notes

previous Previous | up Home