|
MASCOTTE no longer exists => visit the new project-team
Internal reports
BACK TO MASCOTTE PUBLICATION INDEX
Internal reports
-
J. Araujo,
F. Giroire,
Y. Liu,
R. Modrzejewski,
and J. Moulierac.
Energy Efficient Content Distribution.
Technical report RR-8091,
INRIA,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
G. Morel,
L. Sampaio,
R. Soares,
and V. Weber.
Hull number: $P_5$-free graphs and reduction rules.
Technical report RR-8045,
INRIA,
August 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and A. K. Maia.
Finding a subdivision of a digraph.
Technical report RR-8024,
INRIA,
July 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
G. D'Angelo,
and F. Z. Moataz.
Diverse Routing with the star property.
Technical report RR-8071,
INRIA,
September 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Perpetual Graph Searching.
Technical report RR-7897,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Campos,
F. Havet,
R. Sampaio,
and A. Silva.
Backbone colouring: tree backbones with small diameter in planar graphs.
Technical report RR-8151,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
and A. Lancin.
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs.
Technical report RR-8074,
INRIA,
September 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
and A. Navarra.
How to gather asynchronous oblivious robots on anonymous rings.
Technical report RR-7963,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
A. Navarra,
N. Nisse,
and K. Suchan.
A unified approach for different tasks on rings in robot-based computing systems.
Technical report RR-8013,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Ducoffe.
Eulerian and Hamiltonian Directed Hypergraphs.
Technical report RR-7893,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and A. D. King.
List circular backbone colouring.
Technical report RR-8159,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
A. D. King,
M. Liedloff,
and I. Todinca.
(Circular) backbone colouring: tree backbones in planar graphs.
Technical report RR-8152,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
A. K. Maia,
and M. Yu.
Complexity of greedy edge-colouring.
Technical report RR-8171,
INRIA,
December 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
N. Paramaguru,
and R. Sampathkumar.
Detection number of bipartite graphs and cubic graphs.
Technical report RR-8115,
INRIA,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
Technical report RR-7888,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and R. Soares.
On The Monotonicity of Process Number.
Technical report RR-7003,
INRIA,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Aboulker,
F. Havet,
and N. Trotignon.
On wheel-free graphs.
Research Report RR-7651,
INRIA,
June 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
C. Linhares Sales,
B. Reed,
and S. Thomassé.
Oriented trees in digraphs.
Research Report 7502,
INRIA,
01 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted Improper Colouring.
Research Report RR-7590,
INRIA,
04 2011.
[WWW
] [PDF
]
Keywords:
graph colouring,
improper colouring,
grids,
integer programming,
algorithms.
[Abstract] [bibtex-entry]
-
J. Araujo,
V. Campos,
F. Giroire,
N. Nisse,
L. Sampaio,
and R. Soares.
On the hull number of some graph classes.
Technical report RR-7567,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
A. Kosowski,
N. Nisse,
I. Rapaport,
and K. Suchan.
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power.
Technical report RR-7746,
INRIA,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
Research Report RR-7850,
INRIA,
2011.
[WWW
] [PDF
]
Keywords:
Reconfiguration,
WDM,
NP-complete,
Physical Layer Impaiments..
[Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Jean-Marie,
D. Mazauric,
and J. Yu.
Well Balanced Designs for Data Placement.
Research Report 7725,
INRIA,
09 2011.
[WWW
] [Abstract] [bibtex-entry]
-
S. Bessy and F. Havet.
Enumerating the edge-colourings and total colourings of a regular graph.
Research Report RR-7652,
INRIA,
June 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Campos and F. Havet.
5-choosability of graphs with 2 crossings.
Research Report RR-7618,
INRIA,
05 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. G. Chang,
F. Havet,
M. Montassier,
and A. Raspaud.
Steinberg's Conjecture and near-colorings.
Rapport de recherche RR-7669,
INRIA,
7 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
Technical report RR-7740,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
S. K. Gupta,
R. Modrzejewski,
J. Monteiro,
and S. Pérennes.
Analysis of the Repair Time in Distributed Storage Systems.
Research Report RR-7538,
INRIA,
02 2011.
[WWW
] [PDF
]
Keywords:
P2P storage systems,
data lifetime,
queuing model,
regenerating codes per- formance evaluation.
[Abstract] [bibtex-entry]
-
F. Havet and X. Zhu.
The game Grundy number of graphs.
Rapport de recherche RR-7646,
INRIA,
June 2011.
[WWW
] [PDF
]
Keywords:
colouring game,
game Grundy number,
trees,
partial 2-trees.
[Abstract] [bibtex-entry]
-
F. Maffray and G. Morel.
On 3-colorable $P_5$-free graphs.
Technical report 191,
Les Cahiers Leibniz, Laboratoire G-SCOP,
2011.
[PDF
] [bibtex-entry]
-
J. Moulierac,
T. K. Phan,
N. Thoai,
and C. Tran.
Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer Multicast.
Rapport de recherche RR-7784,
INRIA,
December 2011.
[WWW
] [PDF
]
Keywords:
IP multicast,
Application Layer Multicast,
Xcast,
media streaming,
linear program,
algorithms.
[Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
Research Report 7430,
INRIA,
10 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. V. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Research Report 7363,
INRIA,
August 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Adding a referee to an interconnection network: What can(not) be computed in one round.
Research Report arXiv:1009.4447,
arXiv,
September 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
F. Havet,
F. Huc,
and C. Linhares Sales.
Improper colouring of weighted grid and hexagonal graphs.
Research Report RR-7250,
INRIA,
April 2010.
[WWW
] [PDF
]
Keywords:
Improper colouring,
Weighted colouring,
Approximation algorithms.
[Abstract] [bibtex-entry]
-
V. Campos,
A. Gyárfás,
F. Havet,
C. Linhares Sales,
and F. Maffray.
New bounds on the Grundy number of products of graphs.
Research Report 7243,
INRIA,
April 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
Research Report RR-7209,
INRIA,
February 2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
data life time,
mean time to data loss,
performance evaluation,
Markov chains.
[Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxès.
Cop and robber games when the robber can hide and ride..
Technical report INRIA-RR7178,
INRIA,
January 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen and F. Havet.
Linear and 2-frugal choosability of graphs of small maximum average degree.
Research Report RR-7213,
INRIA,
02 2010.
[WWW
] [Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
Research Report inria-00464318,
May 2010.
[WWW
] [PDF
]
Keywords:
power consumption,
energy-efficient routing,
graphs,
linear programming.
[Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
How to beat the random walk when you have a clock?.
Research Report RR-7210,
INRIA,
February 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
C. Linhares Sales,
and L. Sampaio.
b-coloring of tight graphs.
Research Report 7241,
INRIA,
March 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Uribe,
J-C. Maureira Bravo,
and O. Dalle.
Extending INET Framework for Directional and Asymmetrical Wireless Communications.
Research Report RR-7120,
INRIA,
03 2010.
[WWW
] [PDF
]
Keywords:
OMNeT++,
INET Framework,
Directional Radios,
Asymmetrical communication.
[Abstract] [bibtex-entry]
-
J. Araujo,
N. Cohen,
F. Giroire,
and F. Havet.
Good edge-labelling of graphs.
Research Report 6934,
INRIA,
2009.
[WWW
] [PDF
]
Keywords:
graph theory,
complexity,
edge-labelling,
planar graphs,
matching-cut,
channel assignment.
[Abstract] [bibtex-entry]
-
J-C. Bermond,
C.J. Colbourn,
L. Gionfriddo,
G. Quattrocchi,
and I. Sau.
Drop cost and wavelength optimal two-period grooming with ratio 4.
Technical report RR-7101,
INRIA,
November 2009.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
and S. Pérennes.
Directed acyclic graphs with unique path property.
Technical report 6932,
INRIA,
May 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
H. Rivano,
I. Sau,
and F. Solano Donado.
MPLS label stacking on the line network.
Technical report RR-6803,
INRIA,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts.
Research Report RR-7071,
INRIA,
October 2009.
[WWW
] [PDF
]
Keywords:
GMPLS,
optical networks,
label stacking,
hypergraph layout,
approximation algorithms,
dynamic programming..
[Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
GMPLS Routing Strategies based on the Design of Hypergraph Layouts.
Technical report RR-6842,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
and J. Peters.
Online Distributed Traffic Grooming on Path Networks.
Technical report RR-6833,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
X. Muñoz,
and I. Sau.
Traffic Grooming in Bidirectional WDM Ring Networks.
Technical report RR-7080,
INRIA,
October 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Fast Data Gathering in Radio Grid Networks.
Research Report RR-6851,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks..
Technical report RR-7047,
INRIA,
September 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen and F. Havet.
Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof.
Research Report RR-7098,
November 2009.
[WWW
]
Keywords:
edge-colouring,
list colouring,
List Colouring Conjecture,
planar graphs.
[Abstract] [bibtex-entry]
-
N. Cohen,
F. Havet,
and T. Müller.
Acyclic edge-colouring of planar graphs.
Research Report 6876,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Giroire,
and I. Sau.
Circuit visiting 10 ordered vertices in infinite grids.
Technical report RR-6910,
INRIA,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth..
Technical report RR-6790,
INRIA,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Eggemann,
F. Havet,
and S. Noble.
$k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.
Research Report 6840,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Erman,
F. Havet,
B. Lidicky,
and O. Pangrác.
5-colouring graphs with 4 crossings.
Research Report 7110,
INRIA,
November 2009.
[Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?.
Research Report RR-7006,
INRIA,
July 2009.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance evaluation,
data durability.
[Abstract] [bibtex-entry]
-
F. Havet,
S. Jendrol',
R. Soták,
and E. Skrabul'aková.
Facial non-repetitive edge-colouring of plane graphs.
Research Report 6873,
INRIA,
February 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Hogie,
D. Papadimitriou,
I. Tahiri,
and F. Majorczyk.
Simulating routing schemes on large-scale topologies.
Technical report RT-0371,
INRIA,
November 2009.
[Abstract] [bibtex-entry]
-
F. Huc,
C. Molle,
N. Nisse,
S. Perennes,
and H. Rivano.
Stability of a local greedy distributed routing algorithm.
Technical report RR-6871,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Maureira Bravo,
D. Dujovne,
and O. Dalle.
Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover.
Research Report RR-6850,
INRIA,
2009.
[WWW
] [Abstract] [bibtex-entry]
-
J. Rué,
I. Sau,
and D. M. Thilikos.
Dynamic Programming for Graphs on Surfaces.
Technical report RR-7166,
INRIA,
December 2009.
[PDF
] [Abstract] [bibtex-entry]
-
A. Silva,
P. Reyes,
and M. Debbah.
Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks.
Research Report RR-6854,
INRIA,
March 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
E. Altman,
P. Nain,
and J-C. Bermond.
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.
Research Report RR-6645,
INRIA,
September 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
I. Sau,
and J. Zerovnik.
$(\ell,k)$-Routing on Plane Grids.
Research Report 6480,
INRIA,
March 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
Research Report RR-6690,
INRIA,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Asté,
F. Havet,
and C. Linhares-Sales.
Grundy number and products of graphs.
Research Report RR-6672,
INRIA,
October 2008.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
I. Caragiannis,
D. Coudert,
F. Diedrich,
L. Hogie,
F. Huc,
C. Molle,
J. Monteiro,
P. Leone,
H. Rivano,
and I. Sau.
Algorithmic solutions for critical resource sharing: third year.
Technical report Deliverable 2.2.3,
IST FET AEOLUS, Integrated Project IST-015964,
2008.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
R. Correa,
and M.-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Technical report inria-00168162,
HAL,
August 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
V. Misra,
and P. Nain.
Distributed Call Scheduling in Wireless Networks.
Technical report RR-6763,
INRIA,
December 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
V. Papadopoulou,
and E. Pitoura.
Subproject2: Resource Management Report on the activities of the third year.
Technical report Deliverable 2.O.3,
IST FET AEOLUS, Integrated Project IST-015964,
2008.
[PDF
] [bibtex-entry]
-
P. Berthomé and N. Nisse.
A unified FPT Algorithm for Width of Partition Functions.
Research Report RR-6646,
INRIA,
September 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Correa,
F. Havet,
and J.-S. Sereni.
About a Brooks-type theorem for improper colouring.
Research Report RR-6432,
INRIA,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A distributed algorithm for computing and updating the process number of a forest.
Research Report RR-6560,
INRIA,
June 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services.
Research Report RR-6698,
INRIA,
October 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert and D. Mazauric.
Network Reconfiguration using Cops-and-Robber Games.
Research Report RR-6694,
INRIA,
August 2008.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and H. Rivano.
Wireless Backhaul Networks: Minimizing Energy Consumption by Power Efficient Radio Links Configuration.
Technical report RR-6752,
INRIA,
December 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analysis of Failure Correlation in Peer-to-Peer Storage Systems.
Technical report RR-6761,
INRIA,
December 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Galtier.
New algorithms to compute the strength of a graph.
Research Report RR-6592,
INRIA,
July 2008.
[bibtex-entry]
-
C. Gomes,
S. Pérennes,
and H. Rivano.
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks.
Technical report inria-00282200,
INRIA,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
M. Klazar,
J. Kratochvil,
D. Kratsch,
and M. Liedloff.
Exact algorithms for $L(2,1)$-labelling.
Research Report RR-6587,
INRIA,
07 2008.
[Abstract] [bibtex-entry]
-
F. Havet,
D. Král,
J.-S. Sereni,
and R. Skrekovski.
Facial coloring using Hall's Theorem.
Research Report 383,
ITI-series,
2008.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
$L(p,1)$-labelling of graphs.
Research Report RR-6673,
INRIA,
October 2008.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
J. van den Heuvel,
C. McDiarmid,
and B. Reed.
List Colouring Squares of Planar Graphs.
Research Report RR-6586,
INRIA,
July 2008.
[Abstract] [bibtex-entry]
-
X. Muñoz and I. Sau.
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph.
Research Report RR-6481,
INRIA,
March 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse,
K. Suchan,
and I. Rapaport.
Distributed computing of efficient routing schemes in generalized chordal graphs.
Technical report CMM-B-08/10-220,
CMM,
October 2008.
[PDF
] [Abstract] [bibtex-entry]
-
S. Pérennes and I. Sau.
Sur la Conjecture des Jeux Uniques.
Research Report RR-6691,
INRIA,
October 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report INRIA-00174965,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
L. Esperet,
and J. van den Heuvel.
Frugal Colouring of Graphs.
Research Report 6178,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Havet,
F. Huc,
and S. Thomassé.
WDM and Directed Star Arboricity.
Research Report 6179,
INRIA,
January 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Mazoit,
N. Nisse,
and S. Thomassé.
Submodular partition functions.
Technical report RR-1427-07,
LABRI, Univ. Bordeaux,
April 2007.
Note: Submitted in SIAM J. discrete Maths. [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
Research Report 6236,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
I. Sau,
and S. Saurabh.
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
Research Report 6237,
INRIA,
June 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
I. Caragiannis,
D. Coudert,
C. Gomes,
I. Guerin-Lassous,
G. Huiban,
C. Molle,
and I. Sau.
Algorithmic solutions for critical resource sharing: second year.
Technical report Deliverable 2.2.2,
IST FET AEOLUS, Integrated Project IST-015964,
2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
and B. Leveque.
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring.
Technical report inria-00175795,
hal,
October 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
V. Papadopoulou,
and E. Pitoura.
Subproject2: Resource Management Report on the activities of the second year.
Technical report Deliverable 2.O.2,
IST FET AEOLUS, Integrated Project IST-015964,
2007.
[PDF
] [bibtex-entry]
-
D. Coudert,
F. Huc,
F. Peix,
and M-E. Voge.
On Minimizing the Average Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Technical report inria-00175813,
hal,
October 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
S. Perennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues.
Technical report inria-00175143,
HAL,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and J-S. Sereni.
Characterization of graphs and digraphs with small process number.
Research Report 6285,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Galtier.
Tournament MAC with constant size congestion window for WLAN.
Technical report RR-6396,
INRIA,
December 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Chendrashekar,
G. Iannaccone,
T. Karagiannis,
K. Papagiannaki,
E. Schooler,
and N. Taft.
Inside the Forbidden City: A look at End-Host Traffic inside a Modern Enterprise.
Technical Report,
Intel Research,
2007.
[PDF
] [bibtex-entry]
-
F. Giroire,
J. Chendrashekar,
N. Taft,
G. Iannaccone,
T. Karagiannis,
K. Papagiannaki,
and E. Schooler.
The Case For Personalizing End-Host Detectors..
Technical Report,
Intel Research,
2007.
[PDF
] [bibtex-entry]
-
C. Gomes and H. Rivano.
Fair Joint Routing and Scheduling Problem in Wireless Mesh Networks.
Research Report 6198,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. Kang,
and J.-S. Sereni.
Improper colouring of unit disk graphs.
Research Report 6206,
INRIA,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and S. Thomasse.
Complexity of $(p,1)$-total labelling.
Research Report 6305,
INRIA,
September 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
Technical Report RR-1437-07,
LaBRI,
October 2007.
[bibtex-entry]
-
L. Liquori,
D. Borsetti,
C. Casetti,
and C. Chiasserini.
Overlay Networks for Vehicular Networks.
Research Report,
Politecnico di Torino,
2007.
[bibtex-entry]
-
C. Molle,
F. Peix,
and H. Rivano.
Cross-Layer Design for Wireless Mesh Networks Using Column Generation.
Technical report 6448,
INRIA,
December 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Nain,
C. Casetti,
and L. Liquori.
A Stochastic Model of an Arigatoni Overlay Computer.
Research Report to be given,
Politecnico di Torino,
2007.
[bibtex-entry]
-
S. Teigen.
Distributing OSA Simulations using FractalRMI.
Technical Report,
INRIA,
2007.
Note: Unpublished, internal document.[bibtex-entry]
-
O. Amini,
F. Giroire,
F. Huc,
and S. Pérennes.
Minimal selectors and fault tolerant networks.
Research report,
INRIA Research Report HAL-00082015,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Amini,
F. Huc,
and S. Pérennes.
On the pathwidth of planar graphs.
Research report,
INRIA Research Report HAL-00082035,
July 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
H. Rivano,
and M. Syska.
Critical resource sharing, State of the art Survey.
Technical report Deliverable 2.2.1,
IST FET AEOLUS, Integrated Project IST-015964,
2006.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of gathering in static radio networks.
Research Report 5936,
INRIA,
06 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
V. Papadopoulou,
and E. Pitoura.
Subproject2: Resource Management Report on the activities of the first year.
Technical report Deliverable 2.O.1,
IST FET AEOLUS, Integrated Project IST-015964,
2006.
[PDF
] [bibtex-entry]
-
D. Coudert,
P. Datta,
S. Pérennes,
H. Rivano,
and M-E. Voge.
Complexity and approximability issues of Shared Risk Resource Group.
Technical report,
INRIA Research Report 5859 and I3S Research Report I3S/RR-2006-08-FR,
2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and J.S. Sereni.
Pathwidth of outerplanar graphs.
Technical report,
INRIA Research Report 5804 and I3S Research Report I3S/RR-2006-02-FR,
January 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Dalle.
OSA: an Open Component-based Architecture for Discrete-Event Simulation.
Technical report RR-5762, version 2,
INRIA,
February 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Delmas,
F. Havet,
M. Montassier,
and S. Pérennes.
Design of fault tolerant on-board networks.
Research report,
INRIA Research Report 5866,
March 2006.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet.
Choosability of the square of planar subcubic graphs with large girth.
Research report,
INRIA Research Report 5800 and I3S Research Report I3S/RR-2006-01-FR,
January 2006.
Note: Submitted to Discrete Mathematics.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet,
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Circular Choosability.
Research report,
INRIA Research Report 5957 and I3S Research Report I3S/RR-2006-21-FR,
July 2006.
Note: Submitted to Journal of Graph Theory.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet,
J.-S. Sereni,
and R. Skrekovski.
3-facial colouring of plane graphs.
Research report,
INRIA Research Report 5943 and I3S Research Report I3S/RR-2006-20-FR,
July 2006.
Note: Submitted to SIAM Journal on Discrete Mathematics.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet,
S. Thomassé,
and A. Yeo.
Hoàng-Reed conjecture holds for tournaments.
Research report,
INRIA Research Report 5976,
September 2006.
Note: Submitted Discrete Mathematics.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Lenisa,
F. Honsell,
and L. Liquori.
A Framework for Defining Logical Frameworks.
Research Report,
RR INRIA and University of Udine,
2006.
[WWW
] [bibtex-entry]
-
G. Méheut,
S. Pérennes,
and H. Rivano.
Evaluation stochastique et simulation des réseaux radio.
Research report 5989,
INRIA,
September 2006.
[WWW
] [Abstract] [bibtex-entry]
-
H. Rivano,
F. Théoleyre,
and F. Valois.
About the Capacity of Flat and Self-Organized Ad Hoc and Hybrid Networks.
Research Report,
INRIA Research Report 5977,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
and S. Thomassé.
Paths with two blocks in $n$-chromatic digraphs.
Research report,
INRIA Research Report 5688 and I3S Research Report I3S/RR-2005-27-FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J-C. Bermond,
L. Braud,
and D. Coudert.
Traffic Grooming on the Path.
Technical report,
INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf),
2005.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
D. Coudert,
and S. Perennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
Technical report,
INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf),
2005.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
C. Cooper,
R. Klasing,
and M. Zito.
Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Technical report,
INRIA Research Report RR-5529 and I3S Research Report I3S/RR-2005-09-FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
D. Coudert,
P. Datta,
H. Rivano,
and M.-E. Voge.
Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks.
Research Report,
I3S Research Report I3S/RR-2005-37-FR,
2005.
[WWW
] [PDF
] [bibtex-entry]
-
C. Gomes and H. Rivano.
WDM Mesh Networks with Dynamic Traffic.
Research report,
INRIA Research Report 5713,
2005.
[WWW
] [Abstract] [bibtex-entry]
-
F. Havet.
Repartitors, selectors and superselectors.
Research report,
INRIA Research Report 5686,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
G. Huiban and P. Datta.
Virtual topology reconfiguration issues in evolution of WDM optical networks.
Research report 5711,
INRIA,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Huiban and G. Robson Mateus.
Optimization aspects of the reconfiguration problem in WDM networks.
Research report,
INRIA Research Report 5730 and I3S Research Report I3S/RR-2005-33-FR,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
Research report,
INRIA Research Report 5761 and I3S Research Report I3S/RR-2005-35-FR,
November 2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
R. Klasing,
C. Laforest,
J. Peters,
and N. Thibault.
Constructing Incremental Sequences in Graphs.
Research Report,
INRIA Research Report RR-5648 and I3S Research Report I3S/RR-2005-22-FR,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Approximation Results for Black Hole Search in Arbitrary Networks.
Research Report,
INRIA Research Report RR-5659 and I3S Research Report I3S/RR-2005-23-FR,
2005.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J. Moulierac and A. Guitton.
Distributed Multicast Tree Aggregation.
Technical report 5636,
Inria,
July 2005.
[PDF
] [Abstract] [bibtex-entry]
-
J. Moulierac and M. Molnàr.
Active monitoring of delays with asymmetric routes.
Technical report 5635,
Inria,
July 2005.
[PDF
] [Abstract] [bibtex-entry]
-
S. Alouf,
E. Altman,
J. Galtier,
J.-F. Lalande,
and C. Touati.
Un algorithme d'allocation de bande passante satellitaire.
Research Report RR-5172,
INRIA Sophia Antipolis,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
April 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J.-C. Bermond,
F. Havet,
and C. D. Tóth.
Fault tolerant on-board networks with priorities.
Research Report RR-5363,
INRIA,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
November 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
S. Bessy,
E. Birmelé,
and F. Havet.
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree.
Research Report RR-5364,
INRIA,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
November 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
S. Choplin,
J. Galtier,
and S. Pérennes.
Optimal concave costs in the SDH context.
Research Report RR-5201,
INRIA,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
May 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
C. Cooper,
R. Klasing,
and T. Radzik.
A randomized algorithm for the joining protocol in dynamic distributed networks.
Research Report,
INRIA Research Report RR-5376 and I3S Research Report I3S/RR-2004-39-FR,
2004.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Guitton and J. Moulierac.
Scalable Tree Aggregation with a Large Number of Multicast Groups.
Technical report 1663,
Irisa,
December 2004.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet and J.-S. Sereni.
Improper choosability of graphs and maximum average degree.
Research report,
INRIA Research Report 5164 and I3S Research Report I3S/RR-2004-11-FR,
April 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
The Points and Vertices Game.
Research Report TRCS 030/2004,
Dipartimento di Informatica, Università degli Studi di L'Aquila,
2004.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
R. Klasing,
N. Morales,
and S. Pérennes.
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands.
Research Report,
INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR,
2004.
Note: Submitted to Theoretical Computer Science.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J.-F. Lalande,
M. Syska,
and Y. Verhoeven.
Mascopt - A Network Optimization Library: Graph Manipulation.
Technical report RT-0293,
INRIA Sophia Antipolis,
2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis,
April 2004.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Navarra.
Tighter Bounds for the Minimum Energy Broadcasting problem.
Research Report TRCS 033/2004,
Dipartimento di Informatica, Università degli Studi di L'Aquila,
2004.
[bibtex-entry]
-
F. Havet.
Stable set meeting every longest path.
Research Report,
INRIA Research Report 5009 and I3S Research Report I3S/RR-2003-29-FR,
2003.
[WWW
] [PDF
] [bibtex-entry]
-
F. Havet.
Upper bound for the span of (s,1)-total labelling of graphs.
Research Report,
INRIA Research Report 4816 and I3S Research Report I3S/RR-2003-13-FR,
2003.
[WWW
] [PDF
] [bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Fair Bandwidth allocation between service providers in a geostationary satellite network.
Technical report RR-4421,
INRIA,
March 2002.
[bibtex-entry]
-
N. Baskiotis,
S. Pérennes,
and H. Rivano.
Heuristic design of multifiber WDM optical networks by randomized rounding of multicommodity flow.
Research Report RR-4418,
INRIA Research Report 4418,
2002.
[WWW
] [Abstract] [bibtex-entry]
-
B. Beauquier,
S. Pérennes,
and M. Syska.
Efficient Access to Optical Bandwidth, Routing and Grooming in WDM Networks: State-of-the-art survey.
IST CRESCCO report,
Projet MASCOTTE (CNRS/INRIA/UNSA),
Sophia Antipolis,
July 2002.
[bibtex-entry]
-
J.-C. Bermond and S. Céroi.
Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3.
Technical report RR-4626,
INRIA,
Sophia Antipolis,
November 2002.
[bibtex-entry]
-
S. Bessy,
F. Havet,
and J. Palaysi.
Pancyclic Arcs and Connectivity in Tournaments.
Rapport de recherche INRIA/RR-4522,
Projet MASCOTTE,
Sophia Antipolis,
August 2002.
[bibtex-entry]
-
S. Bhadra and A. Ferreira.
Computing multicast trees in dynamic networks using evolving graphs.
Research Report 4531,
INRIA,
2002.
[bibtex-entry]
-
D. Coudert and H. Rivano.
Lightpath assignment for multifibers WDM optical networks with wavelength translators.
Research Report,
INRIA Research Report 4487,
2002.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira and L. Viennot.
A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks.
Research Report 4403,
INRIA,
2002.
[bibtex-entry]
-
F. Giroire,
A. Nucci,
N. Taft,
and C. Diot.
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection.
Technical Report,
Sprint,
2002.
[Abstract] [bibtex-entry]
-
F. Havet.
Pancyclic Arcs and Connectivity in Tournaments.
Rapport de recherche INRIA/RR-4378,
Projet MASCOTTE,
Sophia Antipolis,
March 2002.
[bibtex-entry]
-
F. Havet and J. Yu.
On $(d,1)$-total labelling of graphs.
Rapport de recherche INRIA,
Projet MASCOTTE,
Sophia Antipolis,
November 2002.
[bibtex-entry]
-
A. Jarry.
Integral Symmetric 2-Commodity Flows.
Technical report RR-4622,
INRIA,
Sophia Antipolis,
November 2002.
[bibtex-entry]
-
A. Jarry and A. Laugier.
Two-connected graphs with given diameter.
Technical report RR-4307,
INRIA,
Sophia Antipolis,
March 2002.
[bibtex-entry]
-
B. Xuan,
A. Ferreira,
and A. Jarry.
Computing shortest, fastest, and foremost journeys in dynamic networks.
Technical report RR-4589,
INRIA,
Sophia Antipolis,
November 2002.
[bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
On fairness in bandwidth allocation.
Rapport de Recherche 4269,
INRIA, Sophia Antipolis,
septembre 2001.
[bibtex-entry]
-
O. Audouin,
C. Blaizot,
E. Dotaro,
M. Vigoureux,
B. Beauquier,
J.-C. Bermond,
B. Bongiovanni,
S. Pérennes,
M. Syska,
S. Bibas,
L. Chacon,
B. Decocq,
E. Didelet,
A. Laugier,
A. Lisser,
A. Ouorou,
and F. Tillerot.
Planification et Optimisation des Réseaux de Transport Optiques.
Rapport final RNRT PORTO,
Alcatel Research & Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France Télécom R&D,
Sophia Antipolis,
December 2001.
[bibtex-entry]
-
J.-C. Bermond,
D. Coudert,
and M-L. Yu.
On DRC-Covering of $K_n$ by cycles.
Technical report,
INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR,
2001.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Ferreira,
S. Pérennes,
A. Richa,
H. Rivano,
and N. Stier.
On the design of multifiber WDM networks.
Research Report,
INRIA Research Report 4244,
August 2001.
[WWW
] [Abstract] [bibtex-entry]
-
A. Ferreira,
S. Pérennes,
and H. Rivano.
Fractional coloring of bounded degree trees.
Research Report,
INRIA Research Report 4094,
January 2001.
[WWW
] [Abstract] [bibtex-entry]
-
B. Beauquier,
O. Delmas,
and S. Pérennes.
Tight bounds for broadcasting in the linear cost model.
Rapport de Recherche 3827,
INRIA,
novembre 2000.
[bibtex-entry]
-
O. Dalle and C. Rigal.
Exemple d'utilisation de l'environnement de simulation ASIMUT.
Rapport technique ATF-SB-1-0043-CNES,
C.N.E.S.,
Mars 2000.
[bibtex-entry]
-
O. Dalle and V. Sutter.
Spécification technique de besoin logiciel de l'environnement de simulation ASIMUT.
Spécification ATF-SB-1-0029-CNES,
C.N.E.S.,
Mars 2000.
[bibtex-entry]
-
E. Darrot.
Convention A11518 INRIA--Alcatel Space Industries.
Rapport de contrat,version révisée,
INRIA Sophia Antipolis,
France,
Mai 2000.
[bibtex-entry]
-
B. Beauquier and E. Darrot.
On arbitrary size Waksman networks and their vulnerability.
Rapport de recherche 3788 --- Thème 1,
INRIA Sophia Antipolis,
France,
October 1999.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Digraph Isomorphisms and Free Space Optical Networks.
Technical report,
INRIA Research Report 3817,
1999.
[POSTSCRIPT
] [bibtex-entry]
-
O. Dalle.
Etat de l'art sur les couches MAC.
Contribution du C.N.E.S. au rapport d'avancement de la Convention 2 du projet R.N.R.T. <>,
Juin 1999.
[bibtex-entry]
-
E. Darrot.
Convention A11518 INRIA--Alcatel Space Industries.
Rapport de contrat ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
[bibtex-entry]
-
E. Darrot.
Evitement des boucles dans les anneaux de redondance.
Rapport de recherche ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
[bibtex-entry]
-
E. Darrot.
Réseaux réarrangeables à commutateurs à lamelles.
Rapport de recherche ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Lower Bounds on systolic gossip..
Technical report 3612,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
-
M. Flammini and S. Pérennes.
Tight Upper bound for broadcasting and gossiping.
Technical report,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
[bibtex-entry]
-
F. Fraigniaud,
A. Pelc,
and S. Pérennes.
Fast tree naming.
Technical report 3609,
INRIA,
1999.
[bibtex-entry]
-
J. Galtier.
Using Parallel Computing to Reduce CPU Power.
Research Report 3621,
INRIA,
February 1999.
[WWW
] [PDF
] [bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Optimal broadcasting in unknown networks.
Technical report 3609,
INRIA,
1999.
[bibtex-entry]
-
D. Bacchiega,
D. Gotta,
L. Liquori,
M. Porta,
and M. Ramella Votta.
Ipotesi Evolutive del Sistema MOMIX per la Specifica e Qualificazione di Sistemi TMN.
Technical Report DTR 98.0089,
CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center,
1998.
Note: Not available. In Italian.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
G. Siegel,
and L. Villefranche.
Car Following Algorithms.
Technical report,
Hipertrans Consortium,
1998.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
G. Siegel,
and L. Villefranche.
Parallel Architecture Issues.
Technical report,
Hipertrans Consortium,
1998.
[bibtex-entry]
-
D. Bacchiega,
D. Gotta,
L. Liquori,
M. Porta,
and R. Rossi.
MOMIX-emSDH2. Simulatore di Agent di Element Manager SDH2.0. Versione 2.2.3. Manuale Utente e Guida di Riferimento.
Technical Report DTR 97.0413,
CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center,
1997.
Note: Not available. In Italian.
[bibtex-entry]
-
O. Dalle.
MPCFS : Un exemple d'intégration transparente des mécanismes de communication multi-points au sein des Systèmes d'Exploitation UNIX.
Technical report I3S/RR97-10,
INRIA / CNRS / UNSA,
1997.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
About Traces and Statistics Collection in Hipertrans.
Technical report,
hipertrans Project,
July 1997.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
An Object Oriented Framework for Traffic Simulation.
Technical report,
hipertrans Project,
July 1997.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
G. Siegel,
and L. Villefranche.
PACSIM Specification.
Technical report,
hipertrans Project,
November 1997.
[bibtex-entry]
-
F. Baude and O. Dalle.
Analyse des performances de communication du protocole PVM.
Rapport de recherche 96-08,
Laboratoire I3S, UPRES-A 6070 CNRS-UNSA,
Mars 1996.
[bibtex-entry]
-
O. Dalle.
LoadBuilder: A tool for generating and modeling workloads in distributed workstations environments.
Rapport de recherche RR-3045,
INRIA,
Octobre 1996.
Note: Version longue.
[bibtex-entry]
-
L. Liquori.
An Extended Theory of Primitive Objects.
Technical Report CS-23-96,
Computer Science Department, University of Turin,
1996.
[bibtex-entry]
-
F. Baude,
F. Belloncle,
D. Caromel,
N. Furmento,
P. Mussi,
Y. Roudier,
and G. Siegel.
Parallel Object-Oriented Programming for Parallel Simulations.
Technical report,
I3S No RR-95-59,
December 1995.
[bibtex-entry]
-
P. Mussi and G. Siegel.
Sequential Simulation in Prosit: Programming Model and Implementation.
Technical report RR-2713,
INRIA,
November 1995.
[bibtex-entry]
-
A. Jean-Marie,
P. Mussi,
and M. Syska.
Communications in Multiprocessor Machines - A Survey.
QMIPS Report D W3.T2-T3.19.v1,
INRIA,
September 1994.
[bibtex-entry]
-
P. Mussi and H. Rakotoarisoa.
PARallélisation sur réseaux de Transputers de Simulations pour l'EVALuation de performances.
Rapport technique 131,
INRIA Sophia Antipolis,
Septembre 1991.
[bibtex-entry]
-
F. Baccelli,
M. Badel,
A. Jean-Marie,
Z. Liu,
and P. Mussi.
Specifications for Synchronization Primitives in the QNET Tool.
Technical report,
INRIA Sophia Antipolis,
1989.
[bibtex-entry]
-
A. Ferreira.
An optimal ${O(n^2)}$ algorithm to fold special PLA's.
Technical report,
1989.
Note: (abstract).
[bibtex-entry]
-
P. Mussi and P. Nain.
Description and Specifications for New Product-Form Queueing Network Stations.
Technical report,
INRIA Sophia Antipolis,
1989.
[bibtex-entry]
-
P. Mussi and P. Nain.
On New Product-Form Queueing Network Stations.
Technical report,
INRIA Sophia Antipolis,
1989.
[bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:00 2013
This document was translated from BibTEX by
bibtex2html
|
