Bibliography

• 1O. Beaumont, H. Rejeb.
  
  On the Importance of Bandwidth Control Mechanisms for Scheduling on Large Scale Heterogeneous Platforms, in: 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, United States, April 2010.
  
  http://hal.inria.fr/inria-00444585/en
• 2N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.
  
  Plane Spanners of Maximum Degree Six, in: Automata, Languages and Programming 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I, France, 2010, vol. 6198, p. 19-30. [ DOI : 10.1007/978-3-642-14165-2_3 ]
  
  http://hal.archives-ouvertes.fr/hal-00534212/en/
• 3C. Cooper, D. Ilcinkas, R. Klasing, A. Kosowski.
  
  Derandomizing random walks in undirected graphs using locally fair exploration strategies, in: Distributed Computing, 2011, vol. 24, n^o 2, p. 91-99, See paper for details. [ DOI : 10.1007/s00446-011-0138-4 ]
  
  http://hal.archives-ouvertes.fr/hal-00638229/en/
• 4J. Czyzowicz, A. Kosowski, A. Pelc.
  
  How to meet when you forget: log-space rendezvous in arbitrary graphs, in: 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2010, p. 450-459.
• 5P. Duchon, N. Hanusse, E. Lebhar.
  
  Towards small world emergence, in: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, ACM Press New York, NY, USA, 2006, p. 225–232.
• 6P. Duchon, N. Hanusse, N. Saheb, A. Zemmari.
  
  Broadcast in the rendezvous model, in: Information and Computation, 2006, vol. 204, n^o 5, p. 697–712.
• 7L. Eyraud-Dubois, G. Mounié, D. Trystram.
  
  Analysis of Scheduling Algorithms with Reservations, in: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, Long Beach, California, USA, IEEE, 2007, p. 1-8.
  
  http://dx.doi.org/10.1109/IPDPS.2007.370304
• 8P. Flocchini, D. Ilcinkas, N. Santoro.
  
  Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens, in: Proceedings of the 22nd International Symposium on Distributed Computing, France, G. Taubenfeld (editor), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, September 2008, vol. 5218, p. 227-241, This work was done during the stay of David Ilcinkas at the University of Ottawa, as a postdoctoral fellow. Paola Flocchini was partially supported by the University Research Chair of the University of Ottawa. This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Discovery grants. [ DOI : 10.1007/978-3-540-87779-0_16 ]
  
  http://hal.archives-ouvertes.fr/hal-00341523/en/
• 9P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc.
  
  Distributed Computing with Advice: Information Sensitivity of Graph Coloring, in: ICALP, 2007, p. 231-242.
• 10P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, Z. Lotker.
  
  Universal augmentation schemes for network navigability: overcoming the $\sqrt{n}$-barrier, in: Proceedings of the nineteenth annual ACM symposium on parallelism and architectures, San Diego, California, États-Unis, ACM, 2007, p. 1-7, COST Action 295 "Dynamo", ACI project "Fragile", INRIA project "Grand Large".
  
  http://hal.archives-ouvertes.fr/hal-00155186/en/
• 11E. Garnaud, S. Maabout, M. Mosbah.
  
  Using Functional Dependencies for Reducing the Size of a Data Cube, in: Proceedings of the 7th Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS), LNCS, Springer, 2012, 20 p.
• 12L. Gasieniec, R. Klasing, M. Russell, A. Navarra, X. Zhang.
  
  Fast Periodic Graph Exploration with Constant Memory, in: Journal of Computer and System Sciences, 2008, vol. 74, n^o 5, p. 808–822. [ DOI : 10.1016/j.jcss.2007.09.004 ]
  
  http://hal.archives-ouvertes.fr/hal-00306995/en/
• 13J. Hromkovič, P. Kanarek, R. Klasing, K. Lorys, W. Unger, H. Wagener.
  
  On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks, in: SIAM Journal on Discrete Mathematics, 2009, vol. 23, n^o 3, p. 1612–1645.
  
  http://hal.archives-ouvertes.fr/hal-00402764/en/

Doctoral Dissertations and Habilitation Theses

• 14E. Diot.
  
  Etude des graphes k chemins séparables, Université Sciences et Technologies - Bordeaux I, December 2011.
• 15H. Rejeb.
  
  Étude des problèmes d'ordonnancement sur des plates-formes hétérogènes en modèle multi-port, Université Sciences et Technologies - Bordeaux I, August 2011.
  
  http://hal.inria.fr/tel-00651988/en

Articles in International Peer-Reviewed Journal

