Bibliography

Major publications by the team in recent years

• 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, pp. 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, pp. 91-99. [ 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, pp. 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, pp. 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, pp. 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, pp. 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, pp. 227-241. [ 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, pp. 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, pp. 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, pp. 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, pp. 1612–1645.
  http://hal.archives-ouvertes.fr/hal-00402764/en/

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 14N. Bonichon.
  Quelques algorithmes entre le monde des graphes et les nuages de points, Université Sciences et Technologies - Bordeaux I, April 2013, Habilitation à Diriger des Recherches.
  http://hal.inria.fr/tel-00922501
• 15A. Kosowski.
  Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network, Université Sciences et Technologies - Bordeaux I, September 2013, Habilitation à Diriger des Recherches.
  http://hal.inria.fr/tel-00867765
• 16P. Uznanski.
  Large scale platform : Instantiable models and algorithmic design of communication schemes, Université Sciences et Technologies - Bordeaux I, October 2013.
  http://hal.inria.fr/tel-00878837

Articles in International Peer-Reviewed Journals

• 17O. Beaumont, N. Bonichon, L. Eyraud-Dubois, P. Uznanski.
  Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model, in: IEEE Transactions on Parallel and Distributed Systems, 2013.
  http://hal.inria.fr/hal-00861830
• 18A. Benoit, R. Melhem, P. Renaud-Goud, Y. Robert.
  Assessing the performance of energy-aware mappings, in: Parallel Processing Letters, 2013, vol. 23, n^o 2. [ DOI : 10.1142/S0129626413400033 ]
  http://hal.inria.fr/hal-00926105
• 19J.-C. Bermond, R. Klasing, N. Morales, S. Pérennes, P. Reyes.
  Gathering radio messages in the path, in: Discrete Mathematics, Algorithms and Applications, March 2013, vol. 5, n^o 1, pp. 1-28. [ DOI : 10.1142/S1793830913500043 ]
  http://hal.inria.fr/hal-00907494
• 20O. Bodini, A. Jacquot, P. Duchon, L. R. Mutafchiev.
  Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes, in: Discrete Applied Mathematics, June 2013, pp. 1-23.
  http://hal.inria.fr/hal-00832016
• 21J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
  Worst-case optimal exploration of terrains with obstacles, in: Information and Computation, April 2013, vol. 225, pp. 16-28. [ DOI : 10.1016/j.ic.2013.02.001 ]
  http://hal.inria.fr/hal-00863496
• 22J. Czyzowicz, A. Kosowski, A. Pelc.
  Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains, in: Theory of Computing Systems, 2013, vol. 52, n^o 2, pp. 179-199. [ DOI : 10.1007/s00224-011-9379-7 ]
  http://hal.inria.fr/hal-00940803
• 23J. Czyzowicz, A. Kosowski, A. Pelc.
  Time vs. space trade-offs for rendezvous in trees, in: Distributed Computing, December 2013. [ DOI : 10.1007/s00446-013-0201-4 ]
  http://hal.inria.fr/hal-00646912
• 24P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
  Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots, in: Algorithmica, March 2013, vol. 65, n^o 3, pp. 562-583. [ DOI : 10.1007/s00453-011-9611-5 ]
  http://hal.inria.fr/hal-00912499
• 25E. Garnaud, S. Maabout, M. Mosbah.
  Functional dependencies are helpful for partial materialization of data cubes, in: Annals of Mathematics and Artificial Intelligence, August 2013, pp. 1-20. [ DOI : 10.1007/s10472-013-9375-5 ]
  http://hal.inria.fr/hal-00940776
• 26A. Kosowski, A. Navarra, D. Pajak, C. Pinotti.
  Maximum matching in multi-interface networks, in: Theoretical Computer Science, 2013, vol. 507, pp. 52-60. [ DOI : 10.1016/j.tcs.2013.01.018 ]
  http://hal.inria.fr/hal-00940802
• 27C. Ordonez, S. Maabout, D. S. Matusevich, W. Cabrera.
  Extending ER models to capture database transformations to build data sets for data mining, in: Data and Knowledge Engineering, December 2013, vol. 89, pp. 38-54. [ DOI : 10.1016/j.datak.2013.11.002 ]
  http://hal.inria.fr/hal-00940778

International Conferences with Proceedings

• 28G. Aupy, A. Benoit, R. Melhem, P. Renaud-Goud, Y. Robert.
  Energy-aware checkpointing of divisible tasks with soft or hard deadlines, in: IGCC - 4th International Green Computing Conference - 2013, Arlington, United States, February 2013.
  http://hal.inria.fr/hal-00857244
• 29O. Beaumont, P. Duchon, P. Renaud-Goud.
  Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints, in: HIgh Performance Computing, Bengalore, India, February 2013, 20 p.
  http://hal.inria.fr/hal-00788964
• 30O. Beaumont, L. Eyraud-Dubois, H. Larchevêque.
  Reliable Service Allocation in Clouds, in: IPDPS - 27th IEEE International Parallel & Distributed Processing Symposium, Boston, United States, 2013. [ DOI : 10.1109/IPDPS.2013.64 ]
  http://hal.inria.fr/hal-00743524
• 31O. Beaumont, L. Eyraud-Dubois, P. Pesneau, P. Renaud-Goud.
  Reliable Service Allocation in Clouds with Memory and Capacity Constraints, in: Resilience 2013, in conjunction with EuroPar 2013, Aachen, Germany, September 2013.
  http://hal.inria.fr/hal-00850125
• 32O. Beaumont, H. Larchevêque, L. Marchal.
  Non Linear Divisible Loads: There is No Free Lunch, in: IPDPS 2013, 27th IEEE International Parallel & Distributed Processing Symposium, Boston, United States, IEEE, 2013.
  http://hal.inria.fr/hal-00771640
• 33A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis, D. Krizanc, R. Martin, O. Morales Ponce.
  Optimal Patrolling of Fragmented Boundaries, in: SPAA - 25th Symposium on Parallelism in Algorithms and Architectures, Montreal, Canada, ACM, 2013, pp. 241-250. [ DOI : 10.1145/2486159.2486176 ]
  http://hal.inria.fr/hal-00686270
• 34J. Czyzowicz, D. Dereniowski, L. Gasieniec, R. Klasing, A. Kosowski, D. Pajak.
  Collision-Free Network Exploration, in: Proceedings of the 11th Latin American Theoretical Informatics Symposium (LATIN 2014), Uruguay, Lecture Notes in Computer Science, March 2014, vol. 8392, pp. 342-354.
  http://hal.inria.fr/hal-00927151
• 35D. Dereniowski, Y. Disser, A. Kosowski, D. Pajak, P. Uznanski.
  Fast Collaborative Graph Exploration, in: ICALP - 40th International Colloquium on Automata, Languages and Programming, Riga, Latvia, Lecture Notes in Computer Science, Springer, 2013, vol. 7966, pp. 520-532. [ DOI : 10.1007/978-3-642-39212-2_46 ]
  http://hal.inria.fr/hal-00802308
• 36D. Dereniowski, Y. Disser, A. Kosowski, D. Pajak, P. Uznanski.
  Fast Collaborative Graph Exploration, in: 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), France, N. Nisse, F. Rousseau, Y. Busnel (editors), May 2013, pp. 1-4.
  http://hal.inria.fr/hal-00818451
• 37L. Eyraud-Dubois, H. Larchevêque.
  Optimizing Resource allocation while handling SLA violations in Cloud Computing platforms, in: IPDPS - 27th IEEE International Parallel & Distributed Processing Symposium, Boston, United States, 2013. [ DOI : 10.1109/IPDPS.2013.67 ]
  http://hal.inria.fr/hal-00772846
• 38C. Gavoille, C. Glacet, N. Hanusse, D. Ilcinkas.
  On the Communication Complexity of Distributed Name-Independent Routing Schemes, in: DISC 2013, Jérusalem, Israel, LNCS, 2013, vol. 8205, pp. 418-432.
  http://hal.inria.fr/hal-00851217
• 39D. Ilcinkas, A. Wade.
  Exploration des graphes dynamiques $T$-intervalle-connexes : le cas de l'anneau, 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. 73-76.
  http://hal.inria.fr/hal-00818450
• 40D. Ilcinkas, A. Wade.
  Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring, in: SIROCCO 2013, Ischia, Italy, LNCS, 2013, to appear.
  http://hal.inria.fr/hal-00847771
• 41R. Klasing.
  Efficient Exploration of Anonymous Undirected Graphs, in: Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Rouen, France, Lecture Notes in Computer Science, Springer, July 2013, vol. 8288, pp. 7-13. [ DOI : 10.1007/978-3-642-45278-9_2 ]
  http://hal.inria.fr/hal-00927154
• 42R. Klasing, A. Kosowski, D. Pajak, T. Sauerwald.
  The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks, in: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2013), Montréal, Canada, ACM, July 2013, pp. 365-374. [ DOI : 10.1145/2484239.2484260 ]
  http://hal.inria.fr/hal-00927152
