Publications of year 1999

1. E. Altman, A. Ferreira, and J. Galtier. Les réseaux satellitaires de télécommunications. Interéditions, 1999. [bibtex-entry]

1. O. Dalle. Techniques et outils pour les communications et la répartition dynamique de charge dans les réseaux de stations de travail. Thèse de Doctorat, Université de Nice - Sophia Antipolis, École doctorale Sciences Pour l'Ingénieur, Janvier 1999. [bibtex-entry]


2. N. Furmento. Schooner : Une Encapsulation Orintée Objet de Supports d'Exécution pour Applications Réparties. PhD thesis, Université de Nice-Sophia Antipolis, France, May 1999. [bibtex-entry]

1. 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. [bibtex-entry]


2. 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. [bibtex-entry]


3. 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. [bibtex-entry]


4. 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. [bibtex-entry]


5. 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. [bibtex-entry]


6. B. Beauquier. All-To-All Communication in some Wavelength-Routed All-Optical Networks. Networks, 33(3):179--187, May 1999. [bibtex-entry]


7. 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). [bibtex-entry]


8. 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 ] [bibtex-entry]


9. V. Bono, M. Bugliesi, M. Dezani-Ciancaglini, and L. Liquori. Subtyping for Extensible, Incomplete Objects. Fundamenta Informaticae, 38(4):325--364, 1999. [POSTSCRIPT ] [bibtex-entry]


10. 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. [bibtex-entry]


11. 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. [bibtex-entry]


12. 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. [bibtex-entry]


13. 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. [bibtex-entry]


14. 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. [bibtex-entry]


15. 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. [bibtex-entry]


16. F. Maffray and B. Reed. A description of claw-free perfect graphs. J. Combin. Theory Ser. B, 75(1):134--156, 1999. [bibtex-entry]


17. N. V. R. Mahadev and B. A. Reed. A note on vertex orders for stability number. J. Graph Theory, 30(2):113--120, 1999. [bibtex-entry]


18. C. McDiarmid and B. Reed. Colouring proximity graphs in the plane. Discrete Math., 199(1-3):123--137, 1999. [bibtex-entry]


19. M. Molloy and B. Reed. Critical subgraphs of a random graph. Electron. J. Combin., 6:Research Paper 35, 13 pp. (electronic), 1999. [bibtex-entry]


20. B. Reed. A strengthening of Brooks' theorem. J. Combin. Theory Ser. B, 76(2):136--149, 1999. [bibtex-entry]


21. B. Reed. Edge coloring nearly bipartite graphs. Oper. Res. Lett., 24(1-2):11--14, 1999. [bibtex-entry]


22. B. Reed. Mangoes and blueberries. Combinatorica, 19(2):267--296, 1999. [bibtex-entry]


23. B. Reed. The list colouring constants. J. Graph Theory, 31(2):149--153, 1999. [bibtex-entry]

1. 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. [bibtex-entry]


2. 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. [bibtex-entry]


3. 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. [bibtex-entry]


4. 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. [bibtex-entry]


5. 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. [bibtex-entry]


6. 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. [bibtex-entry]


7. 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. [bibtex-entry]


8. 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] [bibtex-entry]


9. 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 ] [bibtex-entry]


10. 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 ] [bibtex-entry]


11. 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. [bibtex-entry]


12. 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. [bibtex-entry]


13. 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. [bibtex-entry]


14. 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. [bibtex-entry]


15. 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. [bibtex-entry]


16. 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 ] [bibtex-entry]


17. M. Molloy and B. Reed. Further algorithmic aspects of the local lemma. In STOC '98 (Dallas, TX), New York, pages 524--529, 1999. ACM. [bibtex-entry]


18. 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. [bibtex-entry]


19. 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. [bibtex-entry]

1. 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]


2. D. Coudert, A. Ferreira, and S. Perennes. Digraph Isomorphisms and Free Space Optical Networks. Technical report, INRIA Research Report 3817, 1999. [POSTSCRIPT ] [bibtex-entry]


3. 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]


4. E. Darrot. Convention A11518 INRIA--Alcatel Space Industries. Rapport de contrat ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]


5. E. Darrot. Evitement des boucles dans les anneaux de redondance. Rapport de recherche ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]


6. E. Darrot. Réseaux réarrangeables à commutateurs à lamelles. Rapport de recherche ???? --- Thème 1, INRIA Sophia Antipolis, France, November 1999. [bibtex-entry]


7. M. Flammini and S. Pérennes. Lower Bounds on systolic gossip.. Technical report 3612, INRIA, 1999.
   Note: Soumis à Journal on Information theory. [bibtex-entry]


8. 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]


9. F. Fraigniaud, A. Pelc, and S. Pérennes. Fast tree naming. Technical report 3609, INRIA, 1999. [bibtex-entry]


10. J. Galtier. Using Parallel Computing to Reduce CPU Power. Research Report 3621, INRIA, February 1999. [WWW ] [PDF ] [bibtex-entry]


11. L. Gargano, A. Pelc, S. Pérennes, and U. Vaccaro. Optimal broadcasting in unknown networks. Technical report 3609, INRIA, 1999. [bibtex-entry]

1. L. Liquori. A Brief Introduction to Corba. École des Mines de Nancy, 1999-2000.
   Note: Cours SI 131 : Conception d'architectures logicielles. [bibtex-entry]


2. L. Liquori. Le Bug de Java. École des Mines de Nancy, 1999-2000.
   Note: Cours SI 153 : Sûreté des systèmes informatiques. [bibtex-entry]


3. L. Liquori. On Object Calculi. École des Mines de Nancy, 1999-2000.
   Note: Cours SI 142 : Fondements de l'algorithmique et de la programmation. [bibtex-entry]


4. L. Liquori. The Languages ASN.1 and GDMO. École des Mines de Nancy, 1999-2000.
   Note: Cours SI 151 : Réseaux et télécommunications. [bibtex-entry]


5. L. Liquori and K. Tombre. On C++ Compilers. École des Mines de Nancy, 1999-2000.
   Note: Cours SI 131 : Conception d'architectures logicielles. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html