PUBLICATIONS I3S extraites de HAL au 17 mai 2012

Le menu de droite TYPES DE PUBLICATIONS vous permet d'accéder directement aux types de publications du pôle.
TYPES DE PUBLICATIONS
vers type de publication Articles avec comités de lecture
vers type de publication Communications internationales
vers type de publication Communications nationales
vers type de publication Ouvrages
vers type de publication Thèses et HDR
vers type de publication Brevets
vers type de publication Rapports de recherche
vers type de publication Communications sans comité de lecture
vers type de publication Autres

Publications du pôle COMRED

vers haut de page   ARTICLES AVEC COMITÉ DE LECTURE

S. Alouf, F. Huet, P. Nain
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
Performance Evaluation, 49(1-4), pp.299-319, 09/2002, hal-00641265

B. Amedro, D. Caromel, F. Huet, V. Bodnartchouk, C. Delbé, G. L. Taboada
HPC in Java: Experiences in Implementing the NAS Parallel Benchmarks
APPLIED INFORMATICS AND COMMUNICATIONS, 22/08/2010, inria-00504630

O. Amini, F. Giroire, F. Huc, S. Pérennes
Minimal selectors and fault tolerant networks
Networks, 55(4), pp.326-340, 2010, inria-00485848

O. Amini, F. Havet, F. Huc, S. Thomasse
WDM and Directed Star Arboricity
Combinatorics Probability & Computing, 19 pp.161-182, 2010, lirmm-00512776

O. Amini, F. Mazoit, N. Nisse, S. Thomasse
Submodular Partition Functions
Discrete Mathematics, 309 pp.6000-6008, 2009, lirmm-00432698

O. Amini, F. Mazoit, N. Nisse, S. Thomasse
Submodular Partition Functions
Discrete Mathematics, 309(20), pp.6000-6008, 2009, hal-00414326

C. André, F. Mallet
Modèle de contraintes temporelles pour systèmes polychrones
Journal Européen des Systèmes Automatisés, 7-9(43), pp.725-739, 30/06/2009, inria-00434462

C. André, F. Mallet
Les modèles de temps de MARTE et CCSL
Génie logiciel, (89), pp.44-49, 06/2009, inria-00416597

J. Araujo, N. Cohen, F. Giroire, F. Havet
Good edge-labelling of graphs.
Discrete Applied Mathematics, 2011, inria-00639005

M. Aste, F. Havet, C. Linhares Sales
Grundy number and products of graphs
Discrete Mathematics, 310(9), pp.1482--1490, 2010, inria-00496038

D. Barth, P. Berthomé, M. Diallo, A. Ferreira
Revisiting Parametric Multi-Terminal Problems: Maximum Flows, Minimum Cuts and Cut-tree Computations
Discrete Optimization, 3 (3) pp.195-205, 09/2006, hal-00126010

M. Basavaraju, L. S. Chandran, N. Cohen, F. Havet, T. Müller
Acyclic edge-coloring of planar graphs
SIAM Journal on Discrete Mathematics, 25(2), pp.436--478, 2011, inria-00638448

F. Baude, D. Caromel, C. Dalmasso, M. Danelutto, V. Getov, L. Henrio, C. Pérez
GCM: A Grid Extension to Fractal for Autonomous Distributed Components
Annals of Telecommunications, 2008, inria-00323919

F. Baude, D. Caromel, M. Leyton
File transfer in Grid applications at Deployment, Execution and Retrieval
Multiagent and Grid Systems, 3(4), pp.381-391, 2007, hal-00688655

N. Ben Ali, A. Belghith, J. Moulierac, M. Molnár
QoS multicast aggregation under multiple additive constraints
Computer Communications, 17/06/2008, inria-00425224

J.-C. Bermond, X. Muñoz, I. Sau
Traffic grooming in bidirectional WDM ring networks
Networks, 58(1), pp.20-35, 2011, hal-00643800

J.-C. Bermond, Y. Chee, N. Cohen, X. Zhang
The $\alpha$-Arboricity of Complete Uniform Hypergraphs
SIAM Journal on Discrete Mathematics, 2011, inria-00589689

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau
DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗
SIAM Journal on Discrete Mathematics, 24(2), pp.400-419, 2010, inria-00505516

J.-C. Bermond, F. Havet, F. Huc, C. Linhares Sales
Improper colouring of weighted grid and hexagonal graphs
Discrete Mathematics, Algorithms and Applications (DMAA)., 2(3), pp.395–411, 2010, inria-00526530

J.-C. Bermond, L. Gargano, A. Rescigno
GATHERING WITH MINIMUM COMPLETION TIME IN SENSOR TREE NETWORKS
Journal of Interconnection Networks, 11(1-2), pp.1-33, 2010, hal-00535816

J.-C. Bermond, M.-L. Yu
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
Ad Hoc and Sensor Wireless Networks, 9(1-2), pp.109-128, 2010, inria-00505517

J.-C. Bermond, R. Correa, M.-L. Yu
Optimal Gathering Protocols on Paths under Interference Constraints
Discrete Mathematics, 309(18), pp.5574-5587, 2009, inria-00429084

J.-C. Bermond, D. Coudert, B. Leveque
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring
Journal of Interconnection Networks, 9(4), pp.471-486, 2008, inria-00429217

J.-C. Bermond, A. Ferreira, S. Pérennes, J. Peters
Neighbourhood Broadcasting in Hypercubes
SIAM Journal on Discrete Mathematics, 21(4), pp.823-843, 2007, hal-00429191

J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the Path
Theoretical Computer Science, 384(2-3), pp.139-151, 2007, inria-00308716

J.-C. Bermond, M.-L. Yu
Vertex disjoint routings of cycles over tori
Networks, 49(3), pp.217-225, 2007, inria-00429086

J.-C. Bermond, F. Havet, C. Toth
Fault tolerant on board networks with priorities
Networks, 47(1), pp.9-25, 2006, inria-00430156

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Hardness and approximation of Gathering in static radio networks
Parallel Processing Letters, 16(2), pp.165-183, 2006, inria-00430158

J.-C. Bermond, C. J. Colbourn, D. Coudert, G. Ge, A. C. H. Ling, X. Munoz
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6
SIAM Journal on Discrete Mathematics, 19(2), pp.523-542, 2005, inria-00429214

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M.-L. Yu
Grooming in unidirectional rings : $K_4 -e$ designs.
Discrete Mathematics, 284(1-3), pp.57-62, 2004, inria-00505518

J.-C. Bermond, D. Coudert, M.-L. Yu
On DRC-covering of Kn by cycles
Journal of Combinatorial Designs, 11(2), pp.100 - 112, 2003, inria-00429205

J.-C. Bermond, É. Darrot, O. Delmas
Design of fault-tolerant networks for satellites (TWTA redundancy)
Networks, 40(4), pp.202--207, 2002, hal-00307611

J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton circuits in the directed wrapped Butterfly network
Discrete Applied Mathematics, 84(1-3), pp.21-42, 15/05/1998, hal-00407356

J.-C. Bermond, E. Darrot, O. Delmas, S. Pérennes
Hamilton Cycle Decomposition of the Butterfly Network
Parallel Processing Letters, 8(3), pp.371-385, 1998, hal-00407366

S. Bessy, E. Birmele, F. Havet
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory, 53(4), pp.315-332, 2006, lirmm-00153978

L. Blin, P. Fraigniaud, N. Nisse, S. Vial
Distributed Chasing of Network Intruders by Mobile Agents.
Theoretical Computer Science, 399 pp.12--37, 2008, hal-00341368

I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano
Fractional Path Coloring in Bounded Degree Trees with Applications
Algorithmica, 58(2), pp.516-540, 2010, hal-00371052

I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, H. Rivano
Approximate Constrained Bipartite Edge Coloring
Discrete Applied Mathematics, 143(1-3), pp.54--61, 2004, hal-00371101

D. Caromel, A. Di Costanzo, C. Delbe
Peer-to-Peer and Fault-tolerance: Towards Deployment-based Technical Services
Future Generation Computer Systems, pp.FGCS-D-06-00155, 2007, hal-00128505

D. Caromel, A. Di Costanzo, C. Mathieu
Peer-to-Peer for Computational Grids: Mixing Clusters and Desktop Machines
Parallel Computing, pp.Special issue for Large Scale Grid, 2007, hal-00125041

D. Caromel, G. Chazarain, L. Henrio
Garbage Collecting the Grid: A Complete DGC for Activities
Middleware 2007, LNCS 4834, 2007, inria-00180150

D. Caromel, C. Delbe, A. Di Costanzo, M. Leyton
ProActive: an Integrated platform for programming and running applications on grids and P2P systems
Computational Methods in Science and Technology, 12 pp.issue 1, 2006, hal-00125034

J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and ride
SIAM Journal on Discrete Mathematics, 25(1)(1), pp.333-359, 2011, inria-00622957

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Journal of Theoretical Computer Science (TCS), 2011, inria-00592507

N. Cohen, F. Havet
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree
Graphs and Combinatorics, 27(6), pp.831--849, 2011, inria-00638460

R. Correa, F. Havet, J.-S. Sereni
About a Brooks-type theorem for improper colouring
The Australasian Journal of Combinatorics, 43 pp.219--230, 01/2009, inria-00223009

R. Correa, F. Havet, J.-S. Sereni
About a Brooks-type theorem for improper colouring.
Australasian Journal of Combinatorics, 43 pp.219--230, 2009, inria-00496419

D. Coudert, J.-S. Sereni
Characterization of graphs and digraphs with small process number
Discrete Applied Mathematics, 159(11), pp.1094-1109, 06/07/2011, inria-00587717

D. Coudert, F. Giroire, I. Sau
Circuits in graphs through a prescribed set of ordered vertices
Journal of Interconnection Networks, 11(3-4), pp.121-141, 2011, inria-00585561

D. Coudert, F. Huc, D. Mazauric
A Distributed Algorithm for Computing the Node Search Number in Trees
Algorithmica, 2011, inria-00587819

D. Coudert, N. Nepomuceno, H. Rivano
Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks
Computer Communications, 33(8), pp.898-906, 2010, inria-00466477

D. Coudert, F. Huc, J.-S. Sereni
Pathwidth of outerplanar graphs
Journal of Graph Theory, 55(1), pp.27 - 41, 2007, inria-00429216

D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge
Shared Risk Resource Group: Complexity and Approximability issues
Parallel Processing Letters, 17(2), pp.169-184, 2007, hal-00371100

D. Coudert, A. Ferreira, S. Perennes
Isomorphisms of the De Bruijn digraph and free-space optical networks
Networks, 40(3), pp.155 - 164, 10/2002, inria-00429201

D. Coudert, A. Ferreira, X. Munoz
A multihop multi-OPS optical interconnection network
Journal of Lightwave Technology / IEEE/OSA Journal of Lightwave Technology; IEEE Journal of Lightwave Technology, 18(12), pp.2076 - 2085, 12/2000, inria-00429200

D. Coudert, A. Ferreira, X. Munoz
Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System
OSA Applied Optics -- Information Processing, 39(17), pp.2965-2974, 06/2000, inria-00429198

L. Cucu, N. Pernet, Y. Sorel
Periodic real-time scheduling: from deadline-based model to latency-based model
Annals of Operations Research, 159(1), pp.41-51, 2008, inria-00192221

O. Dalle, G. Wainer, L. Qi, Z. Bernard P.
Applying Cellular Automata and DEVS Methodologies to Digital Games: A Survey
Simulation & Gaming, 13/08/2010, inria-00530927

O. Delmas, B. Beauquier
Tight bounds for broadcasting in the linear cost model
Journal of Interconnection Networks, 2(2), pp.175-188, 2001, hal-00407385

S. Demathieu, Y. Bernard, L. Maillet-Contoz, M. Bordin, F. Mallet
Mise en œuvre du MDE pour la conception de systèmes embarqués: premiers résultats et perspectives du projet Lambda
Génie logiciel, (93), pp.38-42, 06/2010, inria-00545266

N. Eggemann, F. Havet, S. Noble
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.
Discrete Applied Mathematics, 158(16), pp.1777-1788, 2010, inria-00534520

R. Erman, F. Havet, B. Lidický, O. Pangrac
5-colouring graphs with 4 crossings
SIAM Journal on Discrete Mathematics, 25(1), pp.401-211, 2011, inria-00638434

A. Ferreira, A. Goldman, J. Monteiro
Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs
Wireless Networks, 16(3), pp.627-640, 04/2010, inria-00496219

A. Ferreira
Uma estratégia face à Revolução Digital
Teoria e Debate, 87(Mar/Avr), pp.20 - 23, 2010, inria-00510741

A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks
Telecommunication Systems, 24(2), pp.123--138, 2003, hal-00371107