• 43A. Kosowski.
  A $tildeO\left(n⌃2\right)$ Time-Space Trade-off for Undirected s-t Connectivity, in: SODA - 24th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, SIAM, January 2013, pp. 1873-1883, Version 3 makes use of the Metropolis-Hastings walk.
  http://hal.inria.fr/hal-00685373
• 44A. Kosowski, P. Uznanski.
  Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice, in: Euro-Par - 19th International Conference on Parallel Processing, Aachen, Germany, Lecture Notes in Computer Science, Springer, August 2013, vol. 8097, pp. 671-683. [ DOI : 10.1007/978-3-642-40047-6_67 ]
  http://hal.inria.fr/hal-00737611

National Conferences with Proceedings

• 45L. Eyraud-Dubois, A. Lèbre, P. Martineau, A. Soukhal, V. T'Kindt, D. Trystram.
  A Server Consolidation Problem: Definition and Model, in: Proceedings of the 14th conference ROADEF, Troyes, France, 2013.
  http://hal.inria.fr/hal-00921363
• 46E. Garnaud, N. Hanusse, S. Maabout, N. Novelli.
  Calcul parallèle de dépendances, in: Bases de Données Avancées, Nantes, France, October 2013, pp. 1-20.
  http://hal.inria.fr/hal-00940779
