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, 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/

Publications of the year

Articles in International Peer-Reviewed Journals

14O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves-Caro.

Heterogeneous Resource Allocation under Degree Constraints, in: IEEE Transactions on Parallel and Distributed Systems, 2012. [ DOI : 10.1109/TPDS.2012.175 ]

http://hal.inria.fr/hal-00771773
15J. 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: Theoretical Computer Science, July 2012, vol. 444, p. 60-76. [ DOI : 10.1016/j.tcs.2012.01.035 ]

http://hal.inria.fr/hal-00726767
16J. 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, p. 165-178. [ DOI : 10.1007/s00446-011-0141-9 ]

http://hal.inria.fr/hal-00725875
17P. Flocchini, D. Ilcinkas, N. Santoro.

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles, in: Algorithmica, April 2012, vol. 62, n^o 3-4, p. 1006-1033. [ DOI : 10.1007/s00453-011-9496-3 ]

http://hal.inria.fr/hal-00726790
18F. Foucaud, R. Klasing, A. Kosowski, A. Raspaud.

On the size of identifying codes in triangle-free graphs, in: Discrete Applied Mathematics, July 2012, vol. 160, n^o 10-11, p. 1532-1546. [ DOI : 10.1016/j.dam.2012.02.009 ]

http://hal.inria.fr/hal-00530172
19A. Kosowski, A. Navarra.

Graph Decomposition for Memoryless Periodic Exploration, in: Algorithmica, 2012, vol. 63, n^o 1-2, p. 26-38. [ DOI : 10.1007/s00453-011-9518-1 ]

http://hal.inria.fr/hal-00725922

International Conferences with Proceedings

20I. 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, United States, ACM (editor), May 2012, p. 1199-1217. [ DOI : 10.1145/2213977.2214084 ]

http://hal.inria.fr/hal-00725839
21O. 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ï, China, IEEE (editor), 2012.

http://hal.inria.fr/hal-00684220
22O. 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 (editor), 2012.

http://hal.inria.fr/inria-00564056
23O. Beaumont, L. Eyraud-Dubois, H. Larchevêque.

Reliable Service Allocation in Clouds, in: PDPS 2013 - 27th IEEE International Parallel & Distributed Processing Symposium, Boston, États-Unis, 2013.

http://hal.inria.fr/hal-00743524
24O. 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, États-Unis, IEEE, 2013.

http://hal.inria.fr/hal-00771640
25F. Becker, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan.

Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models, in: Symposium on Parallelism in Algorithms and Architectures, United States, 2012, 7 p.

http://hal.inria.fr/hal-00704200
26N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.

The Stretch Factor of $L_1$ - and $L_\infty$ -Delaunay Triangulations, in: 20th Annual European Symposium on Algorithms (ESA), Ljubljana, Slovenia, September 2012, vol. 7501 of Lecture Notes in Computer Science, p. 205-216.

http://hal.inria.fr/hal-00725844
27J. 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, United States, ACM, 2012, p. 1-10. [ DOI : 10.1145/2312005.2312007 ]

http://hal.inria.fr/hal-00725924
28G. D'Angelo, G. Di Stefano, R. Klasing, A. Navarra.

Gathering of Robots on Anonymous Grids without multiplicity detection, in: 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012), Reykjavík, Iceland, Lecture Notes in Computer Science, Springer, June 2012, vol. 7355, p. 327-338. [ DOI : 10.1007/978-3-642-31104-8_28 ]

http://hal.inria.fr/hal-00728988
29L. 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, États-Unis, 2013.

http://hal.inria.fr/hal-00772846
30C. Gavoille, P. Halftermeyer.

Connexité dans l'urgence, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), April 2012, p. 1-4.

http://hal.inria.fr/hal-00690561
31D. Ilcinkas, A. Wade.

Puissance de l'attente aux stations pour l'exploration des réseaux de transport public, in: 14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, F. Mathieu, N. Hanusse (editors), 2012, p. 107-110.

http://hal.inria.fr/hal-00691015
32A. 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, ... p.

http://hal.inria.fr/hal-00687120
33A. Kosowski, B. Li, N. Nisse, K. Suchan.

k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, in: 39th International Colloquium on Automata, Languages and Programming (ICALP), track C, United Kingdom, 2012, p. 610-622.