• 16C. Cooper, D. Ilcinkas, R. Klasing, A. Kosowski.
  
  Derandomizing random walks in undirected graphs using locally fair exploration strategies, in: Distributed Computing, 2011, vol. 24, n^o 2, p. 91-99. [ DOI : 10.1007/s00446-011-0138-4 ]
  
  http://hal.inria.fr/hal-00638229/en
• 17B. Courcelle, C. Gavoille, M. M. Kanté.
  
  Compact Labelings For Efficient First-Order Model-Checking, in: Journal of Combinatorial Optimization, January 2011, vol. 21, n^o 1, p. 19–46.
  
  http://hal.inria.fr/hal-00342668/en
• 18J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
  
  Asynchronous deterministic rendezvous in bounded terrains, in: Theoretical Computer Science, November 2011, vol. 412, n^o 50, p. 6926-6937. [ DOI : 10.1016/j.tcs.2011.09.002 ]
  
  http://hal.inria.fr/hal-00643686/en
• 19Y. Dieng, C. Gavoille.
  
  Routage compact optimal dans les $(k,r)$-constellations, in: Technique et Science Informatiques (TSI), May 2011, vol. 30, n^o 05/2011, p. 485-513. [ DOI : 10.3166/TSI.30.485-513 ]
  
  http://hal.inria.fr/hal-00651841/en
• 20P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
  
  How many oblivious robots can explore a line, in: Information Processing Letters, October 2011, vol. 111, n^o 20, p. 1027-1031. [ DOI : 10.1016/j.ipl.2011.07.018 ]
  
  http://hal.inria.fr/hal-00643668/en
• 21A. Kosowski, A. Navarra, C. Pinotti.
  
  Synchronous Black Hole Search in Directed Graphs, in: Theoretical Computer Science, June 2011, vol. 412, n^o 41, p. 5752-5759. [ DOI : 10.1016/j.tcs.2011.05.054 ]
  
  http://hal.inria.fr/inria-00614476/en
• 22J.-F. Marckert, N. Bonichon.
  
  Asymptotics of geometrical navigation on a random set of points of the plane, in: Advances in Applied Probability, 2011, vol. 43, p. 1–44.
  
  http://hal.inria.fr/hal-00649901/en

Invited Conferences

• 23C. Gavoille.
  
  Dynamic Algorithms via Forbidden-Set Labeling, in: First International Workshop on Dynamic Systems (DYNAM), LASS, Toulouse, France, December 2011.
  
  http://hal.inria.fr/hal-00656916/en
• 24C. Gavoille.
  
  Oracles pour les arbres et les graphes, in: 10 ans du séminaire MaMux - Mathématiques, musique et relations avec d'autres disciplines, IRCAM, Paris, France, May 2011.
  
  http://hal.inria.fr/hal-00651845/en

International Conferences with Proceedings

• 25I. Abraham, C. Gavoille.
  
  On approximate distance labels and routing schemes with affine stretch, in: 25th International Symposium on Distributed Computing (DISC), Rome, Italy, Lecture Notes in Computer Science (ARCoSS), Springer, 2011, vol. 6950, p. 404-415. [ DOI : 10.1007/978-3-642-24100-0_39 ]
  
  http://hal.inria.fr/hal-00651833/en
• 26I. Atsonios, O. Beaumont, N. Hanusse, Y. Kim.
  
  On Power-Law Distributed Balls in Bins and its Applications to View Size Estimation, in: ISAAC, Yokohama, Japan, December 2011.
  
  http://hal.inria.fr/inria-00618785/en
• 27E. Bampas, D. Bilò, G. Drovandi, L. Gualà, R. Klasing, G. Proietti.
  
  Network Verification via Routing Table Queries, in: SIROCCO 2011, Poland, Lecture Notes in Computer Science, 2011, vol. 6796, p. 270–281. [ DOI : 10.1007/978-3-642-22212-2_24 ]
  
  http://hal.inria.fr/hal-00647362/en
• 28O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.
  
  Use of Internet Embedding Tools for Heterogeneous Resources Aggregation, in: Heterogeneity in Computing Workshop, Anchorage, United States, 2011, 10 p.
  
  http://hal.inria.fr/inria-00562655/en
• 29O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.
  
  Use of Internet Embedding Tools for Heterogeneous Resources Aggregation, in: Heterogeneity in Computing Workshop (HCW) – in IPDPS 2011, Anchorage, United States, IEEE, 2011.
  
  http://hal.inria.fr/inria-00588650/en
• 30O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.
  
  Utilisation d'outils de plongement d'Internet pour l'agrégation de ressources hétérogènes, in: Conférence : 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.
  
  http://hal.inria.fr/inria-00585254/en
