Inria / Raweb 2009
Presentation of the Project Cépage

Bibliography

Major publications by the team in recent years

[1]: O. Beaumont, L. Carter, J. Ferrante, A. Legrand, Y. Robert.
Bandwidth-centric allocation of independent tasks on heterogeneousplatforms, in: Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, 2002, p. 67–72.
[2]: O. Beaumont, A. Legrand, L. Marchal, Y. Robert.
Pipelining broadcasts on heterogeneous platforms, in: IEEE Transactions on Parallel and Distributed Systems, 2005, vol. 16, n^o 4, p. 300–313.
[3]: J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes.
Hardness and approximation of Gathering in static radio +networks, in: Parallel Processing Letters, June 2006, vol. 16, n^o 2, p. 165–183
http://dx.doi.org/10.1142/S0129626406002551.
[4]: P. 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.
[5]: P. 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.
[6]: L. 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.
[7]: P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc.
Distributed Computing with Advice: Information Sensitivity of Graph Coloring, in: ICALP, 2007, p. 231-242.
[8]: P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, Z. Lotker.
Universal Augmentation Schemes for Network Navigability: Overcoming the $Im2 $\sqrt n$$ -Barrier, in: 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, June 2007, p. 1-7.
[9]: C. Gavoille, D. Peleg.
Compact and Localized Distributed Data Structures, in: Distributed Computing, May 2003, vol. 16, p. 111-120, PODC 20-Year Special Issue.
[10]: J. Hromkovič, R. Klasing, A. Pelc, P. Ružička, W. Unger.
Dissemination of Information in Communication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, Springer Monograph, Springer-Verlag, 2005
http://www.springer.com/france/home?SGWID=7-102-22-33834650-0&changeHeader=true.

Publications of the year

Articles in International Peer-Reviewed Journal

[11]: F. Bazzaro, C. Gavoille.
Localized and Compact Data-Structure for Comparability Graphs, in: Discrete Mathematics, 2009, vol. 309, n^o 11, p. 3465-3484
http://hal.archives-ouvertes.fr/hal-00368040/en/.
[12]: C. Cooper, R. Klasing, T. Radzik.
Locating and repairing faults in a network with mobile agents, in: Theoretical Computer Science, 2010
http://hal.archives-ouvertes.fr/hal-00446022/en/, to appear.
[13]: B. Courcelle, C. Gavoille, M. M. Kanté.
Compact Labelings For Efficient First-Order Model-Checking, in: Journal of Combinatorial Optimization, 2009
http://hal.archives-ouvertes.fr/hal-00342668/en/, to appear.
[14]: P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc.
Distributed computing with advice: information sensitivity of graph coloring, in: Distributed Computing, 2009, vol. 21, n^o 6, p. 395-403
http://hal.archives-ouvertes.fr/hal-00395775/en/.
[15]: P. Fraigniaud, D. Ilcinkas, A. Pelc.
Communication algorithms with advice, in: Journal of Computer and System Sciences, 2009
http://hal.archives-ouvertes.fr/hal-00412058/en/, to appear.
[16]: C. Gavoille, R. Klasing, A. Kosowski, L. Kuszner, A. Navarra.
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints, in: Networks, 2009, vol. 54, n^o 1, p. 12–19
http://hal.archives-ouvertes.fr/hal-00342898/en/.
[17]: J. Hromkovic, 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/.
[18]: D. Ilcinkas, N. Nisse, D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching, in: Distributed Computing, 2009, vol. 22, n^o 2, p. 117-127
http://hal.archives-ouvertes.fr/hal-00412063/en/.
[19]: R. Klasing, A. Kosowski, A. Navarra.
Cost Minimisation in Wireless Networks with a Bounded and Unbounded Number of Interfaces, in: Networks, 2009, vol. 53, n^o 3, p. 266–275
http://hal.archives-ouvertes.fr/hal-00307235/en/.
[20]: R. Klasing, Z. Lotker, A. Navarra, S. Pérennes.
From Balls and Bins to Points and Vertices, in: Algorithmic Operations Research, 2009, vol. 4, n^o 2, p. 133–143
http://hal.archives-ouvertes.fr/hal-00342915/en/.

International Peer-Reviewed Conference/Proceedings

