BACK TO COATI PUBLICATION INDEX
Publications of year 2000
-
A. Ferreira and G. Kindervater, editors.
Parallel Computing -- Special Issue on High Performance Computing in Operations Research,
volume 26.
Elsevier Science B. V.,
2000.
[bibtex-entry]
-
B. Beauquier.
Communications dans les réseaux optiques par multiplexage en longueur d'onde.
PhD thesis,
université de Nice-Sophia Antipolis -- STIC,
janvier 2000.
[POSTSCRIPT
] [bibtex-entry]
-
T. Jiménez.
Simulation de trafic routier: Étude des méthodologies de modélisation et parallélisation et mise en oe uvre.
PhD thesis,
université de Nice-Sophia Antipolis,
September 2000.
[bibtex-entry]
-
N. Marlin.
Communications Structurées dans les Réseaux.
PhD thesis,
université de Nice-Sophia Antipolis,
juin 2000.
[bibtex-entry]
-
E. Altman,
E. Baçsar,
T. Jiménez,
and N. Shimkin.
Routing into Two Parallel Links:Game-Theoretic Distributed Algorithms.
Journal of Parallel and Distributed Computing,
(Special Issue on Routing in Computer and Communication Networks),
2000.
[bibtex-entry]
-
E. Altman,
T. Jiménez,
and G. Koole.
On optimal call admission control.
IEEE Trans. on Communications,
2000.
[bibtex-entry]
-
M. Becker,
A.-L. Beylot,
O. Dalle,
R. Dhaou,
M. Marot,
P. Mussi,
C. Rigal,
and V. Sutter.
The ASIMUT Simulation Workshop.
Networking and Information Systems Journal,
3(2):335--348,
2000.
[bibtex-entry]
-
C. Berge and B. Reed.
Optimal packings of edge-disjoint odd cycles.
Discrete Math.,
211(1-3):197--202,
2000.
[bibtex-entry]
-
J-C. Bermond,
J. Bond,
C. Martin,
A. Pekec,
and F. S. Roberts.
Optimal orientation of annular networks.
JOIN,
1(1):21-46,
2000.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Efficient Collective Communications in Optical Networks.
Theoretical Computer Science,
233(1-2):165--189,
2000.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
S. Marshall,
and M-L. Yu.
Improved bounds for gossiping in mesh-bus networks.
JOIN,
1(1):1-19,
2000.
[PDF
] [bibtex-entry]
-
P. Berthomé,
A. Ferreira,
S. Pérennes,
G. Plaxton,
and B. Maggs.
Sorting-based selection algorithms on hypercubic networks.
Algorithmica,
26(2):237--254,
2000.
[bibtex-entry]
-
M. Bugliesi,
G. Delzanno,
L. Liquori,
and M. Martelli.
Object Calculi in Linear Logic.
Journal of Logic and Computation,
10(1):75--104,
2000.
[POSTSCRIPT
] [bibtex-entry]
-
D. Coudert,
A. Ferreira,
and X. Muñoz.
Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System.
OSA Applied Optics -- Information Processing,
39(17):2965-2974,
June 2000.
[POSTSCRIPT
] [Abstract] [bibtex-entry]
-
D. Coudert,
A. Ferreira,
and X. Muñoz.
A Multihop-Multi-OPS Optical Interconnection Network.
IEEE/OSA Journal of Lightwave Technology,
18(12):2076-2085,
2000.
[POSTSCRIPT
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and S. W. Song.
Broadcasting in bus interconnection networks.
Journal of Interconnection Networks - JOIN,
1(2):73--94,
2000.
[bibtex-entry]
-
A. Ferreira and Nicolas Schabanel.
A randomized BSP/CGM algorithm for the maximal independent set.
Parallel Processing Letters,
9(3):411--422,
2000.
[bibtex-entry]
-
J. Galtier.
Load Balancing Issues in the Prepartitioning Method.
Computers and Artificial Intelligence,
19(4),
2000.
[PDF
] [bibtex-entry]
-
C. McDiarmid and B. Reed.
Channel assignment and weighted coloring.
Networks,
36(2):114--117,
2000.
[bibtex-entry]
-
L. Perkovic and B. Reed.
An improved algorithm for finding tree decompositions of small width.
Internat. J. Found. Comput. Sci.,
11(3):365--371,
2000.
Note: Selected papers from the Workshop on Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona).
[bibtex-entry]
-
B. Reed and R. Thomas.
Clique minors in graphs and their complements.
J. Combin. Theory Ser. B,
78(1):81--85,
2000.
[bibtex-entry]
-
E. Altman,
E. Baçsar,
T. Jiménez,
and N. Shimkin.
Competitive Routing in Networks with Polynomial Cost.
In IEEE Infocom 2000,
pages 1586--1593,
mars 2000.
[bibtex-entry]
-
A. Andreev,
A. Clementi,
P. Penna,
and J. Rolim.
Parallel Read Operations Without Memory Contention.
In Electronic Colloquium on Computational Complexity,
volume TR00-53,
2000.
[bibtex-entry]
-
B. Beauquier,
K.S. Candan,
A. Ferreira,
S. Pérennes,
and A. Sen.
On shortest path problems with ``non-Markovian'' link contribution to path lengths.
In Proc. of IFIP/TC6 Networking 2000 Conference,
Paris, France,
mai 2000.
[bibtex-entry]
-
B. Beauquier and E. Darrot.
Arbitrary size Waksman networks and their vulnerability.
In Actes des $1^{res}$ Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
2000.
World Scientific.
[bibtex-entry]
-
P. Bergé,
A. Ferreira,
J. Galtier,
and S. Petit.
A probabilistic study of inter-satellite links load in polar orbit satellite constellations.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 137--142,
Mai 2000.
[bibtex-entry]
-
J-C. Bermond,
A. Bonnecaze,
T. Kodate,
S. Perennes,
and P. Sole.
Broadcasting in hypercubes in the circuit switched model.
In Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000,
pages 21-26,
2000.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Chacon,
D. Coudert,
and F. Tillerot.
Conception d'un réseau WDM protégé par sous-réseaux.
In 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00),
La Rochelle, France,
pages 83-88,
May 2000.
INRIA.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Bongiovanni,
A. Clementi,
and P. Penna.
A Note on Parallel Read Operations on Large Public Databases.
In Proc. of ARACNE-00, International Workshop on Approximation and Randomized Algorithms in Communication Networks,
volume Carleton Scientific Press,
pages 123--133,
2000.
[bibtex-entry]
-
A. Clementi,
A. Ferreira,
P. Penna,
S. Pérennes,
and R. Silvestri.
The Minimum Range Assignment Problem on Linear Radio Networks.
In Proc. of ESA-00, 8th Annual European Symposium on Algorithms,
volume LNCS,
pages 143--154,
2000.
[bibtex-entry]
-
A. Clementi,
P. Penna,
and R. Silvestri.
The Power Range Assignment Problem in Radio Networks on the Plane.
In Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science,
volume LNCS,
pages 651--660,
2000.
[bibtex-entry]
-
A. Clementi,
P. Penna,
and R. Silvestri.
On The Power Assignment Problem in Radio Networks.
In Electronic Colloquium on Computational Complexity,
volume TR00-54,
2000.
[bibtex-entry]
-
D. Colnet and L. Liquori.
Match-O, a Statically Safe (?) Dialect of Eiffel.
In TOOLS, International Conference on Technology of Object-Oriented Languages and Systems,
pages 190--201,
2000.
IEEE Computer Society.
[POSTSCRIPT
] [bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
De Bruijn Isomorphisms and Free Space Optical Networks.
In IEEE International Parallel and Distributed Processing Symposium,
pages 769-774,
2000.
IEEE Press.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
P. Crescenzi,
G. Gambosi,
and P. Penna.
On-Line Algorithms for the Channel Assignment Problem in Cellular Networks.
In Proc. of ACM DIALM-2000, 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications,
pages 1--7,
2000.
[bibtex-entry]
-
O. Dalle,
P. Mussi,
and C. Rigal,
and V. Sutter.
ASIMUT: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks.
In Proc. 6th ESA Workshop on Simulation in European Space Pragrams,
ESTEC, Noordwijk, The Netherlands,
pages 285--288,
October 2000.
European Space Agency.
[WWW
] [bibtex-entry]
-
A. Ferreira,
J. Galtier,
P. Mahey,
G. Mateus,
and A. Oliveira.
An Optimization Model for Routing in Low Earth Orbit Satellite Constellations.
In Proceedings of ISPAN,
Dallas, USA,
December 2000.
[bibtex-entry]
-
A. Ferreira,
J. Galtier,
and S. Pérennes.
Approximation of a straight line in a bounded lattice.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 53--58,
Mai 2000.
[bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown anonymous networks.
In Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING),
pages 101--112,
2000.
[bibtex-entry]
-
J. Galtier and S. Lanteri.
On overlapping partitions.
In David J. Lilja, editor,
Proceedings of the 2000 International Conference on Parallel Processing,
Toronto, Canada,
pages 461--468,
août 2000.
[bibtex-entry]
-
J. Galtier.
Routing issues for LEO satellite constellations.
In International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet (SSGRR 2000),
L'Aquila, Italie,
juillet 2000.
[bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Efficient communication in unknown networks.
In Proc. of WG'2000 - 26th International Workshop on Graph-Theoretic Concepts in Computer Science,
2000.
Note: A paraître.
[bibtex-entry]
-
S. Haddad,
A. Laugier,
and Jean-Francois Maurras.
Global designing of telecommunication networks.
In CO 2000,
2000.
[bibtex-entry]
-
S. Haddad,
A. Laugier,
and Jean-Francois Maurras.
Designing telecommunication networks with global capacities under survivability constraints.
In ECCO XIII,
2000.
[bibtex-entry]
-
M.-C. Heydemann,
N. Marlin,
and S. Pérennes.
Rotational Cayley Graphs on Transposition Generated Groups (Extended Abstract).
In 6ème Colloque International de Théorie des Graphes,
Electronical Notes in Discrete Mathematics,
pages 187--190,
2000.
Elsevier Science.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
A road traffic simulator : car-following and lane-changing.
In European Simulation Multiconference 2000,
Gent, Belgium,
pages 241--245,
Mai 2000.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
The distribution and partitioning scheme of the HIPERTRANS traffic simulator.
In European Simulation Symposium 2000,
Hamburg, Allemagne,
pages 462--466,
September 2000.
[bibtex-entry]
-
T. Jiménez.
Optimal Admission Control for High Speed Networks: A Dynamic Programming Approach.
In IEEE Conference on Decision and Control,
decembre 2000.
[bibtex-entry]
-
A. Laugier and P. Mahey.
Design of multi-level-protocol data networks.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 107--111,
Mai 2000.
[bibtex-entry]
-
M. Molloy and B. Reed.
Near-optimal list colorings.
In Proceedings of the Ninth International Conference ``Random Structures and Algorithms'' (Poznan, 1999),
volume 17,
pages 376--402,
2000.
[bibtex-entry]
-
M. Molloy and B. Reed.
$k$-colouring when $k$ is close to $\Delta$.
In 6th International Conference on Graph Theory (Marseille, 2000),
volume 5 of Electron. Notes Discrete Math.,
Amsterdam,
pages 4 pp. (electronic),
2000.
Elsevier.
[bibtex-entry]
-
P. Penna.
Succinct Representations of Model Based Belief Revision.
In Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science,
volume LNCS,
pages 205--216,
2000.
[bibtex-entry]
-
B. Reed.
How tall is a tree?.
In Proceedings of the Thiry-Second Annual ACM Symposium on Theory of Computing,
New York,
pages 479--483 (electronic),
2000.
ACM.
[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]
-
F. Blanc.
Problèmes de flips 3D.
Rapport de stage,
ESSI,
2000.
[bibtex-entry]
-
P. Boffa.
L'internet dynamique.
Rapport de stage de deuxième année,
DUT Infocom IUT de Nice côte d'azur, Université de Nice Sophia-Antipolis,
2000.
[bibtex-entry]
-
B. Bongiovanni.
IGP Interface Graphique pour PORTO.
Rapport de DESS Telecoms,
Université de Nice Sophia-Antipolis,
2000.
[bibtex-entry]
-
G. Conjat.
Data Mining sur le Web avec applications à l'Analyse Technique des Marchés financiers.
Rapport de stage,
ESSI,
2000.
[bibtex-entry]
-
G.Huiban.
Les problèmes de groupage dans les réseaux de télécommunication.
Rapport de stage de deuxième année,
ISIMA, Clermont-Ferrand,
2000.
[bibtex-entry]
-
J. Gavet.
Hipertrans: validation et modification des algorithmes.
Rapport de stage de deuxième année,
ISIMA, Clermont-ferrand,
2000.
[bibtex-entry]
-
N. Lichiardopol.
Points fixes des rotations complètes dans un graphe de cayley orienté.
Rapport de DEA MDFI,
Université de Luminy, Marseille,
2000.
[bibtex-entry]
-
F. Maginot.
Réseaux tolérants aux pannes.
Rapport de DEA MDFI,
Université de Luminy, Marseille,
2000.
[bibtex-entry]
-
G. Masson.
IGP Interface Graphique pour PORTO.
Rapport de DESS Telecoms,
Université de Nice Sophia-Antipolis,
2000.
[bibtex-entry]
-
J. Plouchart.
Propositions méthodologiques pour la simulation multi-niveaux.
Rapport de DEA RSD,
Université de Nice Sophia-Antipolis,
2000.
[bibtex-entry]
-
H. Rivano.
La coloration fractionnaire appliquée à la résolution de problèmes de planification de réseaux optiques WDM.
Rapport de DEA RSD,
Université de Nice Sophia-Antipolis et ENS Lyon,
2000.
[WWW
] [bibtex-entry]
-
B. Wack.
Réseaux optiques à multiplexage en longueur d'onde.
Rapport de stage de magistère d'informatique,
ENS Lyon,
2000.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022