• 31O. Beaumont, N. Bonichon, L. Eyraud-Dubois, L. Marchal.
  
  Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling, in: IPDPS 2012, 26th IEEE International Parallel & Distributed Processing Symposium, Shangai, China, IEEE, 2012.
  
  http://hal.inria.fr/inria-00564056/en
• 32O. Beaumont, N. Bonichon, L. Eyraud-Dubois, P. Uznanski.
  
  Broadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the Bounded Multi-Port Model, in: ICPADS 2011 – 17th Internation Conference on Parallel and Distributed Systems, Taïnan, Taiwan, Province Of China, IEEE, December 2011, vol. Proceeding of ICPADS 2011.
  
  http://hal.inria.fr/inria-00618784/en
• 33O. Beaumont, N. Bonichon, H. Larchevêque.
  
  Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks, in: Internation Conference on Parallel Computing 2011, Taipei, Taiwan, Province Of China, March 2011, 10 p.
  
  http://hal.inria.fr/inria-00580969/en
• 34O. Beaumont, L. Eyraud-Dubois, Y. Won.
  
  Using the Last-mile Model as a Distributed Scheme for Available Bandwidth Prediction, in: EuroPar 2011, Bordeaux, France, Springer, 2011.
  
  http://hal.inria.fr/inria-00588651/en
• 35A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, M. Russell.
  
  Synchronous Rendezvous for Location-Aware Agents, in: DISC 2011 - 25th International Symposium on Distributed Computing, Rome, Italy, D. Peleg (editor), Lecture Notes in Computer Science, Springer, September 2011, vol. 6950, p. 447-459. [ DOI : 10.1007/978-3-642-24100-0_42 ]
  
  http://hal.inria.fr/hal-00646907/en
• 36J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis.
  
  Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds, in: ESA 2011 - 19th Annual European Symposium on Algorithms, Saarbruecken, Germany, C. Demetrescu, M. M. Halldórsson (editors), Lecture Notes in Computer Science, Springer, September 2011, vol. 6942, p. 701-712. [ DOI : 10.1007/978-3-642-23719-5_59 ]
  
  http://hal.inria.fr/hal-00646910/en
• 37E. Diot, C. Gavoille, P. Ochem.
  
  Sur la difficulté de séparer un graphe par des plus courts chemins, in: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France, B. Ducourthial, P. Felber (editors), 2011.
  
  http://hal.inria.fr/inria-00588312/en
• 38P. Duchon.
  
  Random generation of combinatorial structures: Boltzmann samplers and beyond, in: Winter Simulation Conference, Phoenix, United States, S. Jain, R. Creasey, J. Himmelspach, K. White, M. Fu (editors), December 2011.
  
  http://hal.inria.fr/hal-00654267/en
• 39C. Gavoille, S. Chrisitan.
  
  Sparse Spanners vs. Compact Routing, in: 23rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Jose, United States, ACM, June 2011, p. 225-234. [ DOI : 10.1145/1989493.1989526 ]
  
  http://hal.inria.fr/hal-00651836/en
• 40C. 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), France, Lecture Notes in Computer Science, Springer, 2011, vol. 7109, p. 143-158.
  
  http://hal.inria.fr/hal-00651825/en
• 41C. Glacet, N. Hanusse, D. Ilcinkas.
  
  The Impact of Edge Deletions on the Number of Errors in Networks, in: OPODIS 2011, Toulouse, France, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2011, vol. 7109, p. 378-391. [ DOI : 10.1007/978-3-642-25873-2_26 ]
  
  http://hal.inria.fr/hal-00652051/en
• 42N. Hanusse, S. Maabout.
  
  A parallel algorithm for computing borders, in: CIKM, France, November 2011, p. 1639-1648.
  
  http://hal.inria.fr/hal-00652055/en
• 43N. Hanusse, S. Maabout.
  
  A parallel Algorithm for Computing Borders, in: International Conference on Information and Knowledge Managment (CIKM), Glasgow, United Kingdom, ACM, October 2011, p. 1639-1648.
  
  http://hal.inria.fr/hal-00644517/en
• 44N. Hanusse, S. Maabout.
  
  Revisiting the Partial Data Cube Materialization, in: ADBIS, Austria, 2011, p. 70-83.
  
  http://hal.inria.fr/hal-00652059/en
• 45N. Hanusse, S. Maabout, R. Tofan.
  
  Revisiting the Partial Data Cube Materialization, in: Conference on Advances in Data Bases and Information Systems (ADBIS), Vienne, Austria, LNCS, Springer, September 2011, p. 70-83.
  
  http://hal.inria.fr/hal-00644526/en