http://hal.inria.fr/hal-00704202
34A. Kosowski, A. Navarra, D. Pajak, C. Pinotti.

Maximum Matching in Multi-Interface Networks, in: COCOA - 6th Conference on Combinatorial Optimization and Applications - 2012, Banff, Canada, Lecture Notes in Computer Science, Springer, 2012, vol. 7402, p. 13-24. [ DOI : 10.1007/978-3-642-31770-5_2 ]

http://hal.inria.fr/hal-00725925

National Conferences with Proceeding

35L. 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), May 2012.

http://hal.inria.fr/hal-00690861

Scientific Books (or Scientific Book chapters)

36R. Klasing.

Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Springer, 2012, 406 p, Lecture Notes in Computer Science, Vol. 7276. [ DOI : 10.1007/978-3-642-30850-5 ]

http://hal.inria.fr/hal-00720762

Internal Reports

37N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.

The Stretch Factor of $L_1$ - and $L_\infty$ -Delaunay Triangulations, February 2012.

http://hal.inria.fr/hal-00673187
38A. Kosowski, B. Li, N. Nisse, K. Suchan.

k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, Inria, February 2012, n^o RR-7888.

http://hal.inria.fr/hal-00671861

Other Publications

39N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.

The Stretch Factor of $L_1$ - and $L_\infty$ -Delaunay Triangulations, May 2012, Poster at STOC.

http://hal.inria.fr/hal-00725842
40A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis, D. Krizanc, R. Martin, O. Morales Ponce.

Optimal Patrolling of Fragmented Boundaries.

http://hal.inria.fr/hal-00686270
41J. Czyzowicz, D. Dereniowski, L. Gasieniec, R. Klasing, A. Kosowski, D. Pajak.

Collision-Free Network Exploration.

http://hal.inria.fr/hal-00736276
42J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis, O. Morales Ponce, E. Pacheco.

Position Discovery for a System of Bouncing Robots.

http://hal.inria.fr/hal-00735828
43R. Klasing, A. Kosowski, D. Pajak, T. Sauerwald.

The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random Walks.

http://hal.inria.fr/hal-00735113
44A. Kosowski.

Faster Walks in Graphs: A $\tilde{O} (n^{2})$ Time-Space Trade-off for Undirected s-t Connectivity, Version 3 makes use of the Metropolis-Hastings walk.

http://hal.inria.fr/hal-00685373
45A. Kosowski, P. Uznanski.

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.

http://hal.inria.fr/hal-00737611

References in notes

46I. 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, p. 1199-1217.

http://hal.archives-ouvertes.fr/hal-00725839
47I. 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, p. 192-200. [ DOI : 10.1145/1835698.1835743 ]
48I. 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
49E. 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, p. 297–311.

http://hal.archives-ouvertes.fr/hal-00534263
50E. 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, p. 421–433.

http://hal.archives-ouvertes.fr/hal-00402749
51E. 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, p. 345–358.

http://hal.archives-ouvertes.fr/hal-00417639
52C. 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
53O. 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
54O. Beaumont, N. Bonichon, P. Duchon, H. Larchevêque.

Distributed Approximation Algorithm for Resource Clustering, in: SIROCCO 2008, Suisse, 2008, p. 61–73.

http://hal.archives-ouvertes.fr/hal-00323068
55O. 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
56O. 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, P. Ducourthial (editor), 2011.

http://hal.inria.fr/inria-00585254
57O. 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, 2008. IPDPS 2008., Miami, FL, États-Unis, 2008.

http://hal.inria.fr/inria-00336189
58O. 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
59O. 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, p. 173-180.

http://hal.inria.fr/inria-00618784
60O. 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
61O. Beaumont, P. Duchon, M. Korzeniowski.

Heterogenous dating service with application to rumor spreading, in: IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., Miami, FL, États-Unis, IEEE, 2008, p. 1–10.

http://hal.inria.fr/inria-00142778
62O. 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
63O. 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
64O. 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
65O. 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
66O. 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
67O. 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
68N. 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, p. 266–278.

http://hal.archives-ouvertes.fr/hal-00536710
69N. Bonichon, C. Gavoille, N. Hanusse, L. Perkovic.

Plane Spanners of Maximum Degree Six, in: ICALP, France, 2010, vol. 6198, p. 19-30.

http://hal.archives-ouvertes.fr/hal-00534212
70N. 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, p. 205-216.
71J. 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, p. 119-134.