[21]: E. Bampas, L. Gasieniec, N. Hanusse, D. Ilcinkas, R. Klasing, A. Kosowski.
Euler Tour Lock-in Problem in the Rotor-Router Model, in: Proceedings of the 23rd International Symposium on Distributed Computing DISC 2009, Espagne, Springer Berlin / Heidelberg, 2009, vol. 5805, p. 421–433
http://hal.archives-ouvertes.fr/hal-00402749/en/.
[22]: E. Bampas, L. Gasieniec, R. Klasing, A. Kosowski, T. Radzik.
Robustness of the rotor-router mechanism, in: Proceedings of the 13th International Conference on Principles of Distributed Systems OPODIS 2009, France, Springer Berlin / Heidelberg, 2009, vol. 5923, p. 345–358
http://hal.archives-ouvertes.fr/hal-00417639/en/.
[23]: O. Beaumont, L. Eyraud-Dubois, S. Kumar.
Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model, in: 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), États-Unis d'Amérique Atlanta, 2010
http://hal.inria.fr/inria-00444586/en/.
[24]: O. 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), Chine Shenzhen, 2009
http://hal.inria.fr/inria-00413437/en/.
[25]: O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
Online Allocation of Splitable Clients to Multiple Servers on Large Scale Heterogeneous Platforms, in: AlgoTel, France Carry-Le-Rouet, A. Chaintreau, C. Magnien (editors), 2009
http://hal.inria.fr/inria-00384569/en/.
[26]: O. 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, Italie Pisa, 2010
http://hal.inria.fr/inria-00444584/en/.
[27]: O. 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), États-Unis d'Amérique Atlanta, 2010
http://hal.inria.fr/inria-00444585/en/.
[28]: C. Cooper, D. Ilcinkas, R. Klasing, A. Kosowski.
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies, in: Proceedings of the 36th International Colloquium on Automata, Languages and Programming ICALP 2009, Grèce, Springer Berlin / Heidelberg, 2009, vol. 5556, p. 411-422
http://hal.archives-ouvertes.fr/hal-00374071/en/.
[29]: J. 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: Proceedings of the 16th Colloquium on Structural Information and Communication Complexity SIROCCO 2009, Slovénie, Springer Berlin / Heidelberg, 2009, vol. 5869, p. 174–188
http://hal.archives-ouvertes.fr/hal-00371489/en/.
[30]: B. Derbel, C. Gavoille, D. Peleg, L. Viennot.
Local Computation of Nearly Additive Spanners, in: 23rd International Symposium on Distributed Computing (DISC) DISC, Espagne Elche/Elx, Springer, 2009, vol. 5805, p. 176-190
http://hal.archives-ouvertes.fr/hal-00408725/en/.
[31]: Y. Dieng, C. Gavoille.
On the Tree-Width of Planar Graphs, in: European Conference on Combinatorics, Graph Theory and Applications (EuroComb) EuroComb 2009, Bordeaux, France, France Bordeaux, Elsevier, 2009, vol. 34C, p. 593-596
http://hal.archives-ouvertes.fr/hal-00408481/en/, Electronic Notes in Discrete Mathematics.
[32]: E. Diot, C. Gavoille.
On the Path Separability of Planar Graphs, in: EuroComb 2009 EuroComb 2009, Bordeaux, France, France Bordeaux, 2009, vol. 34C, p. 549-552
http://hal.archives-ouvertes.fr/hal-00408228/en/.
[33]: C. Gavoille, A. Kosowski, M. Markiewicz.
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing, in: 23rd International Symposium on Distributed Computing (DISC) DISC, Espagne Elche/Elx, Springer, 2009, vol. 5805, p. 243-257
http://hal.archives-ouvertes.fr/hal-00408727/en/.
[34]: N. Hanusse, S. Maabout, R. Tofan.
A view selection algorithm with performance guarantee, in: International Conference on Extending Database Technology International Conference on Extending Database Technology, Russie St Petersburg, 2009, électronique p
http://hal.archives-ouvertes.fr/hal-00341475/en/.

National Peer-Reviewed Conference/Proceedings