• 46D. Ilcinkas, A. Wade.
  
  On the Power of Waiting when Exploring Public Transportation Systems, in: OPODIS 2011, Toulouse, France, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2011, vol. 7109, p. 451-464. [ DOI : 10.1007/978-3-642-25873-2_31 ]
  
  http://hal.inria.fr/hal-00656607/en

Scientific Books (or Scientific Book chapters)

• 47N. Bonichon, C. Gavoille, N. Hanusse.
  
  An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps, in: Towards an Information Theory of Complex Networks, M. Dehmer, F. Emmert-Streib, A. Mehler (editors), Birkhäuser Boston, 2011, p. 17-46.
  
  http://hal.inria.fr/hal-00649898/en

Books or Proceedings Editing

• 48A. Kosowski, M. Yamashita (editors)
  
  Structural Information and Communication Complexity. 18th International Colloquium, SIROCCO 2011, Gdańsk, Poland, June 26-29, 2011, Lecture Notes in Computer Science, Springer, June 2011, vol. 6796. [ DOI : 10.1007/978-3-642-22212-2 ]
  
  http://hal.inria.fr/hal-00646905/en

Internal Reports

• 49O. Beaumont, L. Bobelin, H. Casanova, P.-N. Clauss, B. Donassolo, L. Eyraud-Dubois, S. Genaud, S. Hunold, A. Legrand, M. Quinson, C. Rosa, L. Schnorr, M. Stillwell, F. Suter, C. Thiery, P. Velho, J.-M. Vincent, Y. Won.
  
  Towards Scalable, Accurate, and Usable Simulations of Distributed Applications and Systems, INRIA, October 2011, n^o RR-7761.
  
  http://hal.inria.fr/inria-00631141/en
• 50A. Benoit, H. Larchevêque, P. Renaud-Goud.
  
  Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks, INRIA, September 2011, n^o RR-7750.
  
  http://hal.inria.fr/inria-00630292/en
• 51J. Czyzowicz, A. Kosowski, A. Pelc.
  
  Time vs. space trade-offs for rendezvous in trees, INRIA, December 2011.
  
  http://hal.inria.fr/hal-00646912/en
• 52B. Florent, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan.
  
  Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power, INRIA, 2011, n^o RR-7746.
  
  http://hal.inria.fr/inria-00627910/en
• 53C. Gavoille, Q. Godfroy, L. Viennot.
  
  Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners, INRIA, September 2011, 15 pages.
  
  http://hal.inria.fr/hal-00622915/en

Other Publications

• 54J.-C. Aval, P. Duchon.
  
  Half-turn symmetric FPLs with rare couplings and tilings of hexagons, 2011.
  
  http://hal.inria.fr/hal-00618319/en
• 55J.-C. Bermond, R. Klasing, N. Morales, S. Pérennes, P. Reyes.
  
  Gathering radio messages in the path, 2011.
  
  http://hal.inria.fr/hal-00618974/en

• 56B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, M. Bowman.
  
  PlanetLab: an overlay testbed for broad-coverage services, in: ACM SIGCOMM Comput. Commun. Rev., July 2003, vol. 33, p. 3–12.
  
  http://doi.acm.org/10.1145/956993.956995
• 57F. Dabek, R. Cox, F. Kaashoek, R. Morris.
  
  Vivaldi: a decentralized network coordinate system, in: SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, New York, NY, USA, ACM, 2004, p. 15–26.
  
  http://doi.acm.org/10.1145/1015467.1015471
• 58P. Flocchini, B. Mans, N. Santoro.
  
  Exploration of Periodically Varying Graphs, in: ISAAC, 2009, p. 534-543.
• 59C. Gavoille, D. Peleg, S. Pérennes, R. Raz.
  
  Distance labeling in graphs, in: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 2001, 219 p.
• 60A. Legrand, F. Mazoit, M. Quinson.
  
  An Application-level network mapper, LIP, ENS Lyon, France, feb 2003, n^o RR-2003-09.
• 61Y. Mao, L. Saul, J. Smith.
  
  IDES: An Internet Distance Estimation Service for Large Networks, in: IEEE JSAC, Dec. 2006, vol. 24, n^o 12, p. 2273 -2284.
• 62V. Ramasubramanian, D. Malkhi, F. Kuhn, M. Balakrishnan, A. Gupta, A. Akella.
  
  On the treeness of internet latency and bandwidth, in: SIGMETRICS '09: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, New York, NY, USA, ACM, 2009, p. 61–72.