A. Ferreira, J. Galtier, J.-N. Petit, H. Rivano
Re-routing algorithms in a meshed satellite constellation
Annals of Telecommunications, 56(3/4), pp.169--174, 2001, hal-00371111

F. V. Fomin, P. A. Golovach, J. Kratochvil, N. Nisse, K. Suchan
Pursuing a fast robber on a graph
Theoretical Computer Science, 411(7-9), pp.1167-1181, 2010, inria-00476686

F. Fomin, P. Fraigniaud, N. Nisse
Non-Deterministic Graph Searching: From Pathwidth to Treewidth
Algorithmica, 53(3), pp.358-373, 03/2009, hal-00421417

P. Fraigniaud, N. Nisse
Monotony Properties of Connected Visible Graph Searching
Information and Computation, 206(12), pp.1383-1393, 12/2008, hal-00421416

C. Gavoille, D. Peleg, S. Perennes, R. Raz
Distance Labeling in Graphs
Journal of Algorithms, 53 pp.85-112, 2004, hal-00307381

F. Giroire
Order statistics and estimating cardinalities of massive data sets
Discrete Applied Mathematics, 157(2), pp.406-427, 2009, hal-00646123

F. Havet, B. Reed, J.-S. Sereni
Griggs and Yeh's Conjecture and L(p,1)-labelings
Siam Journal on Discrete Mathematics, 26(1), pp.145--168, 02/2012, inria-00327909

F. Havet, S. Jendrol', R. Sotak, E. Skrabulakova
Facial non-repetitive edge-colouring of plane graphs
Journal of Graph Theory, 66(1), pp.38--48, 2011, inria-00638439

F. Havet, D. Král', J.-S. Sereni, R. Skrekovski
Facial colorings using Hall's Theorem
European Journal of Combinatorics, 31(3), pp.1001--1019, 04/2010, hal-00487100

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff
Exact Algorithms for L(2,1)-Labeling of Graphs
Algorithmica, pp.to appear, 2010, hal-00460873

F. Havet, R. Kang, J.-S. Sereni
Improper Colouring of Unit Disk Graphs
Networks, 54(3), pp.150--164, 2009, inria-00496436

F. Havet, R. Kang, T. Müller, J.-S. Sereni
Circular choosability
Journal of Graph Theory, 61(4), pp.241--270, 2009, inria-00496432

F. Havet, S. Thomasse
Complexity of $(p,1)$-Total Labelling
Discrete Applied Mathematics, 157 pp.2859-2870, 2009, lirmm-00432700

F. Havet, S. Thomasse
Complexity of $(p,1)$-total labelling
Discrete Applied Mathematics, 157 pp.2859--2870, 2009, inria-00496441

F. Havet
Choosability of the square of planar subcubic graphs with large girth
Discrete Mathematics, 309 pp.3553--3563, 2009, inria-00496423

F. Havet, J.-S. Sereni, R. Skrekovski
3-facial colouring of plane graphs
SIAM Journal on Discrete Mathematics, 22(1), pp.231--247, 20/02/2008, inria-00083533

F. Havet, S. Thomasse, A. Yeo
The Hoàng-Reed Conjecture holds for tournaments
Discrete Mathematics, 308 pp.3412-3415, 2008, lirmm-00292710

D. Ilcinkas, N. Nisse, D. Soguet
The Cost of Monotonicity in Distributed Graph Searching
Distributed Computing, 22(2), pp.117-127, 2009, hal-00412063

F. Mallet, C. André, R. De Simone
Logical Time: observation vs. implementation
ACM SIGSOFT Software Engineering Notes, 36(1), pp.1--8, 01/2011, inria-00576647

F. Mallet, C. André, F. Lagarde
Un processus automatique pour concevoir les profils UML
Technique et Science Informatiques (TSI), 29(5), pp.391-419, 05/2010, inria-00482745

F. Mallet, J. Deantoni, C. André, R. De Simone
The Clock Constraint Specification Language for building timed causality models
Innovations in Systems and Software Engineering, 6(1-2), pp.99-106, 03/2010, inria-00464894

F. Mallet
CCSL: specifying clock constraints with UML/MARTE
Innovations in Systems and Software Engineering, 4(3), pp.309-314, 2008, inria-00371371

F. Mazoit, N. Nisse
Monotonicity of non-deterministic graph searching
Journal of Theoretical Computer Science (TCS), 399 pp.169--178, 06/2008, hal-00306321

N. Nisse
Connected Graph Searching in Chordal Graphs
Discrete Applied Mathematics, 157(12), pp.2603-2610, 28/06/2009, hal-00421414

N. Nisse, D. Soguet
Graph Searching with Advice
Theoretical Computer Science, 410(14), pp.1307-1318, 28/03/2009, hal-00421415

P. Rosenstiehl, J.-C. Bermond
Pancyclisme du carré du graphe aux arêtes d'un graphe
Cahier du C.E.R.O., 15(3), pp.285-286, 1973, hal-00259599

P. Rosenstiehl, J.-C. Bermond
Pancyclisme du carré du graphe aux arêtes d'un graphes
Colloque sur la théorie des graphes, pp.2, 1973, hal-00259605

S. Thomasse, F. Havet, L. Addario-Berry
Paths with two blocks in n-chromatic digraphs
Journal of Combinatorial Theory Series B, 97 pp.620-626, 2007, lirmm-00197151

vers haut de page   COMMUNICATIONS INTERNATIONALES

A. Albinet, J.-L. Boulanger, H. Dubois, M.-A. Peraldi-Frati, Y. Sorel, Q.-D. Van
Model-Based Methodology for Requirements Traceability in Embedded Systems
Proceedings of 3rd European Conference on Model Driven Architecture® Foundations and Applications, ECMDA'07, 2007, Haifa, Israël, inria-00413488

S. Alouf, F. Huet, P. Nain
Forwarders vs. centralized server: an evaluation of two approaches for locating mobile agents
Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 15/06/2002, Marina Del Rey, California, États-Unis, Proceedings of ACM SIGMETRICS 2002, 30, pp.278-279, ACM SIGMETRICS Performance Evaluation Review, hal-00641394

B. Amedro, F. Baude, F. Huet, E. Mathias
Combining Grid and Cloud Resources by Use of Middleware for SPMD Application
2nd International Conference on Cloud Computing Technology and Science, 30/11/2010, Indianapolis, IN, États-Unis, pp.177-184, inria-00538549

R. Ameur-Boulifa, L. Henrio, E. Madelaine
Behavioural models for group communications
Int. Workshop on Components and Service Interoperability (WCSI), 06/2010, Malaga, Espagne, pp.15 p., inria-00493692

O. Amini, J.-C. Bermond, F. Giroire, F. Huc, S. Pérennes
Design of Minimal Fault Tolerant Networks: Asymptotic Bounds
Algotel06, 05/2006, Tregastel, France, pp.169-174, hal-00512287

C. André, F. Mallet, J. Deantoni
VHDL Observers for Clock Constraint Checking
Symposium on Industrial Embedded Systems, 07/07/2010, trento, Italie, inria-00587107

C. André, F. Mallet
Specification and Verification of Time Requirements with CCSL and Esterel
Languages, Compilers, and Tools for Embedded Systems, 19/06/2009, Dublin, Irlande, ACM SIGPLAN Notices, 44, pp.167-176, inria-00416654

C. André, F. Mallet, M.-A. Peraldi-Frati
A multiform time approach to real-time system modeling: Application to an automotive system
IEEE Int. Symp. on Industrial Embedded Systems (SIES), 07/2007, Lisbon, Portugal, pp.234-241, inria-00204508

C. André, F. Mallet, M.-A. Peraldi-Frati
Multiform Time in UML for Real-time Embedded Applications
IEEE Int. Conf. on Real-Time Computing Systems and Applications (RTCSA), 08/2007, Daegu, Corée, République De, pp.232-237, inria-00204503

C. André, F. Mallet, R. De Simone
Modeling Time(s)
ACM/IEEE Int. Conf. on Model Driven Engineering Languages and Systems (MoDELS/UML), 10/2007, Nashville, TN, États-Unis, MoDELS, LNCS 4735, pp.pp. 559-573, Lecture Notes in Computer Sciences, inria-00204489

C. André, F. Mallet, R. De Simone
Modeling of Immediate vs. Delayed Data Communications: from AADL to UML MARTE
ECSI Forum on specification & Design Languages (FDL), 09/2007, Barcelona, Espagne, pp.249-254, inria-00204484

C. André, F. Mallet, R. De Simone
Time Modeling in MARTE
ECSI Forum on specification & Design Languages (FDL), 09/2007, Barcelona, Espagne, pp.268-273, inria-00204481

J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski
Weighted Improper Colouring
22th International Workshop, IWOCA 2011, 20/07/2011, Victoria, Canada, inria-00635882

J. Araujo, F. Giroire, J. Monteiro
Hybrid Approaches for Distributed Storage Systems
Fourth International Conference on Data Management in Grid and P2P Systems (Globe 2011), 01/09/2011, Toulouse, France, inria-00635781

J. Araújo, V. Campos, F. Giroire, L. Sampaio, R. Pardo Soares
On the hull number of some graph classes
European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11), 29/08/2011, Budapest, Hongrie, inria-00635032

D. Barman, J. Chandrashekar, N. Taft, M. Faloutsos, L. Huang, F. Giroire
Impact of IT Monoculture on Behavioral End Host Intrusion Detection
ACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN, 21/08/2009, Barcelona, Espagne, pp.27--36, inria-00546878

F. Baude, L. Henrio, P. Naoumenko
A Component Platform for Experimenting with Autonomic Composition
First International Conference on Autonomic Computing and Communication Systems (Autonomics 2007), 28/10/2007, Rome, Italie, inria-00178365

F. Baude, D. Caromel, R. Quilici
Grid File Transfer during Deployment
On the Move to Meaningful Internet Systems 2006, 29/10/2006, Montpellier, France, 4276, pp.1191-1202, Lecture Notes in Computer Science, hal-00688861

F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round.
25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2011, Anchorage, États-Unis, pp.508-514, inria-00622976

S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri
Reconfiguration avec contraintes physiques dans les réseaux WDM
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France, inria-00583829

M. E. M. Ben Gaïd, R. Kocik, Y. Sorel, R. Hamouche
A Methodology for Improving Software Design Lifecycle in Embedded Control Systems
Design, Automation and Test in Europe, 10/03/2008, Munich, Allemagne, inria-00274634

J.-C. Bermond, L. Gargano, S. Pérennes, A. Rescigno, U. Vaccaro
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas
SIROCCO2011, 26/06/2011, Gdansk, Pologne, Lecture Notes in Computer Science - LNCS, inria-00589687

J.-C. Bermond, D. Mazauric, V. Misra, P. Nain
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.
Sigmetrics 2010, 14/06/2010, New York, États-Unis, inria-00505519

J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, H. Rivano, I. Sau, F. Solano Donado
MPLS label stacking on the line network
IFIP Networking, 11/05/2009, Aachen, Allemagne, pp.809-820, LNCS 5550/2009, hal-00371115

J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
Designing Hypergraph Layouts to GMPLS Routing Strategies
SIROCCO, 25/05/2009, Piran, Slovénie, inria-00428685

J.-C. Bermond, D. Mazauric, P. Nain
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.
JDIR 2009, 02/2009, Belfort, France, inria-00505521

J.-C. Bermond, E. Altman, P. Nain
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.
INFOCOM 2009, 19/04/2009, Rio de janeiro, Brésil, pp.1431-1439, inria-00505520

J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Fast Data Gathering in Radio Grid Networks
AlgoTel, 2009, Carry-Le-Rouet, France, inria-00376040

J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Minimum delay Data Gathering in Radio Networks
8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),, 23/09/2009, Murcia, Espagne, 5793, pp.69-82,, Lecture Notes in Computer Science,, inria-00505522

J.-C. Bermond, M.-L. Yu
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
AD-HocNow 08, 10/09/2008, Nice, France, 5198, pp.204-217, Lecture Notes in Computer Science, hal-00512281

J.-C. Bermond, L. Gargano, A. Rescigno
Gathering with minimum delay in tree sensor networks
SIROCCO 2008,, 06/2008, Villars-sur-Ollon, Suisse, 5058, pp.262-276, Lecture Notes in Computer Science, inria-00505523

J.-C. Bermond, F. Giroire, S. Pérennes
Design of Minimal Fault Tolerant On-Board Networks : Practical constructions
SIROCCO07, 06/2007, Castiglioncello, Italie, 4474, pp.261-273, Lecture Notes in Computer Science,, hal-00512282

J.-C. Bermond, M. Cosnard
Minimum number of wavelengths equals load in a DAG without internal cycle
IPDPS07, 03/2007, Long beach, CA, États-Unis, pp.1-10, hal-00512284

