Publications of year 1991

Articles in journal or book chapters
  1. N. Alon, C. McDiarmid, and B. Reed. Acyclic coloring of graphs. Random Structures Algorithms, 2(3):277--288, 1991. [bibtex-entry]

  2. J.-C. Bermond and J.-C. Konig. Un protocole distribué pour la 2-connexité. TSI, 10(4):269--274, 1991. [bibtex-entry]

  3. J.-C. Bermond and D. Tzvieli. Minimal diameter double loop networks, part II: dense optimal families. Networks, 21:1--9, 1991. [bibtex-entry]

  4. M. Cosnard and A. Ferreira. On the real power of loosely coupled parallel architectures. Parallel Processing Letters, 1(2):103--111, 1991. [bibtex-entry]

  5. A. Ferreira. A parallel time/hardware tradeoff $T.H = O(2^{n/2})$ for the knapsack problem. IEEE Transactions on Computers, 40(2):221--225, 1991. [bibtex-entry]

Conference articles
  1. M. Cosnard and A. Ferreira. A tight bound for selection in X+Y. In F. Dehne et al., editor, Advances in Computing and Information - ICCI '91, volume 497 of Lecture Notes in Computer Science, pages 134--138, 1991. Springer-Verlag. [bibtex-entry]

  2. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Efficient parallel construction and manipulation of pointer based quadtrees. In Proceedings of the International Conference on Parallel Processing -- ICPP'91, St. Charles (USA), pages 255--262, 1991. [bibtex-entry]

  3. A. Ferreira and J. Peters. Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor. In Proceedings of the Third Canadian Conference on Computational Geometry -- CCCG'91, Vancouver (Ca), pages 162--165, 1991. [bibtex-entry]

Internal reports
  1. P. Mussi and H. Rakotoarisoa. PARallélisation sur réseaux de Transputers de Simulations pour l'EVALuation de performances. Rapport technique 131, INRIA Sophia Antipolis, Septembre 1991. [bibtex-entry]


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

This document was translated from BibTEX by bibtex2html