• 47C. Gavoille, C. Glacet, N. Hanusse, D. Ilcinkas.
  Algorithme distribué de routage compact en temps optimal, in: 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, N. Nisse, F. Rousseau, Y. Busnel (editors), May 2013, pp. 117-120.
  http://hal.inria.fr/hal-00818445

Scientific Books (or Scientific Book chapters)

• 48Proceedings of the third MEDI international conference, Springer, October 2013, 291 p.
  http://hal.inria.fr/hal-00940783
• 49A. Ben Zakour, S. Maabout, M. Mosbah, M. Sistiaga.
  Relaxing Time Granularity for Mining Frequent Sequences, in: Advances in Knowledge and Data Mining, Springer, December 2013, pp. 53-76.
  http://hal.inria.fr/hal-00940782

Other Publications

• 50O. Beaumont, L. Eyraud-Dubois, P. Renaud-Goud.
  Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints, 2013.
  http://hal.inria.fr/hal-00874936
• 51O. Beaumont, L. Marchal.
  What Makes Affinity-Based Schedulers So Efficient ?, 2013.
  http://hal.inria.fr/hal-00875487
• 52D. Dereniowski, A. Kosowski, D. Pajak.
  Distinguishing Views in Symmetric Networks: A Tight Lower Bound, October 2013.
  http://hal.inria.fr/hal-00875370
• 53D. Dereniowski, A. Kosowski, D. Pajak, P. Uznanski.
  Bounds on the Cover Time of Parallel Rotor Walks, 2013.
  http://hal.inria.fr/hal-00865065
