BACK TO COATI PUBLICATION INDEX

Publications of year 1998

Books and proceedings
  1. P. Berthomé and A. Ferreira, editors. Optical Interconnects and Parallel Processing: Trends at the Interface. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]
     
  2. A. Ferreira and J. Rolim, editors. Journal of Parallel and Distributed Computing -- Special Issue on Irregular Problems, volume 50. Academic Press, April 1998. [bibtex-entry]
     
  3. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors. Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1998. [bibtex-entry]
     
  4. A. Ferreira, J. Rolim, H. Simon, and S. Teng, editors. Solving Irregularly Structured Problems in Parallel -- Irregular'98, volume 1457 of Lecture Notes in Computer Science. Springer-Verlag, 1998. [bibtex-entry]
     
Articles in journal or book's chapters
  1. R. Corrêa, A. Ferreira, and S. Porto. Selected Algorithmic Techniques for Parallel Optimization. In D. Du and P. Pardalos, editors,Handbook of Combinatorial Optimization, volume 3, pages 407-456. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]
     
  2. A. Ferreira. Towards effective models for OPS--based lightwave networks. In P. Berthomé and A. Ferreira, editors,Optical Interconnects and Parallel Processing: Trends at the Interface, pages 209-233. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]
     
  3. A. Ferreira and I. Guérin-Lassous. Algorithmique discrète parallèle : le chaînon manquant. In J.-F. Myoupo, editor,Parallélisme et Répartitions, chapter II, pages 23-47. Hermes, Paris (F), 1998. [bibtex-entry]
     
  4. A. M. Frieze and B. Reed. Probabilistic analysis of algorithms. In Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms Combin., pages 36--92. Springer, Berlin, 1998. [bibtex-entry]
     
  5. B. Beauquier, P. Hell, and S. Pérennes. Optimal Wavelength-routed Multicasting. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 84(1-3), May 1998. [WWW ] [bibtex-entry]
     
  6. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics, 84(1-3):21-42, 1998. [PDF ] [bibtex-entry]
     
  7. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton cycle decomposition of the butterfly networks. Parallel Processing Letters, 8(3):371-385, 1998. [PDF ] [bibtex-entry]
     
  8. J-C. Bermond, L. Gargano, and S. Pérennes. Optimal sequential gossiping by short messages. Discrete Applied Mathematics, 86(2-3):145-155, 1998. [PDF ] [bibtex-entry]
     
  9. J-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917-941, 1998. [PDF ] [bibtex-entry]
     
  10. H. Bourdin, A. Ferreira, and K. Marcus. A performance comparison between graph and hypergraph topologies for passive star WDM lightwave networks. Computer Networks and ISDN Systems, 8(30):805-819, May 1998. [bibtex-entry]
     
  11. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., 7(3):295--305, 1998. [bibtex-entry]
     
  12. M. Molloy and B. Reed. A bound on the total chromatic number. Combinatorica, 18(2):241--280, 1998. [bibtex-entry]
     
  13. S. Perennes. Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks.. Discrete Applied Mathematics, 83:247-262, 1998. [bibtex-entry]
     
  14. B. Reed. $\omega,\ \Delta$, and $\chi$. J. Graph Theory, 27(4):177--212, 1998. [bibtex-entry]
     
  15. B. Reed and P. Seymour. Fractional colouring and Hadwiger's conjecture. J. Combin. Theory Ser. B, 74(2):147--152, 1998. [bibtex-entry]
     