J.-C. Bermond, R. Correa, M.-L. Yu
Gathering algorithms on paths under interference constraints
CTAC06, 05/2006, Roma, Italie, 3998, pp.115-126, Lecture Notes in Computer Science, hal-00512286

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Hardness and approximation of Gathering in static radio networks
FAWN06, 03/2006, Italie, pp.75--79, hal-00344619

J.-C. Bermond, D. Coudert, X. Munoz, I. Sau
Traffic Grooming in Bidirectional WDM Ring Networks
International Conference on Transparent Optical Networks (ICTON), 06/2006, Nottingham, Royaume-Uni, 3, pp.19 - 22, inria-00429168

J.-C. Bermond, M. Cosnard, D. Coudert, S. Perennes
Optimal Solution of the Maximum All Request Path Grooming Problem
Advanced International Conference on Telecommunications (AICT), 19/02/2006, Le Gosier, Guadeloupe, France, inria-00429167

J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the Path
12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 24/05/2005, Mont Saint-Michel, France, SIROCCO, pp.34-48, Lecture Notes in Computer Science, inria-00429172

J.-C. Bermond, D. Coudert, X. Munoz
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case
7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hongrie, pp.1135-1153, inria-00429175

J.-C. Bermond, D. Coudert
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory
IEEE International Conference on Communications (ICC '03)., 05/2003, Anchorage, États-Unis, 2, pp.1402 - 1406, inria-00429174

J.-C. Bermond, D. Coudert, L. Chacon, F. Tillerot
A note on cycle covering
ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Grèce, pp.310-311, inria-00429182

J.-C. Bermond, L. Chacon, D. Coudert, F. Tillerot
Cycle Covering
8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 27/06/2001, Vall de Nuria, Espagne, pp.21-34, Proceedings in Informatics, inria-00429183

S. Bezinne, V. Galtier, S. Vialle, F. Baude, M. Bossy, V. Dung, L. Henrio
A Fault Tolerant and Multi-Paradigm Grid Architecture for Time Constrained Problems. Application to Financial Option Pricing
2nd IEEE International Conference on e-Science and Grid Computing - e-science'06, 12/2006, Amsterdam, Pays-Bas, pp.49, inria-00121828

L. Blin, J. Burman, N. Nisse
Nettoyage perpétuel de réseaux
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp.4, hal-00687134

M. Bouklit, D. Coudert, J.-F. Lalande, C. Paul, H. Rivano
Approximate Multicommodity Flow for WDM Networks Design
SIROCCO'03: Colloquium on Structural Information and Communication Complexity, Umeä (Sweden), pp.pp. 43-56, lirmm-00269524

B. Bui Xuan, A. Ferreira, A. Jarry
Evolving graphs and least cost journeys in dynamic networks
WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 03/03/2003, Sophia Antipolis, France, pp.10 pages, inria-00466676

C. Caillouet, N. Nisse, F. Huc, S. Pérennes, H. Rivano
Stability of a Localized and Greedy Routing Algorithm
12th IEEE Workshop in Parallel and Distributed Computational Models (IEEE APDCM 2010), in conjunction with IPDPS 2010, 19/04/2010, Atlanta, États-Unis, inria-00466484

A. Cansado, L. Henrio, E. Madelaine
Transparent First-class Futures and Distributed Components
5th workshop on Formal Aspects of Component Systems, 10/09/2008, Málaga, Espagne, inria-00311515

A. Cansado, L. Henrio, E. Madelaine
Unifying Architectural and Behavioural Specifications of Distributed Components
5th workshop on Formal Aspects of Component Systems, 10/09/2008, Málaga, Espagne, inria-00311516

I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, H. Rivano
Fractional path coloring on bounded degree trees
Proceedings of the 28th ICALP, 07/2001, Grèce, 2076, pp.732--743, Lecture Notes in Computer Science, hal-00429854

D. Caromel, L. Mateu, E. Tanter
Sequential Object Monitors
18th European Conference on Object-Oriented Programming, 2004, Oslo, Norway, Norvège, 3086, pp.316-340, lncs, hal-00457132

S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
Data Life Time for Different Placement Policies in P2P Storage Systems
Conference on Data Management in Grid and P2P Systems (Globe 2010), 09/2010, Bilbao, Espagne, LNCS 6265, pp.75--88, inria-00496222

S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
P2P Storage Systems: Data Life Time for Different Placement Policies
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France, inria-00479537

A. Casteigts, S. Chaumette, A. Ferreira
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
16th International Colloquium on Structural Information and Communication Complexity (SIROCCO'09), 25/05/2009, Piran, Slovénie, 5869, pp.129--144, Lecture Notes in Computer Science, hal-00408054

G. Classen, D. Coudert, A. Koster, N. Nepomuceno
A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks
Internationale Network Optimization Conference (INOC), 13/06/2011, Hamburg, Allemagne, Lecture Notes in Computer Science, inria-00587669

G. Classen, D. Coudert, A. Koster, N. Nepomuceno
Bandwidth assignment for reliable fixed broadband wireless networks
12th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), 20/06/2011, Lucca, Italie, inria-00587698

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Fifth International conference on Fun with Algorithms (FUN 2010), 02/06/2010, Ischia, Italie, 6099, pp.121-132, Lecture Notes in Computer Science, inria-00495443

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs in routing reconfiguration problems
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France, inria-00477413

D. Coudert, N. Nepomuceno, I. Tahiri
Energy saving in fixed wireless broadband networks
Internationale Network Optimization Conference (INOC), 13/06/2011, Hamburg, Allemagne, Lecture Notes in Computer Science, inria-00587685

D. Coudert, N. Nepomuceno, I. Tahiri
Optimisation de la consommation énergétique dans les réseaux sans fil fixes
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France, inria-00588129

D. Coudert, D. Mazauric, N. Nisse
On Rerouting Connection Requests in Networks with Shared Bandwidth
DIMAP Workshop on Algorithmic Graph Theory (AGT), 2009, Warwick, Royaume-Uni, Electronic Note Discrete Maths., 32, inria-00423452

D. Coudert, F. Giroire, I. Sau
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids
International Workshop on Combinatorial Algorithms -- IWOCA, 28/06/2009, Hradec nad Moravicì, Tchèque, République, 5874, Lecture Notes in Computer Science, inria-00429146

D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Reconfiguration dans les réseaux optiques
11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France, inria-00383206

D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Reconfiguration of the Routing in WDM Networks with Two Classes of Services
Conference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Allemagne, inria-00423453

D. Coudert, N. Nepomuceno, H. Rivano
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks
AlgoTel, 2009, Carry-Le-Rouet, France, inria-00384968

D. Coudert, N. Nepomuceno, H. Rivano
Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks
1st IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), 06/2009, Kos, Grèce, inria-00429148

D. Coudert, F. Huc, D. Mazauric
A distributed algorithm for computing and updating the process number of a forest
22nd International Symposium on Distributed Computing (DISC), 2008, Arcachon, France, France, 5218, pp.500-501, inria-00373850

D. Coudert, F. Huc, D. Mazauric
Computing and updating the process number in trees
12th International Conference On Principles Of DIstributed Systems (OPODIS), 12/2008, Luxor, Égypte, 5401, Lecture Notes in Computer Science, inria-00429149