• 54L. Eyraud-Dubois, P. Uznanski.
  Point-to-point and congestion bandwidth estimation: experimental evaluation on PlanetLab, March 2013.
  http://hal.inria.fr/hal-00802307
• 55A. Kosowski, M. Markiewicz.
  Lower Bounds on the Communication Complexity of Binary Local Quantum Measurement Simulation, October 2013.
  http://hal.inria.fr/hal-00871120
• 56A. Kosowski, D. Pajak.
  Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router, February 2014.
  http://hal.inria.fr/hal-00950743

References in notes

• 57I. Abraham, S. Chechik, C. Gavoille.
  Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels, in: 44th Annual ACM Symposium on Theory of Computing (STOC), New-York, États-Unis, ACM (editor), 2012, pp. 1199-1217.
  http://hal.archives-ouvertes.fr/hal-00725839
• 58I. Abraham, S. Chechik, C. Gavoille, D. Peleg.
  Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension, in: 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2010, pp. 192-200. [ DOI : 10.1145/1835698.1835743 ]
• 59I. Atsonios, O. Beaumont, N. Hanusse, Y. Kim.
  On Power-Law Distributed Balls in Bins and its Applications to View Size Estimation, in: ISAAC, Yokohama, Japon, 2011.
  http://hal.inria.fr/inria-00618785
• 60E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, A. Labourel.
  Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids, in: DISC 2010, États-Unis, Springer Berlin / Heidelberg, 2010, vol. 6343, pp. 297–311.
  http://hal.archives-ouvertes.fr/hal-00534263
• 61E. Bampas, L. Gasieniec, N. Hanusse, D. Ilcinkas, R. Klasing, A. Kosowski.
  Euler Tour Lock-in Problem in the Rotor-Router Model, in: DISC 2009, Espagne, Springer Berlin / Heidelberg, 2009, vol. 5805, pp. 421–433.
  http://hal.archives-ouvertes.fr/hal-00402749
• 62E. Bampas, L. Gasieniec, R. Klasing, A. Kosowski, T. Radzik.
  Robustness of the rotor-router mechanism, in: OPODIS 2009, France, Springer Berlin / Heidelberg, 2009, vol. 5923, pp. 345–358.
  http://hal.archives-ouvertes.fr/hal-00417639
• 63C. Banino-Rokkones, O. Beaumont, H. Rejeb.
  Scheduling Techniques for Effective System Reconfiguration in Distributed Storage Systems, in: IEEE Intl Conference on Parallel and Distributed Systems Conferences, Melbourne, Australie, 2008.
  http://hal.inria.fr/inria-00336242
• 64O. Beaumont, N. Bonichon, L. Courtès, X. Hanin, E. Dolstra.
  Mixed Data-Parallel Scheduling for Distributed Continuous Integration, in: Heterogeneity in Computing Workshop, in IPDPS 2012, Shangaï, Chine, IEEE (editor), 2012.
  http://hal.inria.fr/hal-00684220
• 65O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.
  Distributed Approximation Algorithm for Resource Clustering, in: SIROCCO 2008, Suisse, 2008, pp. 61–73.
  http://hal.archives-ouvertes.fr/hal-00323068
• 66O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.
  Use of Internet Embedding Tools for Heterogeneous Resources Aggregation, in: Heterogeneity in Computing Workshop, Anchorage, États-Unis, 2011, 10 p.
  http://hal.inria.fr/inria-00562655
• 67O. 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
• 68O. Beaumont, N. Bonichon, L. Eyraud-Dubois.
  Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model, in: Heterogeneity in Computing Workshop, in IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, FL, États-Unis, 2008.
  http://hal.inria.fr/inria-00336189
• 69O. 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, Chine, IEEE (editor), 2012.
  http://hal.inria.fr/inria-00564056
• 70O. 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, Taïwan, Province De Chine, IEEE (editor), 2011, vol. Proceeding of ICPADS 2011, pp. 173-180.
  http://hal.inria.fr/inria-00618784