http://hal.inria.fr/hal-00726071
72B. 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
73R. 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 p.

http://hal.archives-ouvertes.fr/hal-00341609
74A. 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, p. 447-459.

http://hal.inria.fr/hal-00646907
75C. 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, p. 411-422.

http://hal.archives-ouvertes.fr/hal-00374071
76C. 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, p. 20–32.

http://hal.archives-ouvertes.fr/hal-00307025
77J. 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, p. 174–188.

http://hal.archives-ouvertes.fr/hal-00371489
78J. 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, p. 701-712.

http://hal.inria.fr/hal-00646910
79J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.

Asynchronous Deterministic Rendezvous in Bounded Terrains, in: SIROCCO 2010, Şirince, Turquie, Springer Berlin / Heidelberg, 2010, vol. 6058, p. 72-85.

http://hal.archives-ouvertes.fr/hal-00516048
80J. 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, p. 1-12.

http://hal.archives-ouvertes.fr/hal-00516061
81J. 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, p. 165-178.

http://hal.inria.fr/hal-00725875
82J. 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, p. 1-10.

http://hal.inria.fr/hal-00725924
83F. 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
84E. Diot, C. Gavoille.

On the Path Separability of Planar Graphs, in: EuroComb 2009, Bordeaux, France, Bordeaux, France, 2009, vol. 34C, p. 549-552.

http://hal.archives-ouvertes.fr/hal-00408228
85P. Duchon, H. Larchevêque.

On the search path length of random binary skip graphs, in: ANALCO 2010, Austin, États-Unis, SIAM (editor), SIAM, 2010, p. 1-8.

http://hal.inria.fr/inria-00547935
86L. 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
87P. 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, p. 33-47.

http://hal.archives-ouvertes.fr/hal-00341465
88P. 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, p. 1583-1598.

http://hal.archives-ouvertes.fr/hal-00464588
89P. 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, p. 227-241.

http://hal.archives-ouvertes.fr/hal-00341523
90C. 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, p. 225-234.

http://hal.archives-ouvertes.fr/hal-00651836
91C. 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, p. 143-158.

http://hal.archives-ouvertes.fr/hal-00651825
92C. 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.
93N. 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, p. 355-364.

http://hal.archives-ouvertes.fr/hal-00516695
94N. 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, p. 190-198.

http://hal.archives-ouvertes.fr/hal-00341468
95N. Hanusse, S. Maabout.

A parallel Algorithm for Computing Borders, in: International Conference on Information and Knowledge Managment (CIKM), Glasgow, Royaume-Uni, ACM, 2011, p. 1639-1648.

http://hal.archives-ouvertes.fr/hal-00644517
96N. 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, électronique p.

http://hal.archives-ouvertes.fr/hal-00341475
97N. 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, p. 70-83.

http://hal.archives-ouvertes.fr/hal-00644526
98R. 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, p. 3235–3246.

http://hal.archives-ouvertes.fr/hal-00519069
99R. Klasing, E. Markou, A. Pelc.

Gathering asynchronous oblivious mobile robots in a ring, in: Theoretical Computer Science, 2008, vol. 390, n^o 1, p. 27–39.

http://hal.archives-ouvertes.fr/hal-00307237
100A. 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, N. Mathieu (editor), 2012, ... p.

http://hal.archives-ouvertes.fr/hal-00687120
101A. Kosowski, A. Navarra.

Graph Decomposition for Memoryless Periodic Exploration, in: Algorithmica, 2012, vol. 63, n^o 1-2, p. 26-38.

http://hal.inria.fr/hal-00725922
102A. Kosowski, A. Navarra, C. Pinotti.

Synchronous Black Hole Search in Directed Graphs, in: Theoretical Computer Science, 2011, vol. 412, n^o 41, p. 5752-5759.

http://hal.inria.fr/inria-00614476
103A. Legrand, F. Mazoit, M. Quinson.

An Application-level network mapper, LIP, ENS Lyon, France, feb 2003, n^o RR-2003-09.
104Y. 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.
105J.-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, p. 899-942.

http://hal.inria.fr/hal-00649901
106V. 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.
107H. 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, 2008. IPDPS 2008., Miami, FL, États-Unis, 2008.

http://hal.inria.fr/inria-00336186

Previous |

Home