D. Coudert, F. Huc, F. Peix, M.-E. Voge
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
IEEE International Conference on Communications (ICC '08), 05/2008, Beijing, Chine, pp.5170 - 5174, inria-00429150

D. Coudert, S. Pérennes, H. Rivano, M.-E. Voge
Shared Risk Resource Groups and Survivability in Multilayer Networks
International Conference on Transparent Optical Networks (ICTON), 06/2006, Nottingham, Royaume-Uni, 3, pp.235 - 238, inria-00429170

D. Coudert, H. Rivano, X. Roche
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
International Workshop on Approximation and Online Algorithms (WAOA'03), 2003, Budapest, Hongrie, Approximation and Online Algorithms, 2909, pp.193-230, Lecture Notes in Computer Science, inria-00429176

D. Coudert, H. Rivano
Lightpath assignment for multifibers WDM networks with wavelength translators
IEEE Global Telecommunications Conference (Globecom'02), 2002, Taipei, Taïwan, Province De Chine, 3, pp.2686 - 2690, inria-00429177

D. Coudert, X. Munoz
How Graph Theory can help Communications Engineering
Broad band optical fiber communications technology (BBOFCT), 12/2001, Jalgaon, Inde, pp.47-61, inria-00429187

D. Coudert, A. Ferreira, S. Perennes
De Bruijn isomorphisms and free space optical networks
14th International Parallel and Distributed Processing Symposium (IPDPS 2000), 01/05/2000, Cancun, Mexique, pp.769 - 774, inria-00429190

D. Coudert, A. Ferreira, X. Munoz
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks
3rd Workshop on Optics and Computer Science (WOCS), 04/1999, San Juan, Porto Rico, 1586, pp.897-910, Lecture Notes in Computer Science, inria-00429192

D. Coudert, A. Ferreira, X. Munoz
Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control
First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP 1998), 30/03/1998, Orlanda, États-Unis, pp.151 - 155, inria-00429196

L. Cucu-Grosjean, Y. Sorel
An exact schedulability test for real-time dependant periodic task systems with latency constraints
Models and Algorithms for Planning and Scheduling Problems - MAPSP'09, 29/06/2009, Abbey Rolduc, Pays-Bas, inria-00432976

S. Cussat-Blanc, F. Viale, H. Luga, Y. Duthen, D. Caromel
Genetic algorithms and grid computing for artificial embryogeny
GECCO '08 Proceedings of the 10th annual conference on Genetic and evolutionary computation, 12/07/2008, Atlanta, États-Unis, hal-00687153

O. Dalle, E. P. Mancini
Integrated Tools for the Simulation Analysis of Peer-To-Peer Backup Systems
SIMUTOOLS 2012, 19/03/2012, Sirmione, Italie, hal-00669241

O. Dalle, E. Mancini
Traces Generation To Simulate Large-Scale Distributed Applications
Winter Simulation Conference, 12/2011, Phoenix, AZ, États-Unis, pp.10p., inria-00638561

O. Dalle, J. Ribault
Some Desired Features for the DEVS Architecture Description Language
Symposium On Theory of Modeling and Simulation -- DEVS Integrative M\&S Symposium (TMS/DEVS 2011), 04/2011, Boston, MA, États-Unis, pp.10p., inria-00638565

O. Dalle, E. P. Mancini
Traces Generation to Simulate Large-Scale Distributed Applications
Winter Simulation Conference, 11/12/2011, Phoenix, AZ, États-Unis, inria-00634620

O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair
AlgoTel, 2009, Carry-Le-Rouet, France, inria-00384822

O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems
9th IEEE International Conference on Peer-to-Peer Computing (P2P), 09/2009, Seattle, États-Unis, pp.184--193, inria-00485847

O. Dalle, J. Ribault, J. Himmelspach
Design considerations for M&S software
Winter Simulation Conference (WSC'09), 13/12/2009, Austin, États-Unis, Proceedings of the 2009 Winter Simulation Conference, pp.944 - 955, inria-00425153

J. Deantoni, F. Mallet
TimeSquare: Treat your Models with Logical Time
Tools 2012: 50th International Conference on Objects, Models, Components, Patterns, 29/05/2012, Prague, Tchèque, République, LNCS proceedings, 7304, pp.34-41, hal-00688590

J. Deantoni, F. Mallet, F. Thomas, G. Reydet, J.-P. Babau, C. Mraidha, L. Gauthier, L. Rioux, N. Sordon
RT-simex: retro-analysis of execution traces
SIGSOFT FSE, 07/11/2010, Santa Fe, États-Unis, Proceedings of the 18th ACM SIGSOFT International Symposium on Foundations of Software Engineering, ISBN 978-1-60558-791-2, pp.377-378, inria-00587116

H. Dubois, M.-A. Peraldi-Frati, L. Fadoi
A model for requirements traceability in an heterogeneous model-based design process. Application to automotive embedded systems
ICECCS'10, 22/03/2010, Oxford, Royaume-Uni, 15th IEEE International Conference on Engineering of Complex Computer Systems, ISBN:978-0-7695-4015-3, pp.233-242, inria-00484073

V. Dung Doan, A. Gaikwad, F. Baude, M. Bossy
"Gridifying" Classification-Monte Carlo algorithm for pricing high-dimensional Bermudan-American options
Workshop on high performance computational finance, WHPCF Austin, TX - November 16th, 2008, 16/11/2008, Austin, États-Unis, pp.1-8, hal-00605774

A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
Models, complexity and algorithms for the design of multifiber WDM networks
10th International Conference on Telecommunications, 2003 (ICT 2003), 23/02/2003, France, pp.12-18, hal-00429845

A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, N. Stier Moses
On the design of multifiber WDM networks
Algotel'02, 05/2002, Mèze, France, pp.25--32, hal-00429849

I. Filali, L. Pellegrino, F. Bongiovanni, F. Huet, F. Baude
Modular P2P-Based Approach for RDF Data Storage and Retrieval
Advances in P2P Systems, 20/11/2011, Lisbonne, Portugal, inria-00636408

I. Filali, F. Huet
Dynamic TTL-Based Search In Unstructured Peer-to-Peer Networks
CCGrid 2010, 17/05/2010, Melbourne, Australie, pp.10 p., inria-00485790

B. Florent, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Reconstruire un graphe en une ronde
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France, inria-00587250

F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse
Satisfaire un internaute impatient est difficile
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp...., hal-00687102

F. Fomin, P. Fraigniaud, N. Nisse
Non-Deterministic Graph Searching: From Pathwidth to Treewidth
Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005, Pologne, pp.364-375, hal-00421420

P. Fraigniaud, N. Nisse
Connected Treewidth and Connected Graph Searching
Latin American Theoretical Informatics Symposium (LATIN), 2006, Valdivia, Chili, inria-00423448

P. Fraigniaud, N. Nisse
Monotony Properties of Connected Visible Graph Searching
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006, Bergen, Norvège, inria-00423449

K. Garcés, J. Deantoni, F. Mallet
A Model-Based Approach for Reconciliation of Polychronous Execution Traces
SEAA 2011 - 37th EUROMICRO Conference on Software Engineering and Advanced Applications, 30/08/2011, Oulu, Finlande, inria-00597981

R. Gascon, F. Mallet, J. Deantoni
Logical time and temporal logics: comparing UML MARTE/CCSL and PSL
18th International Symposium on Temporal Representation and Reasoning (TIME'11), 12/09/2011, Lubeck, Allemagne, pp.--, hal-00597086

P. Giabbanelli, D. Mazauric, J.-C. Bermond
On the average path length of deterministic and stochastics recursive networks
CompletNet, 2010, Rio de Janeiro, Brésil, inria-00532890

F. Giroire, D. Mazauric, J. Moulierac
Routage efficace en énergie
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France, inria-00587944

F. Giroire, D. Mazauric, J. Moulierac, B. Onfroy
Minimizing Routing Energy Consumption: from Theoretical to Practical Results
IEEE/ACM International Conference on Green Computing and Communications (GreenCom), 18/12/2010, Hangzhou, Chine, pp.8, hal-00531468

F. Giroire, J. Monteiro, S. Pérennes
Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy
IEEE Global Communications Conference (GlobeCom), 12/2010, Miami, États-Unis, inria-00496221

F. Giroire, J. Monteiro, S. Pérennes
P2P Storage Systems: How Much Locality Can They Tolerate?
IEEE Conference on Local Computer Networks (LCN), 10/2009, Zurich, Suisse, pp.320--323, inria-00496220

F. Giroire, J. Chandrashekar, N. Taft, E. Schooler, K. Papagiannaki
Exploiting Temporal Persistence to Detect Covert Botnet Channels
The 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), 23/09/2009, Saint Malo, France, pp.326--345, inria-00546874

C. Glitia, J. Deantoni, F. Mallet
Logical time at work: capturing data dependencies and platform constraints
Forum for Design Languages (FDL), 14/09/2010, Southampton, Royaume-Uni, Proceedings of the 2010 Forum on specification & Design Languages, pp.240-246, inria-00545866

D. Gonçalves, F. Havet, A. Pinlou, S. Thomassé
Spanning galaxies in digraphs
European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), 07/09/2009, Bordeaux, France, 34, pp.139-143, Electronic Notes in Discrete Mathematics, lirmm-00433050

N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
Comment battre la marche aléatoire en comptant ?
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France, inria-00475863

N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
Locating a Target with an Agent Guided by Unreliable Local Advice
PODC 2010, 07/2010, Zurich, Suisse, pp.355-364, hal-00516695

F. Havet, J. Bang-Jensen, N. Trotignon
Finding an induced subdivision of a digraph
VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), 04/2011, Bariloche, Argentine, 37, pp.09--14, inria-00638464

F. Havet, L. Sampaio
On the Grundy number of a graph
Fifth International Symposium on Parameterized and Exact Computation (IPEC 2010), 13/12/2010, Chennai, Inde, Parameterized and Exact Computation, 6478, pp.170--179, inria-00532906

F. Havet, B. Reed, J.-S. Sereni
L(2,1)-labelling of graphs
ACM-SIAM symposium on Discrete algorithms (SODA 2008), 20/01/2008, San Francisco, California, États-Unis, pp.621-630, inria-00486183

L. Henrio, F. Huet, Z. István, G. Sebestyén
Adapting Active Objects to Multicore Architectures
ISPDC, 06/07/2011, Cluj, Roumanie, hal-00644169

L. Henrio, M. U. Khan
Asynchronous Components with Futures: Semantics and Proofs in Isabelle/HOL
7th International Workshop on Formal Engineering approaches to Software Components and Architectures, 27/03/2010, Paphos, Chypre, pp.1-20, inria-00462325

L. Henrio, F. Kammüller, M. U. Khan
A Framework for Reasoning on Component Composition
FMCO, 04/11/2009, Eindhoven, Pays-Bas, inria-00490380

L. Henrio, M. U. Khan, N. Ranaldo, E. Zimeo
First Class Futures: Specification and implementation of Update Strategies
CoreGRID/ERCIM Workshop on Grids, Clouds and P2P Computing, 31/08/2010, Ischia - Naples, Italie, Euro-Par 2010 - Parallel Processing Workshops VHPC, HeteroPar, HPPC, HiBB, CoreGrid, UCHPC, HPCF, XtreemOS, PROPER, and CCPI, inria-00544594

L. Henrio, F. Kammüller, M. Rivera
An Asynchronous Distributed Component Model and Its Semantics
FMCO - 08, 2008, Sophia antiopolis, France, inria-00435145

L. Henrio, F. Kammüller
Functional Active Objects: Typing and Formalisation
Foundations of Coordination Languages and Software Architectures (FOCLASA'09), 2010, France, pp.83-101, hal-00485759

B. Jaumard, N. Nahar Bhuiyan, S. Sebbah, F. Huc, D. Coudert
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks
11th International Conference on High Performance Switching and Routing (HPSR), 13/06/2010, Richardson, Texas, USA, Canada, pp.8, inria-00482119

B. Jaumard, N. Nahar Bhuiyan, S. Sebbah, F. Huc, D. Coudert
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks
10th INFORMS Telecommunications Conference, 05/05/2010, Montréal, Canada, inria-00482121

O. Kermia, Y. Sorel
Load Balancing and Efficient Memory Usage for Homogeneous Distributed Real-Time Embedded Systems
Proceedings of the 4th International Workshop on Scheduling and Resource Management for Parallel and Distributed Systems, SRMPDS'08, 2008, Portland, Oregon, États-Unis, inria-00413485

O. Kermia, Y. Sorel
A Rapid Heuristic for Scheduling Non-Preemptive Dependent Periodic Tasks onto Multiprocessor
Proceedings of ISCA 20th International Conference on Parallel and Distributed Computing Systems, PDCS'07, 2007, Las Vegas, Nevada, États-Unis, inria-00413486

A. Kosowski, B. Li, N. Nisse, K. Suchan
$k$-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La Grande Motte, France, pp...., hal-00687120

S. Kuntz, M.-A. Peraldi-Frati, H. Blom, K. Daniel
Timing Modeling with AUTOSAR. Current State and Future Directions
DATE 2012. Design Automation & Test in Europe, 12/03/2012, Dresden, Allemagne, hal-00667070

J.-F. Le Tallec, J. Deantoni, R. De Simone, B. Ferrero, F. Mallet, L. Maillet-Contoz
Combining SystemC, IP-XACT and UML/MARTE in model-based SoC design
Workshop on Model Based Engineering for Embedded Systems Design (M-BED 2011), 18/03/2011, Grenoble, France, inria-00601840

S.-Y. Lee, F. Mallet, R. De Simone
Dealing with AADL end-to-end Flow Latency with UML Marte.
ICECCS - UML&AADL, 02/04/2008, Belfast, Irlande, pp.228-233, inria-00371400

M. Leyton, L. Henrio, J. Piquer
Exceptions for Algorithmic Skeletons
16th Int. European Conference on Parallel and Distributed Computing (Euro-Par 2010), 2010, Italie, pp.??, hal-00486108

S. Malik, F. Huet
Virtual Cloud: Rent Out the Rented Resources
6th IEEE International Conference for Internet Technology and Secured Transactions (ICITST-2011), 11/12/2011, Abu Dhabi, Émirats Arabes Unis, hal-00641398

S. Malik, F. Huet
Adaptive Fault Tolerance in Real Time Cloud Computing
2011 IEEE World Congress on Services, 04/07/2011, Washington DC, États-Unis, hal-00639904

F. Mallet, F. Lagarde, C. André, S. Gérard, F. Terrier
An Automated Process for Implementing Multilevel Domain Models
Software Language Engineering, 05/10/2009, Denver, Colorado, États-Unis, pp.314-333, Lecture Note in Computer Sciences, inria-00464880

F. Mallet, C. André, J. Deantoni
Executing AADL models with UML/Marte
Int. Conf. Engineering of Complex Computer Systems - ICECCS'09, 02/06/2009, Potsdam, Allemagne, pp.pp. 371-376, inria-00416592

F. Mallet, C. André
On the semantics of UML/Marte Clock Constraints
Int. Symp. on Object/component/service-oriented Real-time distributed Computing (ISORC'09), 03/2009, Tokyo, Japon, pp.301-312, inria-00383279

F. Mallet, M.-A. Peraldi-Frati, C. André
Marte CCSL to execute East-ADL Timing Requirements
Int. Symp. on Object/component/service-oriented Real-time distributed Computing (ISORC'09), 03/2009, Tokyo, Japon, pp.249-253, inria-00383262

F. Mallet, R. De Simone, L. Rioux
Event-based vs. Time-Triggered Communications with UML Marte
Forum on specification, verification & Design Languages (FDL'08), 23/09/2008, Stuttgart, Allemagne, pp.154-159, inria-00371392

F. Mallet, R. De Simone
MARTE: A Profile for RT/E Systems Modeling, Analysis (and Simulation?)
First International Conference on Simulation Tools and Techniques for Communications, Networks and Systems SIMUTools'08, 03/03/2008, Marseille, France, pp.1-8, inria-00371397

F. Mallet, M.-A. Peraldi-Frati, C. André
From UML to Petri Nets for non functional Property Verification
IEEE International Symposium on Industrial Embedded Systems, 2006. IES '06., 18/10/2006, Sophia antipolis, France, inria-00371277

E. P. Mancini, G. Wainer, K. Al-Zoubi, O. Dalle
Simulation in the Cloud Using Handheld Devices
MSGC@CCGRID - Workshop on Modeling and Simulation on Grid and Cloud Computing - 2012, 13/05/2012, Ottawa, Canada, hal-00691248

M. Marouf, Y. Sorel
Schedulability conditions for non-preemptive hard real-time tasks with strict period
18th International Conference on Real-Time and Network Systems - RTNS 2010, 04/11/2010, Toulouse, France, pp.50-58, hal-00544496

M. Marouf, Y. Sorel
Schedulability conditions for non-preemptive hard real-time tasks with strict period
18th International Conference on Real-Time and Network Systems RTNS'10, 04/11/2010, Toulouse, France, Proceedings of 18th International Conference on Real-Time and Network Systems, RTNS'10, inria-00566359

J.-C. Maureira, P. Uribe, O. Dalle, J. Anaya, T. Asahi
Component based approach using OMNeT++ for Train Communication Modeling
ITS-T 2009, 19/10/2009, Lille., France, inria-00501882

J.-C. Maureira, O. Dalle, D. Dujovne
Generation of Realistic 802.11 Interferences in the Omnet++ INET Framework Based on Real Traffic Measurements
OMNeT++ Workshop / SIMUTools 2009, 06/03/2009, Rome, Italie, inria-00501885

P. Meumeu Yomsi, Y. Sorel
Extending Rate Monotonic Analysis with Exact Cost of Preemptions for Hard Real-Time Systems
Proceedings of 19th Euromicro Conference on Real-Time Systems, ECRTS'07, 2007, Pisa, Italie, inria-00413487

P. Meumeu Yomsi, Y. Sorel
Schedulability Analysis using Exact Number of Preemptions and No Idle Time for Real-Time Systems with Precedence and Strict Periodicity Constraints
Proceedings of 15th International Conference on Real-Time and Network Systems, RTNS'07, 2007, Nancy, France, inria-00413489

N. Nisse, I. Rapaport, K. Suchan
Distributed computing of efficient routing schemes in generalized chordal graphs
International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovénie, inria-00423454

N. Nisse, K. Suchan
Fast Robber in Planar Graphs
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2008, Durham, Royaume-Uni, inria-00423451

N. Nisse, D. Soguet
Graph Searching with advice
International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, Castiglioncello, Italie, inria-00423450

M.-A. Peraldi-Frati, A. Goknil, J. Deantoni, J. Nordlander
A timing model for specifying multi clock automotive systems. The Timing Augmented Description Language V2
Int. Conf. on Engineering of Complex Computer Systems,ICECCS, 18/07/2012, Paris, France, Proceeding of the 17th ICECCS conference, pp.10 pages, hal-00687562

M.-A. Peraldi-Frati, D. Karlsson, A. Hamann, S. Kuntz, J. Nordlander
The TIMMO-2-USE project: Time modeling and analysis to use
ERTS2012 International Congres on Embedded Real Time Software and Systems, 01/02/2012, Toulouse, France, 6th International Congres on Embedded Real Time Software and Systems, hal-00649781

M.-A. Peraldi-Frati, J. Deantoni
Scheduling Multi Clock Real Time Systems: From Requirements to Implementation
International Symposium on Object/Component/Service-oriented Real-time Distributed Computing, 28/03/2011, Newport Beach, États-Unis, IEEE international Symposium on Object/Component/service Oriented Real-Time Distributed Computing, pp.50; 57, inria-00586851

M.-A. Peraldi-Frati, A. ALBINET
Requirement traceability in safety critical systems
European Dependable Computing Conference, 26/04/2010, Valencia, Espagne, Proceeding of the 8th EDCC conference, pp.11-14, hal-00687550

M.-A. Peraldi-Frati, H. Dubois, F. Lakhal
A model for requirements traceability in an heterogeneous model-based design process
Int. Conf. on Engineering of Complex Computer Systems, 24/03/2010, Oxford, Royaume-Uni, 15th Proc. of the 15th Int. Conf. on Engineering of Complex Computer Systems, pp.233-242, hal-00687581

N. Pernet, Y. Sorel
Transformations de spécifications incluant du contrôle en spécification flot de données pour implantation distribuée
Actes de la Conférence Modélisation des Systèmes Réactifs, MSR'05, 2005, Grenoble, France, inria-00413490

D. Potop-Butucaru, R. De Simone, Y. Sorel, J.-P. Talpin
Clock-Driven Distributed Real-Time Implementation of Endochronous Synchronous Programs
International conference on Embedded software - EMSOFT 2009, 12/10/2009, Grenoble, France, inria-00485007

J. Ribault, O. Dalle, D. Conan, S. Leriche
OSIF: A Framework To Instrument, Validate, and Analyze Simulations
SIMUTools2010, 16/03/2010, Torremolinos, Espagne, inria-00465141

J. Ribault, F. Peix, J. Monteiro, O. Dalle
OSA: an Integration Platform for Component-Based Simulation
Second Intl. Conf. on Simulation Tools and Techniques (SIMUTools09), 02/03/2009, Rome, Italie, inria-00449632

J. Ribault, O. Dalle
OSA : A Federative Simulation Platform
Proceedings of the Winter Simulation Conference (WSC'09), 13/12/2009, Austin, États-Unis, inria-00449642

J. Ribault, O. Dalle
Enabling advanced simulation scenarios with new software engineering techniques.
20th European Modeling and Simulation Symposium (EMSS 2008), 17/09/2008, Briatico, Italie, inria-00425150

F. Solano Donado, J. Moulierac
Routing in All-Optical Label Switched-based Networks with Small Label Spaces
IFIP/IEEE ONDM, 18/02/2009, Braunschweig, Allemagne, inria-00425298

E. Tanter, J. Noyé, D. Caromel, P. Cointe
Partial Behavioral Reflection: Spatial and Temporal Selection of Reification
The 18th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (OOPSLA 2003), 2003, Anaheim, California, USA, États-Unis, pp.27-46, hal-00457204

P. Uribe, J.-C. Maureira, O. Dalle
Extending INET Framework for Directional and Asymmetrical Wireless Communications
ICST 3rd International Workshop on OMNeT++, 15/03/2010, Torremolinos, Espagne, pp.8p, inria-00530809

L. Yin, F. Mallet, J. Liu
Verification of MARTE/CCSL Time Requirements in Promela/SPIN
16th IEEE International Conference on Engineering of Complex Computer Systems, 27/04/2011, Las Vegas, États-Unis, hal-00650621

H. Yu, J.-P. Talpin, L. Besnard, T. Gautier, F. Mallet, C. André, R. De Simone
Polychronous Analysis of Timing Constraints in UML MARTE
IEEE International Workshop on Model-Based Engineering for Real-Time Embedded Systems Design, 05/2010, Parador of Carmona, Espagne, pp.7 p., inria-00497249

vers haut de page   COMMUNICATIONS NATIONALES

O. Amini, S. Perennes, I. Sau
Hardness of Approximating the Traffic Grooming Problem
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 05/2007, Ile d'Oléron, France, pp.45-48, inria-00176960

C. André, M. Belaunde, B. Berthomieu, C. Brunette, A. Canals, H. Garavel, S. Graf, F. Lang, V. Mahé, M. Nakhlé, R. Schnekenburger, R. De Simone, J.-P. Talpin, F. Vernadat
Présentation des résultats du projet OpenEmbeDD
Neptune, 05/2009, Paris, France, inria-00381639

I. Attali, D. Caromel, L. Henrio, F. Luna
Secured Information Flow for Asynchronous Sequential Processes
3rd International Workshop on Security Issues in Concurrency (SecCo'05), 08/2005, San Francisco, USA, inria-00122937

I. Attali, T. Barros, E. Madelaine
Formalisation and Proofs of the Chilean Electronic Invoices System
in proc. of the XXIV International Conference of the Chilean Computer Science Society (SCCC'04), 10/2004, Arica, Chili, inria-00087210

T. Barros, A. Cansado, E. Madelaine, M. Rivera
Model-checking Distributed Components: The Vercors Platform
Formal Aspect of Component Systems, 09/2006, Prague / Tcheque republic, inria-00091569

T. Barros, L. Henrio, E. Madelaine
Behavioural Models for Hierarchical Components
SPIN'05, 2005, San Francisco, USA, inria-00122933

T. Barros, L. Henrio, E. Madelaine
Verification of Distributed Hierarchical Components
International Workshop on Formal Aspects of Component Software (FACS'05), 2005, Macao, inria-00122926

T. Barros, R. Boulifa, E. Madelaine
Parameterized Models for Distributed Java Objects
Forte'04 conference, 09/2004, Madrid, LNCS 3235, inria-00087222

F. Baude, D. Caromel, A. Di Costanzo, C. Delbe, M. Leyton
Towards Deployments Contracts in Large Scale Clusters & Desktop Grids
Workshop on Large-Scale and Volatile Desktop Grids (PCGrid 2007), 03/2007, Long Beach, California, États-Unis, hal-00128513

J.-C. Bermond, F. Havet, F. Huc, C. Linhares-Sales
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 05/2007, Ile d'Oléron, France, pp.53-56, inria-00176955

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Pérennes
Gathering in specific radio networks
8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel06), Trégastel, 05/2006, France, pp.85--88, hal-00344620

J.-C. Bermond, O. Delmas, F. Havet, M. Montassier, S. Pérennes
Réseaux de télécommunication minimaux embarqués tolérants aux pannes
5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), 12/05/2003, France, pp.27--32, hal-00307610

J.-C. Bermond, L. Chacon, D. Coudert, F. Tillerot
Conception d'un réseau WDM protégé par sous-réseaux
2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), 10/05/2000, La Rochelle, France, ISBN 2-7261-1157-2, pp.83-88, inria-00429292

M. Bouklit, D. Coudert, J.-F. Lalande, H. Rivano
Approximation Combinatoire de Multiflot Factionnaire : Améliorations
AlgoTel'03 : 5ièmes Rencontres Francophones sur les Aspects ALGOrithmiques des TELécommunications, Banyuls-sur-Mer (France), pp.P nd., lirmm-00269814

J. Bustos-Jimenez, D. Caromel, A. Di Costanzo, M. Leyton, J. M. Piquer
Balancing Active Objects on a Peer to Peer Infrastructure
Proceedings of the XXV International Conference of the Chilean Computer Science Society (SCCC 2005), 11/2005, Valdivia, Chile, inria-00001237

D. Caromel, V. Cavé, A. Di Costanzo, C. Brignolles, B. Grawitz, Y. Viala
Executing Hydrodynamic Simulation on Desktop Grid with ObjectWeb ProActive
HIC2006: Proceedings of the 7th International Conference on HydroInformatics, 04/09/2006, Nice, France, inria-00068176

D. Caromel, C. Delbé, A. Di Costanzo, M. Morel
Dynamically-Fulfilled Application Constraints through Technical Services - Towards Flexible Component Deployments
Proceedings of HPC-GECO/CompFrame 2006, HPC Grid programming Environments and COmponents - Component and Framework Technology in High-Performance and Scientific Computing, 19/06/2006, Paris, France, inria-00068595

D. Caromel, C. Delbe, A. Di Costanzo
Peer-to-Peer and Fault-Tolerance: Towards Deployment Based Technical Services
Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture, 01/2006, Paris, France, inria-00001238

D. Caromel, Ludovic Henrio
Asynchonous Distributed Components: Concurrency and Determinacy
Theoretical Computer Science 2006 (IFIP TCS'06), 2006, Santiago, Chile, inria-00122924

D. Caromel, A. Di Costanzo, D. Gannon, A. Slominski
Asynchronous Peer-to-PeerWeb Services and Firewalls
IPDPS '05: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5, 03/04/2005, Washington, DC, USA, pp.183.1, inria-00001236

D. Coudert, F. Huc, D. Mazauric
Algorithme générique pour les jeux de capture dans les arbres
10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France, pp.37-40, inria-00374452

D. Coudert, S. Perennes, Q.-C. Pham, J.-S. Sereni
Rerouting requests in WDM networks
7eme Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 05/2005, Presqu'île de Giens, France, pp.17-20, inria-00429173

D. Coudert, H. Rivano
Routage optique dans les réseaux WDM multifibres avec conversion partielle
Quatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 22/05/2002, Mèze, France, pp.17-24, inria-00429178

D. Coudert
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications
3eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 28/05/2001, Saint Jean de Luz, France, pp.47-53, inria-00429185

D. Coudert, A. Ferreira, S. Perennes
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture
Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 05/05/1999, Roscoff, France, pp.101-106, inria-00429194

L. Cucu-Grosjean, Y. Sorel
A schedulability test for real-time dependant periodic task systems with latency constraints
12e congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, 03/2011, Saint Etienne, France, inria-00584253

O. Dalle
Component-based Discrete Event Simulation Using the Fractal Component Model
International Conference on AI, Simulation and Planning in High Autonomy Systems (AIS) and Conceptual Modeling and Simulation (CMS), 08/02/2007, Buenos Aires, Argentina, pp.213--218, inria-00141624

O. Dalle
{OSA}: an {O}pen {C}omponent-based {A}rchitecture for {D}iscrete-event {S}imulation
proc. of 20th European Conf. on Modeling and Simulation, 28/05/2006, Bonn, Germany, pp.253--259, inria-00141606

F. Fomin, P. Fraigniaud, N. Nisse
Strategies d'encerclement non deterministes
8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2006, France, pp.81-84, hal-00421419

P. Fraigniaud, N. Nisse
Stratégies d'encerclement connexes dans un réseau
7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2005, France, pp.13-16, hal-00421418

C. Gomez, J. Deantoni, F. Mallet
Semantic Multi-View model for Low-Power
Journées nationales IDM, CAL, et du GDR GPL, 07/06/2011, Lille, France, pp.19, hal-00596239

L. Henrio, E. Madelaine
Experiments with distributed Model-Checking of group-based applications
Sophia-Antipolis Formal Analysis Workshop, 06/10/2010, Sophia-Antipolis, France, pp.3p., inria-00538499

L. Henrio, F. Kammüller
A Mechanized Model of the Theory of Objects
9th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS), 06/06/2007, CYPRUS, inria-00150272

J.-F. Lalande, M. Syska, Y. Verhoeven
Arrondi aléatoire et protection des réseaux WDM
ROADEF 2005, 14/02/2005, Tours, France, ROADEF 2005 / 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, pp.241-242, inria-00451818

J.-F. Lalande, S. Pérennes, M. Syska
Groupage dans les réseaux dorsaux WDM
ROADEF 2003, 26/02/2003, Avignon, France, pp.254-255, inria-00451812

R. Le Riche, D. Caromel, R. Duvigneau
Optimization tools and applications developed during the OMD & OMD2 projects
Forum Teratech 2011, Complex systems engineering workshop (atelier ingénierie des systèmes complexes), 29/06/2011, Palaiseau, France, emse-00686596

vers haut de page   OUVRAGES DE SYNTHESE

D. Coudert, D. Simplot-Ryl
Ad Hoc & Sensor Wireless Networks, an International Journal -- Special issue on Ad hoc, Mobile and Wireless Networks
Coudert, D. and Simplot-Ryl, D., Old City Publishing, 2010, inria-00531585

F. Mallet
Logical Time @ Work for the Modeling and Analysis of Embedded Systems
LAP LAMBERT Academic Publishing, 19/01/2011, 978-3-8433-9388-1inria-00561247

vers haut de page   DIRECTION D'OUVRAGES

E. Madelaine, M. Lumpe
Proceedings of the 4th International Workshop on Formal Aspects of Component Software
Eric Madelaine and Markus Lumpe, ENTCS, 2008, inria-00337975

vers haut de page   CHAPITRE D'OUVRAGES

B. Amedro, F. Baude, D. Caromel, C. Delbé, I. Filali, F. Huet, E. Mathias, O. Smirnov
An efficient framework for running applications on clusters, grids, and clouds
in Cloud Computing
Nick Antonopoulos and Lee Gillam, Springer, 2010, Computer Communications and Networks, 978-1849962407hal-00694011

C. André, J. Deantoni, F. Mallet, R. De Simone
The Time Model of Logical Clocks available in the OMG MARTE profile
in Synthesis of Embedded Software: Frameworks and Methodologies for Correctness by Construction
Sandeep K. Shukla and Jean-Pierre Talpin, Springer Science+Business Media, LLC 2010, 07/2010, 978-1-4419-6399-4inria-00495664

C. André, F. Mallet, R. De Simone
Modeling AADL data-communications with UML MARTE
in Embedded Systems Specification and Design Languages
Eugenio villar, Springer, 2008, Lecture Notes in Electrical Engineering, 978-1-4020-8296-2inria-00371366

L. Baduel, F. Baude, D. Caromel, A. Contes, F. Huet, M. Morel, R. Quilici
Programming, Composing, Deploying for the Grid
in Grid Computing: Software Environments and Tools
Cunha, Jose C.; Rana, Omer F., Springer, 2006, 978-1-85233-998-2inria-00486114

J.-C. Bermond, F. Ergincan, M. Syska
Line Directed Hypergraphs
in Cryptoquater2011 ,Festchrift Jean-jacques,
Springer verlag, 2011, Lecture Notes in Computer Science, 6805,, hal-00643785

J.-C. Bermond, D. Coudert
Grooming
in Handbook of Combinatorial Designs (2nd edition)
Charles J. Colbourn and Jeffrey H. Dinitz, Chapman & Hall- CRC Press, 2006, Discrete mathematics and Applications, 1584885068inria-00429215

J.-C. Bermond, D. Coudert
Grooming
in Handbook of Combinatorial Designs
C.J. Colbourn and J.H. Dinitz, Chapman & Hall- CRC Press, 2006, Discrete mathematics and Applications, inria-00531339

T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, S. Zaks
Traffic Grooming: Combinatorial Results and Practical Resolutions.
in Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks.
Arie Koster and Xavier Muñoz, Springer, 01/01/2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4inria-00530964

D. Coudert, X. Munoz
Graph Theory and Traffic Grooming in WDM Rings
in Recent Research Developments in Optics
S.G. Pandalai, Research Signpost, 2003, 81-271-0028-5inria-00429212

O. Dalle, G. A. Wainer, K. Al-Zoubi, O. Dalle, D. R.C. Hill, S. Mittal, J. Risco Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler
Chapter 17: Standardizing DEVS model representation
in Discrete-Event Modeling and Simulation: Theory and Applications
Wainer, G. and Mosterman, P., Taylor and Francis, 2011, 978-1-4200-7233-4inria-00638560

O. Dalle, G. A. Wainer, K. Al-Zoubi, O. Dalle, D. R.C. Hill, S. Mittal, J. Risco Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, B. P. Zeigler
Chapter 18: Standardizing DEVS Simulation Middleware
in Discrete-Event Modeling and Simulation: Theory and Applications
Wainer, G. and Mosterman, P., Taylor and Francis, 2011, 978-1-4200-7233-4inria-00638559

C. Glitia, J. Deantoni, F. Mallet
Logical Time @ Work: Capturing Data Dependencies and Platform Constraints
in System Specification and Design Languages
Kaźmierski, Tom J. J. and Morawiec, Adam, Springer New York, 2012, Lecture Notes in Electrical Engineering, 978-1-4614-1426-1hal-00651864

F. Mallet, R. De Simone
MARTE vs. AADL for Discrete-Event and Discrete-Time Domains
in Languages for Embedded Systems and their Applications
Martin Radetzki, Springer, 05/2009, Lecture Notes in Electrical Engineering, 978-1-4020-9713-3inria-00416656

D. Potop-Butucaru, R. De Simone, Y. Sorel
From Synchronous Specifications to Statically-Scheduled Hard Real-Time Implementations
in Synthesis of Embedded Software: Frameworks and Methodologies for Correctness by Construction
Sandeep K. Shukla and Jean-Pierre Talpin, Springer Science+Business Media, LLC 2010, 07/2010, 978-1-4419-6399-4inria-00495666

vers haut de page   THESES et HDR

F. Baude
HDR:De la programmation parallèle structurée à la programmation pour la grille
Université de Nice Sophia-Antipolis, 15/09/2006, tel-00507049

B. Beauquier
THESE:Communications dans les réseaux optiques par multiplexage en longueur d'onde
informatique, Université de Nice Sophia-Antipolis, 17/01/2000, tel-00504392

D. Coudert
HDR:Algorithmique et optimisation dans les réseaux de télécommunications
Université de Nice Sophia-Antipolis, 05/03/2010, tel-00466400

D. Coudert
THESE:Algorithmique et optimisation de réseaux de communications optiques
Université de Nice Sophia-Antipolis, 11/12/2001, tel-00008087

L. Henrio
THESE:Calcul d'objet asynchrone : confluence et déterminisme
informatique, Université de Nice Sophia-Antipolis, 28/11/2003, tel-00505940

F. Huet
THESE:Objets mobiles : conception d'un middleware et évaluation de la communication
informatique, Université de Nice Sophia-Antipolis, 11/12/2002, tel-00505420

E. Madelaine
HDR:Specification, Model Generation, and Verification of Distributed Applications
Université de Nice Sophia-Antipolis, 29/09/2011, tel-00625248

F. Mallet
HDR:Temps Logique pour l'ingénierie dirigée par le modèles
Université de Nice Sophia-Antipolis, 26/11/2010, tel-00541140

vers haut de page   RAPPORTS DE RECHERCHE

P. Aboulker, F. Havet, N. Trotignon
On wheel-free graphs
Rapport de recherche, RR-7651, inria-00602079

L. Addario-Berry, S. Thomassé, F. Havet
Paths with two blocks in $n$-chromatic digraphs
Rapport de recherche, 09/2005, RR-5688, inria-00070325

L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, S. Thomasse
Oriented trees in digraphs.
Rapport de recherche, RR-7502, inria-00551133

S. Alouf, F. Huet, P. Nain
Forwarders vs. Centralized Server : An Evaluation of two Approaches for Locating Mobile Agents
04/2002, RR-4440, inria-00072148

E. Altman, P. Nain, J.-C. Bermond
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
Rapport de recherche, 2008, RR-6645, inria-00321641

B. Amedro, V. Bodnartchouk, D. Caromel, C. Delbe, F. Huet, G. Taboada
Current State of Java for HPC
Rapport Technique, 2008, RT-0353, inria-00312039

R. Ameur-Boulifa, R. Halalai, L. Henrio, E. Madelaine
Verifying Safety of Fault-Tolerant Distributed Components -- Extended Version
Rapport de recherche, RR-7717, inria-00621264

O. Amini, F. Havet, F. Huc, S. Thomasse
WDM and Directed Star Arboricity
Rapport de recherche, 01/2007, RR-6179, inria-00132396

O. Amini, F. Giroire, F. Huc, S. Pérennes
Minimal Selectors and Fault Tolerant Networks
Rapport de recherche, 06/2006, inria-00082015

O. Amini, D. Coudert, N. Nisse
Some Results on Non-deterministic Graph Searching in Trees
Rapport de recherche, inria-00174965

O. Amini, D. Peleg, S. Perennes, I. Sau Valls, S. Saurabh
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Rapport de recherche, RR-6690, inria-00331747

C. André
Verification of clock constraints: CCSL Observers in Esterel
Rapport de recherche, 02/2010, RR-7211, inria-00458847

C. André, F. Mallet, M.-A. Peraldi-Frati
Non-functional property analysis using UML2.0 and model transformations
Rapport de recherche, 05/2006, RR-5913, inria-00124874

C. André, A. Cuccuru, R. De Simone, J.-P. Talpin
Modeling with logical time in UML for real-time embedded system design
Rapport de recherche, 2006, RR-5895, inria-00071373

C. André, F. Mallet
Clock Constraints in UML/MARTE CCSL
Rapport de recherche, RR-6540, inria-00280941

C. André, F. Mallet
Combining CCSL and Esterel to specify and verify time requirements
Rapport de recherche, RR-6839, inria-00360528

C. André, M. Bayart, A.-M. Déplanche, J. Jourdan, M.-A. Péraldi, F. Simonot-Lion, L. Thomas, J. Toussaint, Y. Trinquet
Construction et Validation d'Architectures Distribuées Temps Réel (Consortium COVADIS)
Contrat, 98-R-318 || andre98a, inria-00098509

C. André
Modèles de temps et de contraintes temporelles de MARTE et leurs applications
Rapport de recherche, RR-7788, hal-00639211

C. André
Syntax and Semantics of the Clock Constraint Specification Language (CCSL)
Rapport de recherche, RR-6925, inria-00384077

J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, R. Modrzejewski
Weighted Improper Colouring
Rapport de recherche, RR-7590, inria-00583036

J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, R. Soares
On the hull number of some graph classes
Rapport de recherche, RR-7567, inria-00576581

J. Araújo, N. Cohen, F. Giroire, F. Havet
Good edge-labelling of graphs
Rapport de recherche, 2009, RR-6934, inria-00383343

M. Aste, F. Havet, C. Linhares-Sales
Grundy number and products of graphs
Rapport de recherche, RR-6672, inria-00328589

I. Attali, D. Caromel, R. Guider
Static Analysis of Java for Distributed and Parallel Programming
03/1999, RR-3634, inria-00073040

I. Attali, D. Caromel, S. O. Ehmety
An Operational Semantics for the Eiffel Language
11/1995, RR-2732, inria-00073962

J. Bang-Jensen, F. Havet, N. Trotignon
Finding an induced subdivision of a digraph
Rapport de recherche, RR-7430, inria-00527518

L. Barrière, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, D. M. Thilikos
Connected Graph Searching
Rapport de recherche, RR-7363, inria-00508888

T. Barros, L. Henrio, E. Madelaine
Behavioural Models for Hierarchical Components
Rapport de recherche, 2005, RR-5591, inria-00070416

T. Barros, E. Madelaine
Formalisation and verification of the Chilean electronic invoice system
06/2004, RR-5217, inria-00070777

T. Barros, R. Boulifa, A. Cansado, L. Henrio, E. Madelaine
Behavioural Models for Distributed Fractal Components
Rapport de recherche, RR-6491, inria-00268965

F. Baude, D. Caromel, C. Delbé, L. Henrio
A Fault Tolerance protocol for ASP calculus: Design and Proof
06/2004, RR-5246, inria-00070752

B. Beauquier, O. Delmas, S. Pérennes
Tight Bounds for Broadcasting in the Linear Cost Model
12/1999, RR-3827, inria-00072831

B. Beauquier, O. Delmas, S. Pérennes
Tight Bounds for Broadcasting in the Linear Cost Model
12/1999, RR-3827, inria-00072831

B. Beauquier, E. Darrot
On Arbitrary Waksman Networks and their Vulnerability
10/1999, RR-3788, inria-00072871

B. Beauquier, S. Pérennes, D. Tóth
All-to-All Routing and Coloring in Weighted Trees of Rings
06/1999, RR-3700, inria-00072968

B. Beauquier, S. Pérennes, D. Tóth
All-to-All Routing and Coloring in Weighted Trees of Rings
06/1999, RR-3700, inria-00072968

B. Beauquier
All-to-All Communication for some Wavelength-Routed All-Optical Networks
07/1998, RR-3452, inria-00073238

B. Beauquier
Broadcasting in WDM Optical Rings and Tori
04/1998, RR-3410, inria-00073280

B. Beauquier, P. Hell, S. Pérennes
Optimal Wavelength-Routed Multicasting
10/1997, RR-3276, inria-00073413

B. Beauquier, P. Hell, S. Pérennes
Optimal Wavelength-Routed Multicasting
10/1997, RR-3276, inria-00073413

B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Pérennes, U. Vaccaro
Graph Problems Arising from Wavelength-Routing in All-Optical Networks
05/1997, RR-3165, inria-00073523

B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Pérennes, U. Vaccaro
Graph Problems Arising from Wavelength-Routing in All-Optical Networks
05/1997, RR-3165, inria-00073523

F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, I. Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round.
Rapport de recherche, inria-00528733

S. Belhareth, D. Coudert, D. Mazauric, N. Nisse, I. Tahiri
Reconfiguration with physical constraints in WDM networks
Rapport de recherche, RR-7850, hal-00654111

B. Bennour, L. Henrio, M. Rivera
A Reconfiguration Framework for Distributed Components
Rapport de recherche, RR-6911, inria-00379268

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau Valls
Drop cost and wavelength optimal two-period grooming with ratio 4
Rapport de recherche, 17/11/2009, RR-7101, inria-00432801

J.-C. Bermond, X. Muñoz, I. Sau Valls
Traffic Grooming in Bidirectional WDM Ring Networks
Rapport de recherche, 31/10/2009, RR-7080, inria-00429155

J.-C. Bermond, D. Mazauric, V. Misra, P. Nain
Distributed Call Scheduling in Wireless Networks
Rapport de recherche, 2008, RR-6763, inria-00345669

J.-C. Bermond, D. Coudert, B. Leveque
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring
Rapport de recherche, 01/10/2007, inria-00175795

J.-C. Bermond, J. Galtier, R. Klasing, N. Morales, S. Perennes
Hardness and approximation of gathering in static radio networks
Rapport de recherche, 06/2006, RR-5936, inria-00081032

J.-C. Bermond, L. Braud, D. Coudert
Traffic Grooming on the Path
Rapport de recherche, 2005, RR-5645, inria-00070363

J.-C. Bermond, M. Cosnard, D. Coudert, S. Pérennes
Optimal Solution of the Maximum All Request Path Grooming Problem
Rapport de recherche, 2005, RR-5627, inria-00070381

J.-C. Bermond, F. Havet, C. Tóth
Fault tolerant on-board networks with priorities
Rapport de recherche, 11/2004, RR-5363, inria-00070640

J.-C. Bermond, S. Ceroi
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
11/2002, RR-4626, inria-00071959

J.-C. Bermond, D. Coudert, M.-L. Yu
On DRC-Covering of K_n by Cycles
Rapport de recherche, 10/2001, RR-4299, inria-00072288

J.-C. Bermond, N. Marlin, D. Peleg, S. Pérennès
Directed Virtual Path Layouts in ATM Networks
04/1999, RR-3665, inria-00073007

J.-C. Bermond, E. Darrot, O. Delmas, S. Perennes
Hamilton Circuits in the Directed Butterfly Network
07/1996, RR-2925, inria-00073773

J.-C. Bermond, E. Darrot, O. Delmas, S. Perennes
Hamilton Cycle Decomposition of the Butterfly Network
06/1996, RR-2920, inria-00073777

J.-C. Bermond, Z. Liu, M. Syska
Mean eccentricities of de Bruijn networks
Rapport de recherche, 1993, RR-2114, inria-00074558

J.-C. Bermond, A. Jean-Marie, D. Mazauric, J. Yu
Well Balanced Designs for Data Placement
Rapport de recherche, RR-7725, inria-00618656

J.-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, F. Solano Donado
MPLS label stacking on the line network
Rapport de recherche, RR-6803, inria-00354267

J.-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau Valls, F. Solano Donado
GMPLS Routing Strategies based on the Design of Hypergraph Layouts
Rapport de recherche, RR-6842, inria-00360576

J.-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, F. Solano Donado
GMPLS Label Space Minimization through Hypergraph Layouts
Rapport de recherche, RR-7071, inria-00426681

J.-C. Bermond, D. Coudert, J. Peters
Online Distributed Traffic Grooming on Path Networks
Rapport de recherche, RR-6833, inria-00359810

J.-C. Bermond, F. Havet, F. Huc, C. Linhares Sales
Improper colouring of weighted grid and hexagonal graphs
Rapport de recherche, RR-7250, inria-00472819

J.-C. Bermond, M. Cosnard, S. Pérennes
Directed acyclic graphs with the unique dipath property
Rapport de recherche, RR-6932, inria-00387085

J.-C. Bermond, N. Nisse, P. Reyes, H. Rivano
Fast Data Gathering in Radio Grid Networks
Rapport de recherche, RR-6851, inria-00363908

J.-C. Bermond, R. Correa, M.-L. Yu
Optimal Gathering Protocols on Paths under Interference Constraints
Rapport de recherche, inria-00168162

P. Berthomé, N. Nisse
A unified FPT Algorithm for Width of Partition Functions
Rapport de recherche, RR-6646, inria-00321766

S. Bessy, E. Birmelé, F. Havet
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree
Rapport de recherche, 11/2004, RR-5364, inria-00070639

S. Bessy, F. Havet, J. Palaysi
Choosability of bipartite graphs with maximum degree $Delta$
07/2002, RR-4522, inria-00072066

S. Bessy, F. Havet
Enumerating the edge-colourings and total colourings of a regular graph
Rapport de recherche, RR-7652, inria-00602188

S. Bhadra, A. Ferreira
Computing multicast trees in dynamic networks using evolving graphs
08/2002, RR-4531, inria-00072057

L. Blin, J. Burman, N. Nisse
Perpetual Graph Searching
02/2012, hal-00675233

F. Bongiovanni, L. Henrio
Mechanical Support for Efficient Dissemination on the CAN Overlay Network
Rapport de recherche, 04/2011, RR-7599, inria-00585057

R. Boulifa, E. Madelaine
Preuve de propriétés de comportement deprogrammes ProActive
05/2002, RR-4460, inria-00072128

B. Bui Xuan, A. Ferreira, A. Jarry
Computing shortest, fastest, and foremost journeys in dynamic networks
10/2002, RR-4589, inria-00071996

V. Campos, A. Gyarfas, F. Havet, C. Linhares Sales, F. Maffray
New bounds on the Grundy number of products of graphs
Rapport de recherche, RR-7243, inria-00470158

V. Campos, F. Havet
5-choosability of graphs with 2 crossings
Rapport de recherche, RR-7618, inria-00593426

D. Caromel, C. Delbé, L. Henrio
Promised Consistency for Rollback Recovery
Rapport de recherche, 05/2006, RR-5902, inria-00071365

D. Caromel, L. Henrio
Asynchronous Sequential Processes
03/2003, RR-4753, inria-00071834

S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Pérennes
P2P Storage Systems: Data Life Time for Different Placement Policies
Rapport de recherche, RR-7209, inria-00458190

J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and ride
Rapport de recherche, RR-7178, inria-00448243

G. Chang, F. Havet, M. Montassier, A. Raspaud
Steinberg's Conjecture and near-colorings
Rapport de recherche, RR-7669, inria-00605810

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks
Rapport de recherche, RR-7047, inria-00421140

N. Cohen, F. Havet, T. Mueller
Acyclic edge-colouring of planar graphs
Rapport de recherche, RR-6876, inria-00367394

N. Cohen, F. Havet
Linear and 2-frugal choosability of graphs of small maximum average degree
Rapport de recherche, RR-7213, inria-00459692

N. Cohen, F. Havet
Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof
Rapport de recherche, RR-7098, inria-00432389

D. Coudert, F. Giroire, I. Sau Valls
Circuit visiting 10 ordered vertices in infinite grids
Rapport de recherche, 2009, RR-6910, inria-00378586

D. Coudert, J.-S. Sereni
Characterization of graphs and digraphs with small process number
Rapport de recherche, 01/2008, RR-6285, inria-00171083

D. Coudert, D. Mazauric
Network Reconfiguration using Cops-and-Robber Games
Rapport de recherche, 2008, RR-6694, inria-00315568

D. Coudert, F. Huc, F. Peix, M.-E. Voge
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
Rapport de recherche, 01/10/2007, inria-00175813

D. Coudert, S. Perennes, H. Rivano, M.-E. Voge
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues
Rapport de recherche, 26/09/2007, inria-00175143

D. Coudert, P. Datta, S. Pérennes, H. Rivano, M.-E. Voge
Complexity and approximability issues of Shared Risk Resource Group
Rapport de recherche, 03/2006, RR-5859, inria-00070167

D. Coudert, F. Huc, J.-S. Sereni
Pathwidth of outerplanar graphs
Rapport de recherche, 01/2006, RR-5804, inria-00070220

D. Coudert, H. Rivano
Lightpath assignment for multifibers wdm optical networks with wavelength translators
06/2002, RR-4487, inria-00072101

D. Coudert, A. Ferreira, S. Pérennes
Digraph Isomorphisms and Free Space Optical Networks
Rapport de recherche, 11/1999, RR-3817, inria-00072841

D. Coudert, D. Mazauric, N. Nisse
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.
Rapport de recherche, RR-6790, inria-00350025

D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services
Rapport de recherche, RR-6698, inria-00331807

D. Coudert, F. Huc, D. Mazauric
A distributed algorithm for computing and updating the process number of a forest
Rapport de recherche, RR-6560, inria-00288304

D. Coudert, N. Nepomuceno, H. Rivano
Wireless Backhaul Networks: Minimizing Energy Consumption by Power-Efficient Radio Links Configuration
Rapport de recherche, RR-6752, inria-00344344

D. Coudert, P. Datta, H. Rivano, M.-E. Voge
Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks
Rapport de recherche, I3S Research Report I3S/RR-2005-37-FR, inria-00466486

L. Cucu, Y. Sorel
Non-preemptive scheduling algorithms and schedulability conditions for real-time systems with precedence and latency constraints
Rapport de recherche, 2004, RR-5403, inria-00070600

O. Dalle
OSA: an Open Component-based Architecture for Discrete-Event Simulation
Rapport de recherche, 11/2005, RR-5762, inria-00070258

O. Dalle
LoadBuilder: a Tool for Generating and Modeling Workloads in Distributed Workstation Environments
11/1996, RR-3045, inria-00073647

O. Dalle, F. Giroire, J. Monteiro, S. Pérennes
Analysis of Failure Correlation in Peer-to-Peer Storage Systems
Rapport de recherche, RR-6771, inria-00346857

O. Delmas, M. Montassier, F. Havet, S. Pérennes
Design of fault-tolerant on-board network
Rapport de recherche, 03/2006, RR-5866, inria-00070160

O. Delmas, S. Perennes
Circuit-Switched Gossiping in the 3-Dimensional Torus Networks
07/1996, RR-2930, inria-00073769

V. D. Doan, A. Gaikwad, M. Bossy, F. Baude, F. Abergel
A financial engineering benchmark for performance analysis of grid middlewares
Rapport Technique, 2009, RT-365, inria-00387324

V. D. Doan, A. Gaikwad, M. Bossy, F. Baude, I. Stokes-Rees
Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American Options using Monte Carlo methods
Rapport de recherche, 2008, RR-6530, inria-00278514

H. Dubois, M.-A. Peraldi-Frati, F. Lakhal
A model for requirements traceability in an heterogeneous model-based design process. Application to automotive embedded systems
Rapport de recherche, RR-7292, inria-00483970

N. Eggemann, F. Havet, S. Noble
$k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$
Rapport de recherche, RR-6840, inria-00360505

R. Erman, F. Havet, B. Lidicky, O. Pangrac
5-colouring graphs with 4 crossings
Rapport de recherche, RR-7110, inria-00437726

A. Ferreira
Building a Reference Combinatorial Modelfor Dynamic Networks:Initial Results in Evolving Graphs
12/2003, RR-5041, inria-00071542

A. Ferreira, L. Viennot
A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks
Rapport de recherche, 03/2002, RR-4403, inria-00072185

A. Ferreira, S. Pérennes, A. Richa, H. Rivano, N. Stier
On the design of Multifiber WDM Networks
08/2001, RR-4244, inria-00072343

A. Ferreira, S. Pérennes, H. Rivano
Fractional Coloring of Bounded Degree Trees
01/2001, RR-4094, inria-00072538

I. Filali, F. Bongiovanni, F. Huet, F. Baude
RDF Data Indexing and Retrieval: A survey of Peer-to-Peer based solutions
Rapport de recherche, 26/11/2010, RR-7457, inria-00540314

B. Florent, A. Kosowski, N. Nisse, I. Rapaport, K. Suchan
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
Rapport de recherche, RR-7746, inria-00627910

F. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse
To Satisfy Impatient Web surfers is Hard
Rapport de recherche, RR-7740, inria-00625703

K. Garcés, J. Deantoni, F. Mallet
Transforming CCSL partially-ordered Traces into UML Interaction Diagrams
16/12/2011, hal-00652987

R. Gascon, F. Mallet, J. Deantoni
Logical time and temporal logics: Comparing UML MARTE/CCSL and PSL
Rapport de recherche, 19/11/2010, RR-7459, inria-00540738

F. Giroire, D. Mazauric, J. Moulierac, B. Onfroy
Minimizing Routing Energy Consumption: from Theoretical to Practical Results
Rapport de recherche, 03/2010, RR-7234, inria-00464318

F. Giroire, J. Monteiro, S. Pérennes
P2P Storage Systems: How Much Locality Can They Tolerate?
Rapport de recherche, 2009, RR-7006, inria-00408078

F. Giroire, S. K. Gupta, R. Modrzejewski, J. Monteiro, S. Pérennes
Analysis of the Repair Time in Distributed Storage Systems
Rapport de recherche, RR-7538, inria-00565359

C. Gomes, P. Reyes, J.-C. Bermond
Round Weighting Problem and gathering in wireless networks with symmetrical interference
Rapport de recherche, inria-00408502

C. Gomez, J. Deantoni, F. Mallet
Multi-View Power Modeling based on UML MARTE and SysML
Rapport de recherche, hal-00688853

C. Hamerling, V. Legrand, F. Baude, E. Mathias, C. Ruz, M. Fried, R. Krummenacher, P. Merle, N. Dolet
D1.4.1B SOA4All Runtime
Rapport Technique, hal-00673998

N. Hanusse, D. Ilcinkas, A. Kosowski, N. Nisse
How to beat the random walk when you have a clock?
Rapport de recherche, RR-7210, inria-00458808

F. Havet, S. Thomasse
Complexity of $(p,1)$-total labelling
Rapport de recherche, 09/2007, RR-6305, inria-00173438

F. Havet, R. Kang, T. Müller, J.-S. Sereni
Circular Choosability
Rapport de recherche, 07/2007, RR-5957, inria-00086981

F. Havet, R. Kang, J.-S. Sereni
Improper colouring of unit disk graphs
Rapport de recherche, 05/2007, RR-6206, inria-00150464

F. Havet, S. Thomasse, A. Yeo
Hoàng-Reed conjecture holds for tournaments
Rapport de recherche, 09/2006, RR-5976, inria-00091366

F. Havet
Choosability of the square of planar subcubic graphs with large girth
Rapport de recherche, 01/2006, RR-5800, inria-00070223

F. Havet
Repartitors, selectors and superselectors
Rapport de recherche, 09/2005, RR-5686, inria-00070327

F. Havet, J.-S. Sereni
Improper choosability of graphs and maximum average degree
03/2004, RR-5164, inria-00071425

F. Havet
Stable set meeting every longest paths
11/2003, RR-5009, inria-00071575

F. Havet
Upper bound for the span of (s,1)-total labelling of graphs
05/2003, RR-4816, inria-00071770

F. Havet, M.-L. Yu
(d,1)-total labelling of graphs
11/2002, RR-4650, inria-00071935

F. Havet
Design of fault tolerant on board networks with priorities via selectors
05/2002, RR-4463, inria-00072125

F. Havet
Robustness of a routing tree for the Push Tree Problem
05/2002, RR-4464, inria-00072124

F. Havet
Pancyclic arcs and connectivity in tournaments
02/2002, RR-4378, inria-00072210

F. Havet, M. Klazar, J. Kratochvil, D. Kratsch, M. Liedloff
Exact algorithms for $L(2,1)$-labeling of graphs
Rapport de recherche, RR-6587, inria-00303330

F. Havet, C. Linhares Sales, L. Sampaio
b-coloring of tight graphs
Rapport de recherche, RR-7241, inria-00468734

F. Havet, J. Van Den Heuvel, C. Mcdiarmid, B. Reed
List colouring squares of planar graphs
Rapport de recherche, RR-6586, inria-00303303

F. Havet, S. Jendrol', R. Sotak, E. Skrabulakova
Facial non-repetitive edge-colouring of plane graphs
Rapport de recherche, RR-6873, inria-00366589

F. Havet, X. Zhu
The game Grundy number of graphs
Rapport de recherche, RR-7646, inria-00600738

L. Henrio, F. Kammüller, H. Sudhof
ASPfun: A Functional and Distributed Object Calculus Semantics, Type-system, and Formalization
Rapport de recherche, 11/2007, RR-6353, inria-00186963

L. Henrio, F. Kammüller
A Formalization of the Theory of Objects in Isabelle/HOL
Rapport de recherche, 12/2006, RR-6079, inria-00121816

L. Henrio, B. P. Serpette, S. Szentes
Implementation and Complexity of the Lowest Static Reduction
12/2003, RR-5034, inria-00071550

L. Henrio, M. Rivera
An algorithm for safely stopping a component system
Rapport de recherche, RR-6444, inria-00239449

F. Huc, C. Molle, N. Nisse, S. Pérennes, H. Rivano
Stability of a local greedy distributed routing algorithm
Rapport de recherche, RR-6871, inria-00366441

M. U. Khan, L. Henrio
First Class Futures: a Study of Update Strategies
Rapport de recherche, 2008, RR-7113, inria-00435573

R. Klasing, N. Morales, S. Perennes
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands
Rapport de recherche, 12/2004, RR-5432, inria-00070575

A. Kosowski, B. Li, N. Nisse, K. Suchan
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
hal-00671861

R. Krummenacher, I. Toma, C. Hamerling, J.-P. Lorre, F. Baude, V. Legrand, P. Merle, C. Ruz, C. Pedrinaci, D. Liu, T. Pariente Lobo
D1.4.1A SOA4All Reference Architecture Specification
Rapport Technique, hal-00673752

F. Lagarde, F. Mallet, C. André, S. Gérard, F. Terrier
An Automated Process for Designing UML Profiles
Rapport de recherche, RR-6599, inria-00308386

F. Lagarde, F. Mallet, C. André, S. Gérard, F. Terrier
Multilevel Modeling Paradigm in Profile Definition
Rapport de recherche, RR-6525, inria-00276653

J.-F. Lalande, M. Syska, Y. Verhoeven
Mascopt - A Network Optimization Library: Graph Manipulation
Rapport Technique, 04/2004, RT-0293, inria-00069887

S.-Y. Lee, F. Mallet, R. De Simone
Dealing with AADL End-to-end Flow Latency with UML MARTE
Rapport de recherche, RR-6402, inria-00200834

F. Mallet, C. André, F. Lagarde
Un profil UML pour la modélisation multiniveau
Rapport de recherche, 2008, RR-7287, inria-00482727

F. Mallet, C. André
UML/MARTE CCSL, Signal and Petri nets
Rapport de recherche, RR-6545, inria-00283077

F. Mallet, M.-A. Peraldi-Frati, C. André
Marte CCSL and East-ADL2 Timing Requirements
Rapport de recherche, RR-6781, inria-00348134

F. Mallet
Correct Transformation from CCSL to Promela for verification
Rapport de recherche, hal-00667849

J.-C. Maureira, D. Dujovne, O. Dalle
Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover
Rapport de recherche, RR-6850, inria-00369419

A. Mehmood Khan, F. Mallet, C. André, R. De Simone
Marte Timing Requirement and Spirit IP-XACT
Rapport de recherche, RR-6647, inria-00321953

P. Meumeu Yomsi, Y. Sorel
An Algebraic Approach for Fixed-Priority Scheduling of Hard Real-time Systems with Exact Preemption Cost
Rapport de recherche, inria-00613347

P. Meumeu Yomsi, Y. Sorel
Schedulability Analysis for non Necessarily Harmonic Real-Time Systems with Precedence and Strict Periodicity Constraints using the Exact Number of Preemptions and no Idle Time
Rapport de recherche, RR-6610, inria-00310248

J. Moulierac, T. K. Phan, N. Thoai, C. Tran
Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer Multicast
Rapport de recherche, RR-7784, inria-00637656

P. Mussi, G. Siegel
Sequential Simulation in Prosit: Programming Model and Implementation
11/1995, RR-2713, inria-00073978

V. Papailiopoulou, D. Potop-Butucaru, Y. Sorel, R. De Simone, L. Besnard, J.-P. Talpin
From concurrent multi-clock programs to concurrent multi-threaded implementations
Rapport de recherche, 03/2011, RR-7577, inria-00578585

N. Parlavantzas, M. Morel, F. Baude, F. Huet, D. Caromel, V. Getov
Componentising a Scientific Application for the Grid
Rapport Technique, hal-00694511

G. Peretti Pezzi, D. Caromel, E. Vaissié, Y. Viala, B. Grawitz, F. Bonnadier
High Performance Hydraulic Simulations on the Grid using Java and ProActive
Rapport de recherche, RR-7508, inria-00555866

D. Potop-Butucaru, R. D. Simone, Y. Sorel
Deterministic execution of synchronous programs in an asynchronous environment. A compositional necessary and sufficient condition
Rapport de recherche, 2008, RR-6656, inria-00322563

D. Potop-Butucaru, Y. Sorel
Optimized static real-time scheduling of communications on a broadcast bus
Rapport de recherche, 2008, RR-6655, inria-00322561

D. Potop-Butucaru, R. De Simone, Y. Sorel
Necessary and Sufficient Conditions for Deterministic Desynchronization
Rapport de recherche, 03/2007, RR-6152, inria-00137885

D. Potop-Butucaru, Y. Sorel, R. De Simone
From multi-clock constraints to multi-rate GALS executives
Rapport de recherche, 11/2006, RR-6021, inria-00114032

C. Ruz, F. Baude, V. Legrand Contes
Towards Grid Monitoring and deployment in Jade, using ProActive
Rapport de recherche, 09/2007, RR-6340, inria-00182554

F. Simonot-Lion, L. Thomas, T. Lambolais, A.-M. Déplanche, Y. Trinquet, C. André, M.-A. Péraldi, C. Choukair, M. Bayart
Conception et validation d'architectures distribuées temps réel
Contrat, 99-R-316 || simonot-lion99b, inria-00098849

I. Stavridou, A. Ferreira
Multi- Inter- and Trans-disciplinary research promoted by the European Cooperation in Science and Technology (COST): Lessons and experiments
Rapport de recherche, inria-00512712

P. Uribe, J.-C. Maureira, O. Dalle
Extending INET Framework for Directional and Asymmetrical Wireless Communications
Rapport de recherche, 2009, RR-7120, inria-00448033

vers haut de page   COMMUNICATIONS SANS COMITÉ DE LECTURE

F. Baude, A. Bottaro, J.-M. Brun, A. Chazalet, A. Constancin, D. Donsez, L. Gurgen, P. Lalanda, V. Legrand, V. Lestideau, S. Marié, C. Marin, A. Moreau, V. Olive
Extension de passerelles OSGi pour les domaines de la distribution électrique: Modèles et outils
Atelier de travail OSGi 2006, 2006, Paris, France, hal-00097266

J. Chalopin, V. Chepoi, N. Nisse, Y. Vaxès
Cop and robber games when the robber can hide and ride
8th French Combinatorial Conference, 06/2010, Orsay, France, inria-00482117

D. Coudert
Graph searching games for the WDM reconfiguration problem
24th European Conference on Operational Research (EURO), 11/07/2010, Lisbon, Portugal, inria-00482113

J. Deantoni, F. Mallet, C. André, F. Thomas
Logical time @ work: the RT-Simex project
Sophia Antipolis Formal Approach, 06/04/2011, Sophia, France, inria-00587151

V. Dung Doan, M. Bossy, F. Baude, I. Stokes-Rees
Comparison of parallel distributed American option pricing: Through Continuation Values Classification Versus Optimal Exercise Boundary Computation
Sixth IMACS Seminar on Monte Carlo Methods, 18/06/2007, Reading, Royaume-Uni, hal-00605712

N. Nisse
Graph Searching and Graph Decompositions
24th European Conference on Operational Research (EURO) (2010), 07/2010, Lisbon, Portugal, inria-00482115

vers haut de page   AUTRES

O. Dalle
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 1
SCS Modeling and Simulation Magazine(3) pp.122-132, 01/07/2011, inria-00638553

O. Dalle
Should Simulation Products use Software Engineering Techniques or Should they Reuse Products of Software Engineering? -- Part 2
SCS Modeling and Simulation Magazine(4) pp., 01/07/2011, inria-00638555

S. Demathieu, S. Gérard, F. Mallet
Marte, le nouveau standard UML pour les systèmes temps réel embarqués
Electronique(189) pp.2-6, 2008, inria-00371386