-
R. Balakhrishnan,
J.-C. Bermond,
and P. Paulraja.
Combinatorics and Number Theory.
In Editors Special Issues of Discrete Mathematics,
volume 206,
pages 1-220.
North Holland,
1999.
@INCOLLECTION{BBP99,
Author= {R. Balakhrishnan and J.-C. Bermond and P. Paulraja},
booktitle ={Editors Special Issues of Discrete Mathematics},
title ={Combinatorics and Number Theory},
Year={1999},
Journal={Discrete Mathematics },
publisher ={North Holland},
Volume= {206},
Pages= {1-220},
}
-
A. Ferreira.
On the design of parallel discrete algorithms for high performance computing systems.
In P. Pardalos, editor,Parallel Processing of Discrete Problems,
volume 106 of The IMA Volumes in Mathematics and its Aplications,
pages 75-83.
Springer Verlag,
New York (USA),
1999.
@INCOLLECTION{Fer99,
AUTHOR = {A. Ferreira},
ADDRESS = {New York (USA)},
BOOKTITLE = {Parallel Processing of Discrete Problems},
EDITOR = {P. Pardalos},
KEY = {bc-chapter},
PAGES = {75-83},
PUBLISHER = {Springer Verlag},
SERIES = {The IMA Volumes in Mathematics and its Aplications},
TITLE = {{On the design of parallel discrete algorithms for high performance computing systems}},
VOLUME = {106},
YEAR = {1999},
}
-
A. Ferreira.
On the design of parallel discrete algorithms for high performance computing systems.
In P. Pardalos, editor,Parallel Processing of Discrete Problems,
volume 106 of The IMA Volumes in Mathematics and its Aplications,
pages 75-83.
Springer Verlag,
New York (USA),
1999.
@INCOLLECTION{Fer99,
author = {A. Ferreira},
title = {On the design of parallel discrete algorithms for high performance computing systems},
booktitle = {Parallel Processing of Discrete Problems},
editor = {P. Pardalos},
publisher = {Springer Verlag},
volume = {106},
pages = {75-83},
address = {New York (USA)},
series = {The IMA Volumes in Mathematics and its Aplications},
year = {1999}
}
-
M. Molloy and B. Reed.
Graph colouring via the probabilistic method.
In Graph theory and combinatorial biology (Balatonlelle, 1996),
volume 7 of Bolyai Soc. Math. Stud.,
pages 125--155.
János Bolyai Math. Soc.,
Budapest,
1999.
@incollection {MR1673506,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Graph colouring via the probabilistic method},
BOOKTITLE = {Graph theory and combinatorial biology (Balatonlelle, 1996)},
SERIES = {Bolyai Soc. Math. Stud.},
VOLUME = {7},
PAGES = {125--155},
PUBLISHER = {J\'anos Bolyai Math. Soc.},
ADDRESS = {Budapest},
YEAR = {1999},
}
-
M. Molloy,
B. Reed,
and William Steiger.
On the mixing rate of the triangulation walk.
In Randomization methods in algorithm design (Princeton, NJ, 1997),
volume 43 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,
pages 179--190.
Amer. Math. Soc.,
Providence, RI,
1999.
@incollection {MR1660786,
AUTHOR = {Molloy, M. and Reed, B. and Steiger, William},
TITLE = {On the mixing rate of the triangulation walk},
BOOKTITLE = {Randomization methods in algorithm design (Princeton, NJ, 1997)},
SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
VOLUME = {43},
PAGES = {179--190},
PUBLISHER = {Amer. Math. Soc.},
ADDRESS = {Providence, RI},
YEAR = {1999},
}
-
B. Beauquier.
All-To-All Communication in some Wavelength-Routed All-Optical Networks.
Networks,
33(3):179--187,
May 1999.
@ARTICLE{Bea99,
author = {B. Beauquier},
title = {All-To-All Communication in some Wavelength-Routed All-Optical Networks},
journal = {Networks},
publisher = {Wiley-Interscience},
volume = {33},
number = {3},
pages = {179--187},
year = {1999},
month = {may},
}
-
C. Berge and B. Reed.
Edge-disjoint odd cycles in graphs with small chromatic number.
Ann. Inst. Fourier (Grenoble),
49(3):783--786,
1999.
Note: Symposium à la Mémoire de François Jaeger (Grenoble, 1998).
@article {MR1703423,
AUTHOR = {Berge, C. and Reed, B.},
TITLE = {Edge-disjoint odd cycles in graphs with small chromatic number},
NOTE = {Symposium \`a la M\'emoire de Fran\c cois Jaeger (Grenoble, 1998)},
JOURNAL = {Ann. Inst. Fourier (Grenoble)},
VOLUME = {49},
YEAR = {1999},
NUMBER = {3},
PAGES = {783--786},
}
-
J.-C. Bermond,
A. Bonnecaze,
T. Kodate,
S. Pérennes,
and P. Solé.
Symetric flows and broadcasting in hypercubes.
Annales de l'Institut Fourier,
49:787-807,
1999.
[PDF
]
@article{BBKP+99,
author= { J.-C. Bermond and A. Bonnecaze and T. Kodate and S. P\'erennes and P. Sol\'e },
title= { Symetric flows and broadcasting in hypercubes },
year= { 1999 },
journal= { Annales de l'Institut Fourier },
volume= { 49 },
pages= { 787-807 },
pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBK+99.pdf },
}
-
V. Bono,
M. Bugliesi,
M. Dezani-Ciancaglini,
and L. Liquori.
Subtyping for Extensible, Incomplete Objects.
Fundamenta Informaticae,
38(4):325--364,
1999.
[POSTSCRIPT
]
@Article{BBDL99,
author = {Bono, V. and Bugliesi, M. and {Dezani-Ciancaglini}, M. and Liquori, L.},
title = {Subtyping for {E}xtensible, {I}ncomplete {O}bjects},
journal = fi,
year = {1999},
volume = {38},
number = {4},
pages = {325--364},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fi-99.ps.gz}
}
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Integrating list heuristics in genetic algorithms for multiprocessor scheduling.
IEEE Transactions on Parallel and Distributed Systems,
10(8):825-837,
August 1999.
@ARTICLE{CFR99,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
KEY = {j},
MONTH = aug,
NUMBER = {8},
PAGES = {825-837},
TITLE = {Integrating list heuristics in genetic algorithms for multiprocessor scheduling},
VOLUME = {10},
YEAR = {1999}
}
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Scheduling multiprocessor tasks with genetic algorithms.
IEEE Transactions on Parallel and Distributed Systems,
10(8):825-837,
August 1999.
@ARTICLE{CFR99,
AUTHOR = {R. Corr\^ea and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
KEY = {j-journal},
MONTH = aug,
NUMBER = {8},
PAGES = {825-837},
TITLE = {{Scheduling multiprocessor tasks with genetic algorithms}},
VOLUME = {10},
YEAR = {1999},
}
-
M. Diallo,
A. Ferreira,
A. Rau-Chaplin,
and S. Ubéda.
Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers.
Journal of Parallel and Distributed Computing,
56(1):47--70,
January 1999.
@ARTICLE{DFRU99,
author = {M. Diallo and A. Ferreira and A. Rau-Chaplin and S. Ubéda},
title = {Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers},
journal = {Journal of Parallel and Distributed Computing},
volume = {56},
number = {1},
pages = {47--70},
year = {1999},
month = {jan},
}
-
A. Ferreira,
C. Kenyon,
A. Rau-Chaplin,
and S. Ubéda.
d-Dimensional Range Search on Multicomputers.
Algorithmica,
24(3/4):195-208,
1999.
Note: Special Issue on Coarse Grained Parallel Algorithms.
@ARTICLE{FKRU99,
author = {A. Ferreira and C. Kenyon and A. Rau-Chaplin and S. Ubéda},
title = {d-Dimensional Range Search on Multicomputers},
journal = {Algorithmica},
volume = {24},
number = {3/4},
pages = {195-208},
note = {Special Issue on Coarse Grained Parallel Algorithms},
year = {1999},
}
-
A. Ferreira and S. Ubéda.
Computing the medial axis transform in parallel with 8 scan operations.
IEEE Transactions on Pattern Analysis & Machine Intelligence (PAMI),
21(3):277-282,
March 1999.
@ARTICLE{FeUb99,
author = {A. Ferreira and S. Ubéda},
title = {Computing the medial axis transform in parallel with 8 scan operations},
journal = {IEEE Transactions on Pattern Analysis \& Machine Intelligence (PAMI)},
volume = {21},
number = {3},
pages = {277-282},
year = {1999},
month = {mar},
}
-
Hugh Hind,
M. Molloy,
and B. Reed.
Total coloring with $\Delta+{\rm poly}(\log\Delta)$ colors.
SIAM J. Comput.,
28(3):816--821 (electronic),
1999.
@article {MR1643445,
AUTHOR = {Hind, Hugh and Molloy, M. and Reed, B.},
TITLE = {Total coloring with {$\Delta+{\rm poly}(\log\Delta)$} colors},
JOURNAL = {SIAM J. Comput.},
VOLUME = {28},
YEAR = {1999},
NUMBER = {3},
PAGES = {816--821 (electronic)},
}
-
F. Maffray and B. Reed.
A description of claw-free perfect graphs.
J. Combin. Theory Ser. B,
75(1):134--156,
1999.
@article {MR1666954,
AUTHOR = {Maffray, F. and Reed, B.},
TITLE = {A description of claw-free perfect graphs},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {75},
YEAR = {1999},
NUMBER = {1},
PAGES = {134--156},
}
-
N. V. R. Mahadev and B. A. Reed.
A note on vertex orders for stability number.
J. Graph Theory,
30(2):113--120,
1999.
@article {MR1665964,
AUTHOR = {Mahadev, N. V. R. and Reed, B. A.},
TITLE = {A note on vertex orders for stability number},
JOURNAL = {J. Graph Theory},
VOLUME = {30},
YEAR = {1999},
NUMBER = {2},
PAGES = {113--120},
}
-
C. McDiarmid and B. Reed.
Colouring proximity graphs in the plane.
Discrete Math.,
199(1-3):123--137,
1999.
@article {MR1675915,
AUTHOR = {McDiarmid, C. and Reed, B.},
TITLE = {Colouring proximity graphs in the plane},
JOURNAL = {Discrete Math.},
VOLUME = {199},
YEAR = {1999},
NUMBER = {1-3},
PAGES = {123--137},
}
-
M. Molloy and B. Reed.
Critical subgraphs of a random graph.
Electron. J. Combin.,
6:Research Paper 35, 13 pp. (electronic),
1999.
@article {MR1712383,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Critical subgraphs of a random graph},
JOURNAL = {Electron. J. Combin.},
VOLUME = {6},
YEAR = {1999},
PAGES = {Research Paper 35, 13 pp. (electronic)},
}
-
B. Reed.
A strengthening of Brooks' theorem.
J. Combin. Theory Ser. B,
76(2):136--149,
1999.
@article {MR1699199,
AUTHOR = {Reed, B.},
TITLE = {A strengthening of {B}rooks' theorem},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {76},
YEAR = {1999},
NUMBER = {2},
PAGES = {136--149},
}
-
B. Reed.
Edge coloring nearly bipartite graphs.
Oper. Res. Lett.,
24(1-2):11--14,
1999.
@article {MR1684925,
AUTHOR = {Reed, B.},
TITLE = {Edge coloring nearly bipartite graphs},
JOURNAL = {Oper. Res. Lett.},
VOLUME = {24},
YEAR = {1999},
NUMBER = {1-2},
PAGES = {11--14},
}
-
B. Reed.
Mangoes and blueberries.
Combinatorica,
19(2):267--296,
1999.
@article {MR1723044,
AUTHOR = {Reed, B.},
TITLE = {Mangoes and blueberries},
JOURNAL = {Combinatorica},
VOLUME = {19},
YEAR = {1999},
NUMBER = {2},
PAGES = {267--296},
}
-
B. Reed.
The list colouring constants.
J. Graph Theory,
31(2):149--153,
1999.
@article {MR1686286,
AUTHOR = {Reed, B.},
TITLE = {The list colouring constants},
JOURNAL = {J. Graph Theory},
VOLUME = {31},
YEAR = {1999},
NUMBER = {2},
PAGES = {149--153},
}
-
E. Altman,
G. Koole,
and T. Jiménez.
Comparing tandem queueing systems and their fluid limits.
In 37th Annual Allerton Conference on Communication, Control, and Computing,
September 1999.
@INPROCEEDINGS{AKJ99,
author = {E. Altman and G. Koole and T. Jiménez},
title = {Comparing tandem queueing systems and their fluid limits},
booktitle = {37th Annual Allerton Conference on Communication, Control, and Computing},
year = {1999},
month = {September},
}
-
F. Baude,
D. Caromel,
N. Furmento,
and D. Sagnol.
Overlapping Communication with Computation in Distributed Object Systems.
In Peter Sloot,
Marian Bubak,
Alfons Hoekstra,
and Bob Hertzberger, editors,
Proceedings of the 7th International Conference - High Performance Computing Networking'99 (HPCN Europe 1999),
volume 1593 of Lecture Notes in Computer Science,
Amsterdam, The Netherlands,
pages 744-753,
April 1999.
@INPROCEEDINGS{BCFS99,
AUTHOR = {F. Baude and D. Caromel and N. Furmento and D. Sagnol},
ADDRESS = {Amsterdam, The Netherlands},
BOOKTITLE = {Proceedings of the 7th International Conference - High Performance Computing Networking'99 (HPCN Europe 1999)},
EDITOR = {Peter Sloot and Marian Bubak and Alfons Hoekstra and Bob Hertzberger},
MONTH = apr,
PAGES = {744-753},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{Overlapping Communication with Computation in Distributed Object Systems}},
VOLUME = {1593},
YEAR = {1999}
}
-
B. Beauquier and E. Darrot.
Arbitrary size Waksman networks.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 95-100,
May 1999.
@InProceedings{BeDa99,
author = {B. Beauquier and E. Darrot},
title = {Arbitrary size {W}aksman networks},
booktitle = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
pages = {95-100},
address = {Roscoff, France},
year = {1999},
month = {may},
}
-
B. Beauquier,
S. Pérennes,
and D. Tóth.
All-to-All Routing and Coloring in Weighted Trees of Rings.
In Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA),
Saint-Malo, France,
pages 185-190,
June 1999.
ACM Press.
@InProceedings{BPT99,
author = {B. Beauquier and S. P{\'e}rennes and D. T{\'o}th},
title = {All-to-All Routing and Coloring in Weighted Trees of Rings},
booktitle = {Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA)},
publisher = {ACM Press},
address = {Saint-Malo, France},
year = {1999},
pages = {185-190},
month = {jun},
}
-
P. Bergé,
A. Ferreira,
J. Galtier,
and J.-N. Petit.
A load study for intersatellite links in satellite constellations.
In ECSC 5 - Fifth European Conference on Satellite Communications,
Toulouse, France,CDRom,
November 1999.
@InProceedings{BFGP99,
author = {P. Berg\'e and A. Ferreira and J. Galtier and J.-N. Petit},
title = {A load study for intersatellite links in satellite constellations},
booktitle = {ECSC 5 - Fifth European Conference on Satellite Communications},
address = {Toulouse, France,CDRom},
year = {1999},
month = {November},
}
-
J.-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Virtual path layouts with low congestion or low diameter in ATM networks.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 77-82,
May 1999.
@conference{BMPP99,
author = {J.-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes},
title = {Virtual path layouts with low congestion or low diameter in ATM networks},
booktitle = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
address = {Roscoff, France},
pages = {77-82},
year = {1999},
month = {May},
}
-
R. Corrêa and A. Ferreira.
A polynomial-time branching procedure for the multiprocessor scheduling problem.
In Proceedings of Europar'99,
volume 1685 of Lecture Notes in Computer Science,
Toulouse (F),
pages 272-279,
August 1999.
Springer Verlag.
@INPROCEEDINGS{CoFe99,
author = {R. Corrêa and A. Ferreira},
title = {A polynomial-time branching procedure for the multiprocessor scheduling problem},
booktitle = {Proceedings of Europar'99},
publisher = {Springer Verlag},
address = {Toulouse (F)},
PAGES = {272-279},
VOLUME = {1685},
series = {Lecture Notes in Computer Science},
year = {1999},
month = {aug},
}
-
D. Coudert,
A. Ferreira,
and X. Muñoz.
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks.
In J. Rolim et al., editor,
Proceedings of the Workshop on Optics and Computer Science 1999,
volume 1586 of Lecture Notes in Computer Science,
pages 897-910,
April 1999.
Springer Verlag.
[PDF
] [POSTSCRIPT
]
| Abstract: |
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those results together. In this paper, we propose a step in this direction, by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnection System (OTIS) architecture. These topologies include the family of Partitioned Optical Passive Star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and de Bruijn digraphs. |
@INPROCEEDINGS{CFM99,
author = {D. Coudert and A. Ferreira and X. Muñoz},
title = {{OTIS-Based Multi-Hop Multi-OPS Lightwave Networks}},
booktitle = {Proceedings of the Workshop on Optics and Computer Science 1999},
year = {1999},
editor = {J. Rolim et al.},
volume = {1586},
series = {Lecture Notes in Computer Science},
pages = {897-910},
month = {April},
publisher = {Springer Verlag},
abstract = {Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those results together. In this paper, we propose a step in this direction, by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnection System (OTIS) architecture. These topologies include the family of Partitioned Optical Passive Star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and de Bruijn digraphs.},
journal = {IEEE International Parallel Processing Symposium -- IPPS'99},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.ps.gz}
}
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture.
In Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel,
Roscoff, France,
pages 101-106,
5-7 Mai 1999.
[PDF
] [POSTSCRIPT
]
@INPROCEEDINGS{CFP99,
author = {D. Coudert and A. Ferreira and S. Perennes},
title = {{Theoretical Aspects of the Optical Transpose Interconnecting System Architecture}},
booktitle = {{Premi\`ere Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel}},
year = {1999},
pages = {101-106},
address = {Roscoff, France},
month = {5-7 Mai},
pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.ps.gz}
}
-
A. Ferreira,
J. Galtier,
J.-N. Petit,
and H. Rivano.
Algorithmes de reroutage dans une constellation de satellites.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 107-112,
May 1999.
[WWW
] [PDF
] [POSTSCRIPT
]
@INPROCEEDINGS{FGPR99,
author = {A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano},
title = {Algorithmes de reroutage dans une constellation de satellites},
booktitle = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
year = {1999},
pages = {107-112},
address = {Roscoff, France},
month = {May},
pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.pdf},
postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.ps.gz},
url = {http://ares.insa-lyon.fr/tarot/jsp/site/Portal.jsp?page_id=7}
}
-
A. Ferreira and N. Schabanel.
A randomized BSP/CGM algorithm for the maximal independent set problem.
In Proceedings of ISPAN'99,
Fremantle, Australia,
pages 284-289,
June 1999.
IEEE.
@INPROCEEDINGS{FeSc99,
author = {A. Ferreira and N. Schabanel},
title = {A randomized {BSP/CGM} algorithm for the maximal independent set problem},
booktitle = {Proceedings of ISPAN'99},
address = {Fremantle, Australia},
pages = {284-289},
year = {1999},
month = {jun},
publisher = {IEEE},
}
-
J. Galtier.
Geographical reservation for guaranteed handover and routing in low earth orbit constellations.
In Geraldo Robson Mateus, editor,
I Workshop de Comunicacao Sem Fio,
Belo Horizonte, Minas Gerais, Brazil,
pages 77-86,
July 1999.
@InProceedings{Gal99,
author = {J. Galtier},
title = {Geographical reservation for guaranteed handover and routing in low earth orbit constellations},
booktitle = {I Workshop de Comunicacao Sem Fio},
editor = {Geraldo Robson Mateus},
address = {Belo Horizonte, Minas Gerais, Brazil},
pages = {77-86},
year = {1999},
month = {July},
}
-
J. Galtier and S. Pérennes.
Parallel flips on planar triangulations.
In 15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins,
pages 80-86,
1999.
@conference{GaPe99b,
author = {J. Galtier and S. P\'erennes},
title = {Parallel flips on planar triangulations},
booktitle = {15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins},
pages = {80-86},
year = {1999},
}
-
T. Jiménez,
N. Furmento,
P. Mussi,
and G. Siegel.
A Traffic Simulator for Advanced Transport Telematics (ATT) Strategies.
In AFRICON'99,
volume 1,
Cape Town, South Africa,
pages 33--36,
September 1999.
@INPROCEEDINGS{JFMS99c,
author = {T. Jim\'enez and N. Furmento and P. Mussi and G. Siegel},
title = {A Traffic Simulator for Advanced Transport Telematics (ATT) Strategies},
booktitle = {AFRICON'99},
address = {Cape Town, South Africa},
year = {1999},
month = {September},
pages={33--36},
volume={1},
}
-
T. Jiménez,
N. Furmento,
P. Mussi,
and G. Siegel.
Un framework à objets pour la simulation de trafic routier.
In Georges Habchi et Alain Haurat, editor,
Modélisation et Simulation des Flux Physiques et Informationnels (MOSIM),
Annecy, France,
pages 257--262,
Octobre 1999.
SCS International.
@INPROCEEDINGS{JFMS99,
author = {T. Jiménez and N. Furmento and P. Mussi and G. Siegel},
title = {Un framework \`a objets pour la simulation de trafic routier},
booktitle = {Mod\'elisation et Simulation des Flux Physiques et Informationnels (MOSIM)},
year = {1999},
address = {Annecy, France},
month = {Octobre},
PAGES = "257--262",
EDITOR="Georges Habchi et Alain Haurat",
PUBLISHER=" SCS International",
}
-
F. Lang,
P. Lescanne,
and L. Liquori.
A Framework for Defining Object-Calculi (extended abstract).
In FM, World Congress on Formal Methods in the Development of Computing Systems,
volume 1709 of Lecture Notes in Computer Science,
pages 963--982,
1999.
Springer Verlag.
[POSTSCRIPT
]
@InProceedings{LLL99,
author = {Lang, F. and Lescanne, P. and Liquori, L.},
title = {{A Framework for Defining Object-Calculi (extended abstract)}},
booktitle = {FM, World Congress on Formal Methods in the Development of Computing Systems},
year = {1999},
volume = 1709,
pages = {963--982},
series = lncs,
publisher = {Springer Verlag},
POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fm-99.ps.gz}
}
-
M. Molloy and B. Reed.
Further algorithmic aspects of the local lemma.
In STOC '98 (Dallas, TX),
New York,
pages 524--529,
1999.
ACM.
@inproceedings{MR1715600,
AUTHOR = {Molloy, M. and Reed, B.},
TITLE = {Further algorithmic aspects of the local lemma},
BOOKTITLE = {STOC '98 (Dallas, TX)},
PAGES = {524--529},
PUBLISHER = {ACM},
ADDRESS = {New York},
YEAR = {1999},
}
-
L. Perkovic and B. Reed.
An improved algorithm for finding tree decompositions of small width.
In Graph-theoretic concepts in computer science (Ascona, 1999),
volume 1665 of Lecture Notes in Comput. Sci.,
Berlin,
pages 148--154,
1999.
Springer.
@inproceedings{MR1852482,
AUTHOR = {Perkovi{\'c}, L. and Reed, B.},
TITLE = {An improved algorithm for finding tree decompositions of small width},
BOOKTITLE = {Graph-theoretic concepts in computer science (Ascona, 1999)},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1665},
PAGES = {148--154},
PUBLISHER = {Springer},
ADDRESS = {Berlin},
YEAR = {1999},
}
-
B. Reed.
Introducing directed tree width.
In 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999),
volume 3 of Electron. Notes Discrete Math.,
Amsterdam,
pages 8 pp. (electronic),
1999.
Elsevier.
@inproceedings{MR1966425,
AUTHOR = {Reed, B.},
TITLE = {Introducing directed tree width},
BOOKTITLE = {6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999)},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {3},
PAGES = {8 pp. (electronic)},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {1999},
}
-
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.
@TechReport{BeDa99b,
Author = {Beauquier, B. and Darrot, E.},
Title = {On arbitrary size {W}aksman networks and their vulnerability},
Type = {Rapport de recherche},
Number = {3788 --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = oct,
Year = {1999},
}
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Digraph Isomorphisms and Free Space Optical Networks.
Technical report,
INRIA Research Report 3817,
1999.
[POSTSCRIPT
]
@TECHREPORT{CFP99b,
author = {D. Coudert and A. Ferreira and S. Perennes},
title = {{Digraph Isomorphisms and Free Space Optical Networks}},
institution = {INRIA Research Report 3817},
year = {1999},
optnote = {http://www.inria.fr/rapports/sophia/RR-3817.html},
postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/RR-3817.ps.gz}
}
-
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.
@techreport{Dal99b,
AUTHOR = {O. Dalle},
TITLE = {Etat de l'art sur les couches {MAC}},
TYPE = {Contribution du {C.N.E.S.} au rapport d'avancement de la Convention 2 du projet {R.N.R.T.} <>},
YEAR = {1999},
MONTH = {Juin}
}
-
E. Darrot.
Convention A11518 INRIA--Alcatel Space Industries.
Rapport de contrat ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
@TechReport{Dar99,
Author = {Darrot, E.},
Title = {Convention {A11518} {INRIA}--{A}lcatel {S}pace {I}ndustries},
Type = {Rapport de contrat},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999}
}
-
E. Darrot.
Evitement des boucles dans les anneaux de redondance.
Rapport de recherche ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
@TechReport{Dar99b,
Author = {Darrot, E.},
Title = {Evitement des boucles dans les anneaux de redondance},
Type = {Rapport de recherche},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999}
}
-
E. Darrot.
Réseaux réarrangeables à commutateurs à lamelles.
Rapport de recherche ???? --- Thème 1,
INRIA Sophia Antipolis,
France,
November 1999.
@TechReport{Dar99a,
Author = {Darrot, E.},
Title = {R\'eseaux r\'earrangeables \`a commutateurs \`a lamelles},
Type = {Rapport de recherche},
Number = {???? --- Th\`eme~1},
Institution = {INRIA Sophia Antipolis},
Address = {France},
Month = nov,
Year = {1999}
}
-
M. Flammini and S. Pérennes.
Lower Bounds on systolic gossip..
Technical report 3612,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
@Techreport{FlPe99,
author = {M. Flammini and S. P\'erennes},
title = {{Lower Bounds on systolic gossip.}},
institution = {INRIA},
number = {3612},
note = {soumis à Journal on Information theory},
year = {1999},
}
-
M. Flammini and S. Pérennes.
Tight Upper bound for broadcasting and gossiping.
Technical report,
INRIA,
1999.
Note: Soumis à Journal on Information theory.
@Techreport{FlPe99b,
author = {M. Flammini and S. P\'erennes},
title = {Tight Upper bound for broadcasting and gossiping},
institution = {INRIA},
note = {soumis à Journal on Information theory},
year = {1999},
}
-
F. Fraigniaud,
A. Pelc,
and S. Pérennes.
Fast tree naming.
Technical report 3609,
INRIA,
1999.
@Techreport{FrPe99,
author = {F. Fraigniaud and A. Pelc and S. P\'erennes},
title = {Fast tree naming},
institution = {INRIA},
number = {3609},
year = {1999},
}
-
J. Galtier.
Using Parallel Computing to Reduce CPU Power.
Research Report 3621,
INRIA,
February 1999.
[WWW
] [PDF
]
@TechReport{Gal99b,
author = {J. Galtier},
title = {Using Parallel Computing to Reduce CPU Power},
institution = {INRIA},
year = {1999},
OPTkey = {},
type = {Research Report},
number = {3621},
OPTaddress = {},
month = {February},
OPTannote = {},
url = {http://hal.inria.fr/inria-00073056/fr/},
pdf ={http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/07/30/56/PDF/RR-3621.pdf&docid=73056},
}
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Optimal broadcasting in unknown networks.
Technical report 3609,
INRIA,
1999.
@Techreport{GPPV99,
author = {L. Gargano and A. Pelc and S. P\'erennes and U. Vaccaro},
title = {{Optimal broadcasting in unknown networks}},
institution = {INRIA},
number = {3609},
year = {1999},
}