[35]: C. Gavoille, Y. Dieng.
Routage dans les réseaux cellulaires, in: 10ièmes Journées Doctorales en Informatique et Réseaux 10ièmes Journées Doctorales en Informatique et Réseaux, Belfort, UTMB, France, février 2009, France Belfort, 2009, p. 7-12
http://hal.archives-ouvertes.fr/hal-00366615/en/.
[36]: C. Gavoille.
Spanner et routage compact : similarités et différences, in: AlgoTel, France Carry-Le-Rouet, A. Chaintreau, C. Magnien (editors), 2009
http://hal.inria.fr/inria-00383276/en/.
[37]: N. Hanusse, S. Maabout, R. Tofan.
Algorithme distribué pour l'extraction des fréquents maximaux, in: Algotel, France Carry-Le-Rouet, A. Chaintreau, C. Magnien (editors), 2009
http://hal.inria.fr/inria-00385104/en/.
[38]: N. Hanusse, S. Maabout, R. Tofan.
Algorithmes pour la sélection de vues à matérialiser avec garantie de performance, in: Actes de la conférence EDA 2009 5ème journées francophones sur les entrepôts de données et l'analyse en ligne (EDA'09), France Montpellier, 2009, p. 1-15
http://hal.archives-ouvertes.fr/hal-00375595/en/.

Workshops without Proceedings

[39]: O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
Online and offline Independent Tasks Allocation Schemes on Large Scale Master-Worker Heterogeneous Platforms., in: 1st Workshop on New Challenges in Distributed Systems, Chili Valparaiso, 2009
http://hal.inria.fr/inria-00413434/en/.

Scientific Books (or Scientific Book chapters)

[40]: O. Beaumont, L. Marchal.
Steady-State Scheduling, in: Introduction To Scheduling, Y. Robert, F. Vivien (editors), Taylor and Francis, 2009
http://hal.inria.fr/inria-00344157/en/.
[41]: V. Bonifaci, R. Klasing, P. Korteweg, L. Stougie, A. Marchetti-Spaccamela.
Data Gathering in Wireless Networks, in: Graphs and Algorithms in Communication Networks, A. Koster, X. Munoz (editors), Springer-Verlag, 2009, p. 357–378
http://hal.archives-ouvertes.fr/hal-00342958/en/.
[42]: I. Caragiannis, M. Flammini, C. Kaklamanis, R. Klasing, A. Navarra.
Energy Consumption Minimization in Ad Hoc Wireless and Multi-Interface Networks, in: Graphs and Algorithms in Communication Networks, A. Koster, X. Munoz (editors), Springer-Verlag, 2009
http://hal.archives-ouvertes.fr/hal-00342955/en/, to appear.
[43]: L. Eyraud-Dubois, A. Legrand.
The impact of platform models on scheduling techniques, in: Introduction to Scheduling, Y. Robert, F. Vivien (editors), Taylor and Francis, 2009
http://hal.inria.fr/inria-00344035/en/.

Internal Reports

[44]: O. Beaumont, L. Eyraud-Dubois, H. Rejeb, C. Thraves.
Extended Version: Online Allocation of Splitable Clients to Multiple Servers on Large Scale Heterogeneous Platforms, INRIA, 2009
http://hal.inria.fr/inria-00384475/en/, Rapport de recherche.
[45]: H. Rejeb, O. Beaumont.
On the Importance of Bandwidth Control Mechanisms for Scheduling on Large Scale Heterogeneous Platforms, INRIA, 2009
http://hal.inria.fr/inria-00433124/en/, RR-7105.

Other Publications

[46]: J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
Asynchronous deterministic rendezvous in bounded terrains, 2009
http://hal.archives-ouvertes.fr/hal-00442196/en/, Submitted.
[47]: J. Czyzowicz, D. Ilcinkas, A. Labourel, A. Pelc.
Optimal Exploration of Terrains with Obstacles, 2009
http://hal.archives-ouvertes.fr/hal-00442209/en/, Submitted.
[48]: C. Gavoille, A. Kosowski, M. Markiewicz.
What Can be Observed Locally? Round-based Models for Quantum Distributed Computing, 2009
http://hal.archives-ouvertes.fr/hal-00393801/en/, Submitted.

References in notes