Conference's articles
  1. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts in simple ATM networks. In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998, 1998. [bibtex-entry]
     
  2. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed virtual path layouts in ATM networks. In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499, pages 75-i88. (Full version appeared in TCS), 1998. Springer Verlag. [bibtex-entry]
     
  3. Gruia Calinescu, Cristina G. Fernandes, and B. Reed. Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Integer programming and combinatorial optimization (Houston, TX, 1998), volume 1412 of Lecture Notes in Comput. Sci., Berlin, pages 137--152, 1998. Springer. [bibtex-entry]
     
  4. D. Coudert, A. Ferreira, and X. Muñoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. In IEEE International Parallel Processing Symposium, pages 151-155, 1998. IEEE Press. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  5. O. Dalle. MPCFS : un exemple d'intégration transparente de mécanismes de communication multipoints dans les systèmes UNIX. In Dominique Méry and Guy-René Perrin, editors, 10$^e$ Rencontres Francophones du Parallélisme (RENPAR'10), Strasbourg, Juin 1998. [bibtex-entry]
     
  6. O. Dalle. MPCFS : un système de fichiers virtuel pour communications multipoints fiables entre systèmes UNIX. In Deuxièmes Journées Doctorales Informatique et Réseaux (JDIR'98), Paris, Avril 1998. [bibtex-entry]
     
  7. P. Di Gianantonio, F. Honsell, and L. Liquori. A Lambda Calculus of Objects with Self-inflicted Extension. In Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications, pages 166--178, 1998. The ACM Press. [POSTSCRIPT ] [bibtex-entry]
     
  8. M. Diallo, A. Ferreira, and A. Rau-Chaplin. Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science -- STACS'98, volume 1373 of Lecture Notes in Computer Science, Paris, France, pages 399--409, February 1998. Springer Verlag. [bibtex-entry]
     
  9. Hazel Everett, Sulamita Klein, and B. Reed. An optimal algorithm for finding clique-cross partitions. In Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), volume 135, pages 171--177, 1998. [bibtex-entry]
     
  10. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments. In D. Pritchard and J. Reeves, editors, Proceedings of Europar'98 (Distinguished Paper), volume 1470 of Lecture Notes in Computer Science, Southampton, UK, pages 875-886, September 1998. Springer Verlag. [bibtex-entry]
     
  11. L. Liquori. On Object Extension. In ECOOP, European Conference on Object Oriented Programming, volume 1445 of Lecture Notes in Computer Science, pages 498--552, 1998. Springer Verlag. [POSTSCRIPT ] [bibtex-entry]
     
  12. L. Liquori. Bounded Polymorphism for Extensible Objects. In Types, International Workshop on Types for Proof and Programs, volume 1657 of Lecture Notes in Computer Science, pages 149--163, 1998. Springer Verlag. [POSTSCRIPT ] [bibtex-entry]
     
  13. M. Molloy and B. Reed. Colouring graphs where chromatic number is almost their maximum degree. In LATIN'98: theoretical informatics (Campinas, 1998), volume 1380 of Lecture Notes in Comput. Sci., Berlin, pages 216--225, 1998. Springer. [bibtex-entry]
     
Internal reports
  1. 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]
     
  2. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Parallel Architecture Issues. Technical report, Hipertrans Consortium, 1998. [bibtex-entry]
     
  3. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Car Following Algorithms. Technical report, Hipertrans Consortium, 1998. [bibtex-entry]
     
Miscellaneous
  1. A. Jarry. Théorie des graphes : chemins disjoints. Rapport de stage de magistère d'informatique, ENS Lyon, 1998. [bibtex-entry]
     
  2. H. Rivano. Communication par constellations de satellites : reroutage pour les télécommunications mobiles. Rapport de stage de première année de Magistère d'Informatique et de Modélisation, ENS Lyon, 1998. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]
     
  3. E. Darrot and B. Vaillant. Matrice de commutateurs à deux positions chacun. Demande de Brevet 98 15 397 déposée en France le 7 décembre 1998 au nom d'Alcatel, 1998. [bibtex-entry]
     
  4. L. Liquori. An Introduction to SmallTalk. École Normale Supérieure de Lyon, 1998-1999.
    Note: Cours POOGL : Programmation à Objets et Génie Logiciel. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Tue Jul 25 17:12:04 2017