• 71O. 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, Taïwan, Province De Chine, 2011, 10 p.
  http://hal.inria.fr/inria-00580969
• 72O. Beaumont, P. Duchon, M. Korzeniowski.
  Heterogenous dating service with application to rumor spreading, in: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, FL, États-Unis, IEEE, 2008, pp. 1–10.
  http://hal.inria.fr/inria-00142778
• 73O. Beaumont, L. Eyraud-Dubois, A. Kumar.
  Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model, in: 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, États-Unis, 2010.
  http://hal.inria.fr/inria-00444586
• 74O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
  Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms, in: The Fifteenth International Conference on Parallel and Distributed Systems (ICPADS'09), Shenzhen, Chine, 2009.
  http://hal.inria.fr/inria-00413437
• 75O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
  Online Allocation of Splitable Clients to Multiple Servers on Large Scale Heterogeneous Platforms, in: AlgoTel, Carry-Le-Rouet, France, A. Chaintreau, C. Magnien (editors), 2009.
  http://hal.inria.fr/inria-00384569
• 76O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
  On-line Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Systems, in: PDP 2010 - The 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing, Pisa, Italie, 2010.
  http://hal.inria.fr/inria-00444584
• 77O. Beaumont, L. Eyraud-Dubois, J. Won.
  Using the Last-mile Model as a Distributed Scheme for Available Bandwidth Prediction, in: EuroPar 2011, Bordeaux, France, Springer (editor), 2011.
  http://hal.inria.fr/inria-00588651
• 78O. 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, États-Unis, 2010.
  http://hal.inria.fr/inria-00444585
• 79N. Bonichon, C. Gavoille, N. Hanusse, D. Ilcinkas.
  Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces, in: WG 2010, Grèce, Springer Berlin / Heidelberg, 2010, vol. 6410, pp. 266–278.
  http://hal.archives-ouvertes.fr/hal-00536710
• 80N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.
  Plane Spanners of Maximum Degree Six, in: ICALP, France, 2010, vol. 6198, pp. 19-30.
  http://hal.archives-ouvertes.fr/hal-00534212
• 81N. Bonichon, C. Gavoille, N. Hanusse, L. Perković.
  The Stretch Factor of $L_1$- and $L_{\infty }$-Delaunay Triangulations, in: 20th Annual European Symposium on Algorithms (ESA), L. Epstein, P. Ferragina (editors), Springer-Verlag, September 2012, vol. 7501 of Lecture Notes in Computer Science, pp. 205-216.
• 82J. Chalopin, S. Das, A. Kosowski.
  Constructing a Map of an Anonymous Graph: Applications of Universal Sequences, in: OPODIS - 14th International Conference On Principles Of DIstributed Systems - 2010, Tozeur, Tunisie, Springer, 2010, vol. 6490, pp. 119-134.
  http://hal.inria.fr/hal-00726071
• 83B. 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, pp. 3–12.
  http://doi.acm.org/10.1145/956993.956995
• 84R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, D. Peleg.
  Label-Guided Graph Exploration by a Finite Automaton, in: ACM Transactions on Algorithms, 2008, vol. 4, n^o 4, Article 42.
  http://hal.archives-ouvertes.fr/hal-00341609
• 85A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, A. Russell.
  Synchronous Rendezvous for Location-Aware Agents, in: DISC 2011 - 25th International Symposium on Distributed Computing, Rome, Italie, D. Peleg (editor), Springer, 2011, vol. 6950, pp. 447-459.
  http://hal.inria.fr/hal-00646907
• 86C. Cooper, D. Ilcinkas, R. Klasing, A. Kosowski.
  Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies, in: ICALP 2009, Grèce, Springer Berlin / Heidelberg, 2009, vol. 5556, pp. 411-422.
  http://hal.archives-ouvertes.fr/hal-00374071
• 87C. Cooper, R. Klasing, T. Radzik.
  Locating and repairing faults in a network with mobile agents, in: Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), Suisse, 2008, vol. 5058, pp. 20–32.
  http://hal.archives-ouvertes.fr/hal-00307025
