MASCOTTE no longer exists => visit the new COATI project-team


Publications of year 1989

Articles in journal or book chapters
  1. J.-C. Bermond, K. Berrada, and J. Bond. Extensions of networks with given diameter. Discrete Math., 75(1-3):31--40, 1989.
    Note: Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988). [bibtex-entry]

  2. J.-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of Cayley graphs of degree $4$. J. Combin. Theory Ser. B, 46(2):142--153, 1989. [bibtex-entry]

  3. J.-C. Bermond and J.-M. Fourneau. Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks. Theoret. Comput. Sci., 64(2):191--201, 1989. [bibtex-entry]

  4. J.-C. Bermond, N. Homobono, and C. Peyrat. Large fault-tolerant interconnection networks. Graphs Combin., 5(2):107--123, 1989. [bibtex-entry]

  5. J.-C. Bermond and C. Peyrat. Induced subgraphs of the power of a cycle. SIAM J. Discrete Math., 2(4):452--455, 1989. [bibtex-entry]

  6. M. Cosnard, J. Duprat, and A. Ferreira. Complexity of selection in X+Y. Theoretical Computer Science, 67:115--120, 1989. [bibtex-entry]

  7. M. Cosnard and A. Ferreira. Generating Permutations on a VLSI Suitable Linear Network. The Computer Journal, 32(6):571--573, 1989. [bibtex-entry]

  8. C. T. Hoàng and B. A. Reed. $P\sb 4$-comparability graphs. Discrete Math., 74(1-2):173--200, 1989.
    Note: Graph colouring and variations. [bibtex-entry]

  9. C. T. Hoàng and B. A. Reed. Some classes of perfectly orderable graphs. J. Graph Theory, 13(4):445--463, 1989. [bibtex-entry]

  10. C. J. H. McDiarmid and B. A. Reed. Building heaps fast. J. Algorithms, 10(3):352--365, 1989. [bibtex-entry]

Conference articles
  1. J.-C. Bermond, G. Illiades, and C. Peyrat. An optimization problem in distributed loop computer networks. In Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), volume 555 of Ann. New York Acad. Sci., New York, pages 45--55, 1989. New York Acad. Sci.. [bibtex-entry]

  2. J.-C. Bermond and J.-C. Konig. General and efficient decentralized consensus protocols II. In Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France, pages 199--210, 1989. North-Holland. [bibtex-entry]

  3. J.-C. Bermond and C. Peyrat. De Bruijn and Kautz networks: a competitor for the hypercube?. In F. André and J-P. Verjus, editors, Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes, pages 279--293, 1989. North Holland. [bibtex-entry]

  4. M. Cosnard and A. Ferreira. Parallel algorithms for searching in X+Y. In F.Ris and P.M.Kogge, editors, Proceedings of the International Conference on Parallel Processing -- ICPP'89, volume 3, pages 16--19, 1989. Penn State University Press. [bibtex-entry]

  5. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel branch and bound on fine grained hypercube multiprocessors. In Proceedings of the IEEE Workshop on Tools for AI, Herndon, VA (USA), pages 616--622, 1989. IEEE Press. [bibtex-entry]

  6. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel fractional cascading on a hypercube multiprocessor. In Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing, pages 1084--1093, October 1989. [bibtex-entry]

  7. A. Ferreira. The Knapsack Problem on Parallel Architectures. In M. Cosnard et al., editor, Parallel and Distributed Algorithms, pages 145--152, 1989. North-Holland. [bibtex-entry]

  8. A. Ferreira and M. Gastaldo. Implementing sorting on a hypercube. In F. André et J.-P. Verjus, editor, Hypercube and Distributed Computers, pages 359--360, 1989. INRIA-North-Holland. [bibtex-entry]

  9. Z. Liu and P. Mussi. Performance evaluation of a deadlock free protocol for blocking rings. In International Conference on Super Computing, June 1989. [bibtex-entry]

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

  2. A. Ferreira. An optimal ${O(n^2)}$ algorithm to fold special PLA's. Technical report, 1989.
    Note: (abstract). [bibtex-entry]

  3. P. Mussi and P. Nain. Description and Specifications for New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989. [bibtex-entry]

  4. P. Mussi and P. Nain. On New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989. [bibtex-entry]


Last modified: Thu Oct 10 14:10:00 2013

This document was translated from BibTEX by bibtex2html