[49]: S. Abiteboul, S. Alstrup, H. Kaplan, T. Milo, T. Rauhe.
Compact Labeling Schemes for Ancestor Queries, in: SIAM Journal on Computing, 2005.
[50]: I. Abraham, C. Gavoille, A. V. Goldberg, D. Malkhi.
Routing in Networks with Low Doubling Dimension, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, December 2005, n^o MSR-TR-2005-175, Technical report.
[51]: I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, M. Thorup.
Compact Name-Independent Routing with Minimum Stretch, in: 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, July 2004, p. 20-24.
[52]: I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, M. Thorup.
Compact Name-Independent Routing with Minimum Stretch, in: ACM Transactions on Algorithms, 2008, vol. 3, n^o 4, Article 37 p
http://dx.doi.org/10.1145/1367064.1367077.
[53]: I. Abraham, C. Gavoille, D. Malkhi, U. Wieder.
Strong-Diameter Decompositions of Minor Free Graphs, in: 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, June 2007, p. 16-24.
[54]: I. Abraham, D. Malkhi, O. Dobzinski.
LAND: stretch (1 + epsilon) locality-aware networks for DHTs., in: Symposium of Discrete Algorithms (SODA), 2004, p. 550-559
http://doi.acm.org/10.1145/982873.
[55]: M. Adler, Y. Gong, A. L. Rosenberg.
Optimal sharing of bags of tasks in heterogeneous clusters, in: 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA'03), ACM Press, 2003, p. 1–10.
[56]: S. Alstrup, C. Gavoille, H. Kaplan, T. Rauhe.
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment, in: Theory of Computing Systems, 2004, vol. 37, p. 441-456
http://dx.doi.org/10.1007/s00224-004-1155-5.
[57]: B. Awerbuch, F. T. Leighton.
A Simple Local-Control Approximation Algorithm for Multicommodity Flow, in: IEEE Symposium on Foundations of Computer Science, 1993, p. 459-468.
[58]: B. Awerbuch, T. Leighton.
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in: IEEE Symposium on Foundations of Computer Science, 1994, p. 487–496.
[59]: C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, Y. Robert.
Scheduling strategies for master-slave tasking on heterogeneous processor platforms, in: IEEE Trans. Parallel Distributed Systems, 2004, vol. 15, n^o 4, p. 319-330.
[60]: C. 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, Australie Melbourne, 2008
http://hal.inria.fr/inria-00336242/en/.
[61]: F. Bazzaro, C. Gavoille.
Localized and Compact Data-Structure for Comparability Graphs, in: Discrete Mathematics, 2008
http://dx.doi.org/10.1016/j.disc.2007.12.091.
[62]: O. Beaumont, N. Bonichon, P. Duchon, L. Eyraud-Dubois, H. Larchevêque.
A Distributed Algorithm for Resource Clustering in Large Scale Platforms, in: OPODIS 2008, Égypte Louxor, 2008
http://hal.inria.fr/inria-00369417/fr/.
[63]: O. 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/en/.
[64]: O. 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., États-Unis d'Amérique Miami, FL, 2008
http://hal.inria.fr/inria-00336189/en/.
[65]: O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, Y. Robert.
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications, in: IEEE Transactions on Parallel and Distributed Systems, 2008
http://hal.inria.fr/inria-00336197/en/.
[66]: O. Beaumont, A. Guermouche.
Task Scheduling for Parallel Multifrontal Methods, in: Euro-Par 2007 Parallel Processing, Lecture Notes in Computer Science, 2007
http://www.labri.fr/publications/paradis/2007/BG07.
[67]: O. Beaumont, A. Kermarrec, L. Marchal, E. Rivière.
VoroNet: A scalable object network based on Voronoi tessellations, in: International Parallel and Distributed Processing Symposium IPDPS, 2007.
[68]: O. Beaumont, A. Kermarrec, E. Rivière.
Peer to peer multidimensional overlays: Approximating complex structures, in: OPODIS, 2007.
[69]: O. Beaumont, L. Marchal, Y. Robert.
Scheduling divisible loads with return messages on heterogeneous master-worker platforms, in: International Conference on High Performance Computing HiPC'2005, LNCS, Springer Verlag, 2005.
[70]: V. Bharadwaj, D. Ghose, V. Mani, T. Robertazzi.
Scheduling Divisible Loads in Parallel and Distributed Systems, IEEE Computer Society Press, 1996.
[71]: H. L. Bodlaender, J. v. Leeuwen, R. B. Tan, D. M. Thilikos.
On Interval Routing Schemes and Treewidth, in: Information and Computation, November 1997, vol. 139, p. 92-109.
[72]: N. Bonichon, C. Gavoille, N. Hanusse.
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation, in: 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Springer, February 2003, vol. 2607 of Lecture Notes in Computer Science, p. 499-510.
[73]: N. Bonichon, C. Gavoille, N. Hanusse.
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation, in: 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer-Verlag, June 2003, vol. 2880 of Lecture Notes in Computer Science, p. 81-92.
[74]: N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, G. Schaeffer.
Planar Graphs, via Well-Orderly Maps and Trees, in: 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer, June 2004, vol. 3353 of Lecture Notes in Computer Science
http://dx.doi.org/10.1007/b104584, 270-284.
[75]: T.-H. H. Chan, A. Gupta, B. M. Maggs, S. Zhou.
On Hierarchical Routing in Doubling Metrics, in: 16th Symposium on Discrete Algorithms (SODA), ACM-SIAM, January 2005, p. 762-771.
[76]: B. Courcelle, C. Gavoille, M. M. Kanté.
Efficient First-Order Model-Checking using Short Labels, in: 2nd International Frontiers of Algorithmics Workshop (FAW), Springer, 2008, vol. 5059 of Lecture Notes in Computer Science, p. 159-170.
[77]: B. Courcelle, C. Gavoille, M. Kanté, D. A. Twigg.
Forbidden-Set Labeling on Graphs, in: 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), August 2007, Co-located with PODC 2007.
[78]: B. Courcelle, C. Gavoille, M. M. Kanté, D. A. Twigg.
Connectivity check in 3-connected planar graphs with obstacles, in: International Conference on Topological & Geometric Graph Theory, Electronic Notes in Discrete Mathematics, 2008, vol. 31, p. 151-155
http://dx.doi.org/10.1016/j.endm.2008.06.030.
[79]: E. Darve, A. Pohorille.
Calculating free energies using average force, in: Journal of Chemical Physics, 2001, vol. 115, p. 9169-9183.
[80]: F. K. H. A. Dehne, T. Eavis, Susanne E. Hambrusch, A. Rau-Chaplin.
Parallelizing the Data Cube, in: Distributed and Parallel Databases, 2002, vol. 11, n^o 2, p. 181-201.
[81]: A. J. Demers, D. H. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. E. Sturgis, D. C. Swinehart, D. B. Terry.
Epidemic Algorithms for Replicated Database Maintenance., in: Operating Systems Review, 1988, vol. 22, n^o 1, p. 8-32.
[82]: B. Derbel, C. Gavoille.
Fast Deterministic Distributed Algorithms for Sparse Spanners, in: Theoretical Computer Science, 2008, vol. 399, n^o 1-2, p. 83-100
http://dx.doi.org/10.1016/j.tcs.2008.02.019.
[83]: B. Derbel, C. Gavoille, D. Peleg, L. Viennot.
Construction Locale de Sous-Graphes Couvrants Peu Denses, in: 10 èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2008, p. 105-108.
[84]: Y. Dieng, C. Gavoille.
Routage dans les graphes cellulaires, in: 9 èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2007, p. 91-94.
[85]: A. Don, N. Hanusse.
Content-based image retrieval using greedy routing, in: Electronic Imaging - Multimedia Content Access Track, États-Unis d'Amérique, Theo Gevers, Ramesh C. Jain and Simone Santini, 2008, vol. 6820, p. 68200I1-6820I11
http://hal.archives-ouvertes.fr/hal-00307538/en/.
[86]: P. Duchon, N. Eggemann, N. Hanusse.
Non-Navigability of random scale-free graphs, in: OPODIS - International Conference Of Principles of Distributed Systems, 2007.
[87]: P. Duchon, N. Eggemann, N. Hanusse.
Non-searchability of random scale-free graphs, in: PODC - Principles Of Distributed Computing, 2007, p. 380-381.
[88]: P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel.
Could any graph be turned into a small world ?, in: International Symposium on Distributed Computing (DISC), P. Fraigniaud (editor), Lecture Notes in Computer Science, Springer Verlag, 2005, vol. 3724, p. 511-513
http://www.labri.fr/publications/combalgo/2005/DHLS05a.
[89]: P. Duchon, N. Hanusse, E. Lebhar, N. SCHABANEL.
Towards Small World Emergence, in: SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, PO box 11405, NY - 10286-6626, U. Vishkin (editor), ACM Pess, ACM SIGACT - ACM SIGARCH, July 2006, p. 225-232
http://www.labri.fr/publications/combalgo/2006/DHLS06.
[90]: P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro.
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots, in: SIROCCO 2008, Suisse Villars-sur-Ollon, A. A. Shvartsman, P. Felber (editors), Springer Berlin / Heidelberg, 2008, vol. 5058, p. 33-47
http://hal.archives-ouvertes.fr/hal-00341465/en/.
[91]: P. 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/en/.
[92]: P. Fraigniaud, C. Gavoille.
Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch, in: 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, 2008, p. 62-69.
[93]: P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, Z. Lotker.
Universal augmentation schemes for network navigability: Overcoming the sqrt(n)-barrier, in: 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2007, p. 1-7.
[94]: P. Fraigniaud, C. Gavoille, C. Paul.
Eclecticism Shrinks Even Small Worlds, in: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2004, p. 169-178.
[95]: L. Gasieniec, R. Klasing, R. Martin, A. Navarra, X. Zhang.
Fast Periodic Graph Exploration with Constant Memory, in: Journal of Computer and System Sciences, 2008, vol. 74, p. 808–822
http://hal.archives-ouvertes.fr/hal-00306995/en/.
[96]: C. Gavoille, B. Derbel, D. Peleg, L. Viennot.
On the Locality of Distributed Sparse Spanner Construction, in: 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), Canada, ACM Press, 2008, p. 273-282
http://hal.archives-ouvertes.fr/hal-00343001/en/.
[97]: C. Gavoille.
Routing in Distributed Networks: Overview and Open Problems, in: ACM SIGACT News - Distributed Computing Column, March 2001, vol. 32, n^o 1, p. 36-52.
[98]: C. Gavoille.
An Overview on Compact Routing, in: Workshop on Peer-to-Peer, Routing in Complex Graphs, and Network Coding, March 2007.
[99]: C. Gavoille, N. Hanusse.
On Compact Encoding of Pagenumber k Graphs, in: Discrete Mathematics & Theoretical Computer Science, 2005, To appear.
[100]: C. Gavoille, N. Hanusse.
On Compact Encoding of Pagenumber k Graphs, in: Discrete Mathematics & Theoretical Computer Science, 2008, To appear.
[101]: C. Gavoille, N. Hanusse.
Compact Routing Tables for Graphs of Bounded Genus, in: 26th International Colloquium on Automata, Languages and Programming (ICALP), J. Wiedermann, P. van Emde Boas, M. Nielsen (editors), Springer, July 1999, vol. 1644 of Lecture Notes in Computer Science, p. 351-360.
[102]: C. Gavoille, A. Labourel.
Brief Annoucement: On Local Representation of Distances in Trees, in: 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, August 2007, p. 246-247
http://portal.acm.org/citation.cfm?id=1281169.
[103]: C. Gavoille, A. Labourel.
Distributed Relationship Schemes for Trees, in: 18th Annual International Symposium on Algorithms and Computation (ISAAC), Springer, December 2007, vol. 4835 of Lecture Notes in Computer Science, p. 728-738.
[104]: C. Gavoille, A. Labourel.
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs, in: 15th Annual European Symposium on Algorithms (ESA), L. Arge, E. Welzl (editors), Springer, October 2007, vol. 4698 of Lecture Notes in Computer Science, p. 582-593.
[105]: C. Gavoille, C. Paul.
Optimal Distance Labeling for Interval Graphs and Related Graphs Families, in: SIAM Journal on Discrete Mathematics, 2008, vol. 22, n^o 3, p. 1239-1258
http://dx.doi.org/10.1137/050635006.
[106]: C. Gavoille, D. Peleg.
Compact and Localized Distributed Data Structures, in: Journal of Distributed Computing, May 2003, vol. 16, p. 111-120, PODC 20-Year Special Issue.
[107]: A. Ghatpande, H. Nakazato, O. Beaumont, H. Watanabe.
Analysis of Divisible Load Scheduling with Result Collection on Heterogeneous Systems, in: IEICE Transactions on Communications, 2008
http://hal.inria.fr/inria-00336236/en/.
[108]: A. Ghatpande, H. Nakazato, O. Beaumont, H. Watanabe.
SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems, in: IEICE Transactions on Communications, 2008
http://hal.inria.fr/inria-00336212/en/.
[109]: N. Hanusse, D. Kavvadias, E. Kranakis, D. Krizanc.
Memoryless search algorithms in a network with faulty advice, in: Theoretical Computer Science (TCS), 2008, vol. 402, p. 190-198
http://hal.archives-ouvertes.fr/hal-00341468/en/.
[110]: J. Hénin, C. Chipot.
Overcoming free energy barriers using unconstrained molecular dynamics simulations, in: Journal of Chemical Physics, 2004, vol. 121, p. 2904–2914.
[111]: B. Hong, V. Prasanna.
Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, in: International Parallel and Distributed Processing Symposium IPDPS'2004, IEEE Computer Society Press, 2004.
[112]: D. Ilcinkas, D. R. Kowalski, A. Pelc.
Fast Radio Broadcasting with Advice, in: SIROCCO 2008, Suisse Villars-sur-Ollon, A. A. Shvartsman, P. Felber (editors), Springer Berlin / Heidelberg, 2008, vol. 5058, p. 291-305
http://hal.archives-ouvertes.fr/hal-00341449/en/.
[113]: I. A. Kanj, L. Perković.
On Geometric Spanners of Euclidean and Unit Disk Graphs, in: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), HAL, February 2008, vol. hal-00231084, p. 409-420.
[114]: R. M. Karp, C. Schindelhauer, S. Shenker, B. Vöcking.
Randomized Rumor Spreading., in: FOCS, 2000, p. 565-574.
[115]: M. Katz, N. A. Katz, A. Korman, D. Peleg.
Labeling schemes for flow and connectivity, in: SIAM Journal on Computing, 2004, vol. 34, n^o 1, p. 23-40.
[116]: J. Kleinberg.
The Small-World Phenomenon: An Algorithmic Perspective, in: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), 2000, p. 163–170.
[117]: A. Korman.
General Compact Labeling Schemes for Dynamic Trees, in: 19th International Symposium on Distributed Computing (DISC), Springer, September 2005, vol. 3724 of Lecture Notes in Computer Science, p. 457-471.
[118]: A. Korman, D. Peleg.
Labeling Schemes for Weighted Dynamic Tree, in: 30th International Colloquium on Automata, Languages and Programming (ICALP), Springer, July 2003, vol. 2719 of Lecture Notes in Computer Science, p. 369-383.
[119]: D. Krioukov, K. Fall, X. Yang.
Compact Routing on Internet-Like Graphs, in: IEEE INFOCOM, 2004, To appear.
[120]: M. Laporte, N. Novelli, R. Cicchetti, L. Lakhal.
Computing Full and Iceberg Datacubes Using Partitions, in: ISMIS '02: Proceedings of the 13th International Symposium on Foundations of Intelligent Systems, London, UK, Springer-Verlag, 2002, p. 244–254.
[121]: A. Legrand, F. Mazoit, M. Quinson.
An Application-level network mapper, LIP, ENS Lyon, France, feb 2003, n^o RR-2003-09, Research Report.
[122]: S. Milgram.
The small world problem, in: Psychology Today, 1967, vol. 61, n^o 1.
[123]: D. Peleg.
Informative Labeling Schemes for Graphs, in: 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), Springer, August 2000, vol. 1893 of Lecture Notes in Computer Science, p. 579-588.
[124]: A. Slivkins.
Distance Estimation and Object Location via Rings of Neighbors, in: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2005, p. 41-50, Appears earlier as Cornell CIS technical report TR2005-1977.
[125]: M. Thorup, U. Zwick.
Compact Routing Schemes, in: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, July 2001, p. 1-10.
[126]: H. 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., États-Unis d'Amérique Miami, FL, 2008
http://hal.inria.fr/inria-00336186/en/.

Logo Inria