• 88J. Czyzowicz, S. Dobrev, L. Gasieniec, D. Ilcinkas, J. Jansson, R. Klasing, I. Lignos, R. Martin, K. Sadakane, W.-K. Sung.
  More Efficient Periodic Traversal in Anonymous Undirected Graphs, in: SIROCCO 2009, Slovénie, Springer Berlin / Heidelberg, 2009, vol. 5869, pp. 174–188.
  http://hal.archives-ouvertes.fr/hal-00371489
• 89J. 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, Allemagne, C. Demetrescu, M. M. Halldórsson (editors), Springer, 2011, vol. 6942, pp. 701-712.
  http://hal.inria.fr/hal-00646910
• 90J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
  Asynchronous Deterministic Rendezvous in Bounded Terrains, in: SIROCCO 2010, Şirince, Turquie, Springer Berlin / Heidelberg, 2010, vol. 6058, pp. 72-85.
  http://hal.archives-ouvertes.fr/hal-00516048
• 91J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
  Optimal Exploration of Terrains with Obstacles, in: SWAT 2010, Bergen, Norvège, Springer Berlin / Heidelberg, 2010, vol. 6139, pp. 1-12.
  http://hal.archives-ouvertes.fr/hal-00516061
• 92J. Czyzowicz, A. Kosowski, A. Pelc.
  How to meet when you forget: log-space rendezvous in arbitrary graphs, in: Distributed Computing, 2012, vol. 25, n^o 2, pp. 165-178.
  http://hal.inria.fr/hal-00725875
• 93J. Czyzowicz, A. Kosowski, A. Pelc.
  Time vs. space trade-offs for rendezvous in trees, in: SPAA - 24th Symposium on Parallelism in Algorithms and Architectures - 2012, Pittsburgh, États-Unis, 2012, pp. 1-10.
  http://hal.inria.fr/hal-00725924
• 94F. 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, pp. 15–26.
  http://doi.acm.org/10.1145/1015467.1015471
• 95E. Diot, C. Gavoille.
  On the Path Separability of Planar Graphs, in: EuroComb 2009, Bordeaux, France, Bordeaux, France, 2009, vol. 34C, pp. 549-552.
  http://hal.archives-ouvertes.fr/hal-00408228
• 96P. Duchon, H. Larchevêque.
  On the search path length of random binary skip graphs, in: ANALCO 2010, Austin, États-Unis, SIAM (editor), SIAM, 2010, pp. 1-8.
  http://hal.inria.fr/inria-00547935
• 97L. Eyraud-Dubois, P. Uznanski.
  Bedibe: Datasets and Software Tools for Distributed Bandwidth Prediction, in: AlgoTel'2012 - Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Grande Motte, France, N. Hanusse, F. Mathieu (editors), 2012.
  http://hal.inria.fr/hal-00690861
• 98P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
  Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots, in: SIROCCO 2008, Villars-sur-Ollon, Suisse, A. A. Shvartsman, P. Felber (editors), Springer Berlin / Heidelberg, 2008, vol. 5058, pp. 33-47.
  http://hal.archives-ouvertes.fr/hal-00341465
• 99P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
  Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots, in: Theoretical Computer Science, 2010, vol. 411, n^o 14-15, pp. 1583-1598.
  http://hal.archives-ouvertes.fr/hal-00464588
• 100P. Flocchini, D. Ilcinkas, N. Santoro.
  Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens, in: DISC 2008, France, G. Taubenfeld (editor), Springer Berlin / Heidelberg, 2008, vol. 5218, pp. 227-241.
  http://hal.archives-ouvertes.fr/hal-00341523
• 101C. Gavoille, S. Chrisitan.
  Sparse Spanners vs. Compact Routing, in: 23rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Jose, États-Unis, ACM, 2011, pp. 225-234.
  http://hal.archives-ouvertes.fr/hal-00651836
• 102C. Gavoille, Q. Godfroy, L. Viennot.
  Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners, in: OPODIS'11 - 15th International Conference on Principles of Distributed Systems, Toulouse, France, A. F. Anta, G. Lipari, M. Roy (editors), Springer, 2011, vol. 7109, pp. 143-158.
  http://hal.archives-ouvertes.fr/hal-00651825
• 103C. 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.
• 104N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse.
  Locating a Target with an Agent Guided by Unreliable Local Advice, in: PODC 2010, Zurich, Suisse, ACM New York, NY, USA, 2010, pp. 355-364.
  http://hal.archives-ouvertes.fr/hal-00516695
• 105N. Hanusse, D. Kavvadias, E. Kranakis, D. Krizanc.
  Memoryless search algorithms in a network with faulty advice, in: Theoretical Computer Science, 2008, vol. 402, n^o 2-3, pp. 190-198.
  http://hal.archives-ouvertes.fr/hal-00341468
• 106N. Hanusse, S. Maabout.
  A parallel Algorithm for Computing Borders, in: International Conference on Information and Knowledge Managment (CIKM), Glasgow, Royaume-Uni, ACM, 2011, pp. 1639-1648.
  http://hal.archives-ouvertes.fr/hal-00644517
• 107N. Hanusse, S. Maabout, R. Tofan.
  A view selection algorithm with performance guarantee, in: International Conference on Extending Database Technology, St Petersburg, Russie, Fédération De, 2009.
  http://hal.archives-ouvertes.fr/hal-00341475
• 108N. Hanusse, S. Maabout, R. Tofan.
  Revisiting the Partial Data Cube Materialization, in: Conference on Advances in Data Bases and Information Systems (ADBIS), Vienne, Autriche, Springer, 2011, n^o 6909, pp. 70-83.
  http://hal.archives-ouvertes.fr/hal-00644526
• 109R. Klasing, A. Kosowski, A. Navarra.
  Taking Advantage of Symmetries: Gathering of many Asynchronous Oblivious Robots on a Ring, in: Theoretical Computer Science, 2010, vol. 411, n^o 34–36, pp. 3235–3246.
  http://hal.archives-ouvertes.fr/hal-00519069
• 110R. Klasing, E. Markou, A. Pelc.
  Gathering asynchronous oblivious mobile robots in a ring, in: Theoretical Computer Science, 2008, vol. 390, n^o 1, pp. 27–39.
  http://hal.archives-ouvertes.fr/hal-00307237
• 111A. Kosowski, B. Li, N. Nisse, K. Suchan.
  $k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), 2012.
  http://hal.archives-ouvertes.fr/hal-00687120
• 112A. Kosowski, A. Navarra.
  Graph Decomposition for Memoryless Periodic Exploration, in: Algorithmica, 2012, vol. 63, n^o 1-2, pp. 26-38.
  http://hal.inria.fr/hal-00725922
• 113A. Kosowski, A. Navarra, C. Pinotti.
  Synchronous Black Hole Search in Directed Graphs, in: Theoretical Computer Science, 2011, vol. 412, n^o 41, pp. 5752-5759.
  http://hal.inria.fr/inria-00614476
• 114A. Legrand, F. Mazoit, M. Quinson.
  An Application-level network mapper, LIP, ENS Lyon, France, feb 2003, n^o RR-2003-09.
• 115Y. Mao, L. Saul, J. Smith.
  IDES: An Internet Distance Estimation Service for Large Networks, in: IEEE JSAC, Dec. 2006, vol. 24, n^o 12, pp. 2273 -2284.
• 116J.-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, n^o 4, pp. 899-942.
  http://hal.inria.fr/hal-00649901
• 117V. 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, pp. 61–72.
• 118H. Watanabe, H. Nakazato, A. Ghatpande, O. Beaumont.
  Divisible Load Scheduling with Result Collection on Heterogeneous Systems, in: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, FL, États-Unis, 2008.
  http://hal.inria.fr/inria-00336186